1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/********************* */
/*! \file smt2info.cpp
** \verbatim
** Top contributors (to current version):
** Dejan Jovanovic, Aina Niemetz, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include <cassert>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
#include <cvc4/api/cvc4cpp.h>
#include <cvc4/cvc4.h>
using namespace std;
using namespace CVC4;
using namespace CVC4::parser;
using namespace CVC4::options;
unsigned compute_degree(ExprManager& exprManager, const Expr& term) {
unsigned n = term.getNumChildren();
unsigned degree = 0;
// boolean stuff
if (term.getType() == exprManager.booleanType()) {
for (unsigned i = 0; i < n; ++ i) {
degree = std::max(degree, compute_degree(exprManager, term[i]));
}
return degree;
}
// terms
if (n == 0) {
if (term.getKind() == kind::CONST_RATIONAL) {
return 0;
} else {
return 1;
}
} else {
unsigned degree = 0;
if (term.getKind() == kind::MULT) {
for (unsigned i = 0; i < n; ++ i) {
degree += std::max(degree, compute_degree(exprManager, term[i]));
}
} else {
for (unsigned i = 0; i < n; ++ i) {
degree = std::max(degree, compute_degree(exprManager, term[i]));
}
}
return degree;
}
}
int main(int argc, char* argv[])
{
try {
// Get the filename
string input(argv[1]);
// Create the expression manager
Options options;
options.setInputLanguage(language::input::LANG_SMTLIB_V2);
std::unique_ptr<api::Solver> solver =
std::unique_ptr<api::Solver>(new api::Solver(&options));
// Create the parser
ParserBuilder parserBuilder(solver.get(), input, options);
Parser* parser = parserBuilder.build();
// Variables and assertions
vector<string> variables;
vector<string> info_tags;
vector<string> info_data;
vector<Expr> assertions;
Command* cmd;
while ((cmd = parser->nextCommand())) {
SetInfoCommand* setinfo = dynamic_cast<SetInfoCommand*>(cmd);
if (setinfo) {
info_tags.push_back(setinfo->getFlag());
info_data.push_back(setinfo->getSExpr().getValue());
delete cmd;
continue;
}
DeclareFunctionCommand* declare = dynamic_cast<DeclareFunctionCommand*>(cmd);
if (declare) {
variables.push_back(declare->getSymbol());
delete cmd;
continue;
}
AssertCommand* assert = dynamic_cast<AssertCommand*>(cmd);
if (assert) {
assertions.push_back(assert->getExpr());
delete cmd;
continue;
}
delete cmd;
}
cout << "variables: " << variables.size() << endl;
unsigned total_degree = 0;
for (unsigned i = 0; i < assertions.size(); ++ i) {
total_degree =
std::max(total_degree,
compute_degree(*solver->getExprManager(), assertions[i]));
}
cout << "degree: " << total_degree << endl;
// Get rid of the parser
delete parser;
} catch (Exception& e) {
cerr << e << endl;
}
}
|
