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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/********************* */
/*! \file proof_utils.h
** \verbatim
** Top contributors (to current version):
** Liana Hadarean
** This file is part of the CVC4 project.
** Copyright (c) 2009-2016 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
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "cvc4_private.h"
#pragma once
#include <set>
#include <vector>
#include <sstream>
#include "expr/node_manager.h"
namespace CVC4 {
typedef __gnu_cxx::hash_set<Expr, ExprHashFunction> ExprSet;
typedef __gnu_cxx::hash_set<Node, NodeHashFunction> NodeSet;
namespace utils {
std::string toLFSCKind(Kind kind);
inline unsigned getExtractHigh(Expr node) {
return node.getOperator().getConst<BitVectorExtract>().high;
}
inline unsigned getExtractLow(Expr node) {
return node.getOperator().getConst<BitVectorExtract>().low;
}
inline unsigned getSize(Type type) {
BitVectorType bv(type);
return bv.getSize();
}
inline unsigned getSize(Expr node) {
Assert (node.getType().isBitVector());
return getSize(node.getType());
}
inline Expr mkTrue() {
return NodeManager::currentNM()->toExprManager()->mkConst<bool>(true);
}
inline Expr mkFalse() {
return NodeManager::currentNM()->toExprManager()->mkConst<bool>(false);
}
inline BitVector mkBitVectorOnes(unsigned size) {
Assert(size > 0);
return BitVector(1, Integer(1)).signExtend(size - 1);
}
inline Expr mkExpr(Kind k , Expr expr) {
return NodeManager::currentNM()->toExprManager()->mkExpr(k, expr);
}
inline Expr mkExpr(Kind k , Expr e1, Expr e2) {
return NodeManager::currentNM()->toExprManager()->mkExpr(k, e1, e2);
}
inline Expr mkExpr(Kind k , std::vector<Expr>& children) {
return NodeManager::currentNM()->toExprManager()->mkExpr(k, children);
}
inline Expr mkOnes(unsigned size) {
BitVector val = mkBitVectorOnes(size);
return NodeManager::currentNM()->toExprManager()->mkConst<BitVector>(val);
}
inline Expr mkConst(unsigned size, unsigned int value) {
BitVector val(size, value);
return NodeManager::currentNM()->toExprManager()->mkConst<BitVector>(val);
}
inline Expr mkConst(const BitVector& value) {
return NodeManager::currentNM()->toExprManager()->mkConst<BitVector>(value);
}
inline Expr mkOr(const std::vector<Expr>& nodes) {
std::set<Expr> all;
all.insert(nodes.begin(), nodes.end());
Assert(all.size() != 0 );
if (all.size() == 1) {
// All the same, or just one
return nodes[0];
}
NodeBuilder<> disjunction(kind::OR);
std::set<Expr>::const_iterator it = all.begin();
std::set<Expr>::const_iterator it_end = all.end();
while (it != it_end) {
disjunction << Node::fromExpr(*it);
++ it;
}
Node res = disjunction;
return res.toExpr();
}/* mkOr() */
inline Expr mkAnd(const std::vector<Expr>& conjunctions) {
std::set<Expr> all;
all.insert(conjunctions.begin(), conjunctions.end());
if (all.size() == 0) {
return mkTrue();
}
if (all.size() == 1) {
// All the same, or just one
return conjunctions[0];
}
NodeBuilder<> conjunction(kind::AND);
std::set<Expr>::const_iterator it = all.begin();
std::set<Expr>::const_iterator it_end = all.end();
while (it != it_end) {
conjunction << Node::fromExpr(*it);
++ it;
}
Node res = conjunction;
return res.toExpr();
}/* mkAnd() */
inline Expr mkSortedExpr(Kind kind, const std::vector<Expr>& children) {
std::set<Expr> all;
all.insert(children.begin(), children.end());
if (all.size() == 0) {
return mkTrue();
}
if (all.size() == 1) {
// All the same, or just one
return children[0];
}
NodeBuilder<> res(kind);
std::set<Expr>::const_iterator it = all.begin();
std::set<Expr>::const_iterator it_end = all.end();
while (it != it_end) {
res << Node::fromExpr(*it);
++ it;
}
return ((Node)res).toExpr();
}/* mkSortedNode() */
inline const bool getBit(Expr expr, unsigned i) {
Assert (i < utils::getSize(expr) &&
expr.isConst());
Integer bit = expr.getConst<BitVector>().extract(i, i).getValue();
return (bit == 1u);
}
void collectAtoms(TNode node, NodeSet& seen);
}
}
|
