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
179
180
181
182
|
/********************* */
/*! \file term_registration_visitor.h
** \verbatim
** Original author: dejan
** Major contributors:
** Minor contributors (to current version):
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**/
#include "theory/term_registration_visitor.h"
#include "theory/theory_engine.h"
using namespace std;
using namespace CVC4;
using namespace theory;
std::string PreRegisterVisitor::toString() const {
std::stringstream ss;
TNodeVisitedMap::const_iterator it = d_visited.begin();
for (; it != d_visited.end(); ++ it) {
ss << (*it).first << ": " << Theory::setToString((*it).second) << std::endl;
}
return ss.str();
}
bool PreRegisterVisitor::alreadyVisited(TNode current, TNode parent) const {
Debug("register::internal") << "PreRegisterVisitor::alreadyVisited(" << current << "," << parent << ") => ";
TNodeVisitedMap::iterator find = d_visited.find(current);
// If node is not visited at all, just return false
if (find == d_visited.end()) {
Debug("register::internal") << "1:false" << std::endl;
return false;
}
Theory::Set theories = (*find).second;
TheoryId currentTheoryId = Theory::theoryOf(current);
TheoryId parentTheoryId = Theory::theoryOf(parent);
if (Theory::setContains(currentTheoryId, theories)) {
// The current theory has already visited it, so now it depends on the parent
Debug("register::internal") << (Theory::setContains(parentTheoryId, theories) ? "2:true" : "2:false") << std::endl;
return Theory::setContains(parentTheoryId, theories);
} else {
// If the current theory is not registered, it still needs to be visited
Debug("register::internal") << "2:false" << std::endl;
return false;
}
}
void PreRegisterVisitor::visit(TNode current, TNode parent) {
Debug("register") << "PreRegisterVisitor::visit(" << current << "," << parent << ")" << std::endl;
Debug("register::internal") << toString() << std::endl;
// Get the theories of the terms
TheoryId currentTheoryId = Theory::theoryOf(current);
TheoryId parentTheoryId = Theory::theoryOf(parent);
Theory::Set theories = d_visited[current];
Debug("register::internal") << "PreRegisterVisitor::visit(" << current << "," << parent << "): previously registered with " << Theory::setToString(theories) << std::endl;
if (!Theory::setContains(currentTheoryId, theories)) {
d_multipleTheories = d_multipleTheories || (theories != 0);
d_visited[current] = theories = Theory::setInsert(currentTheoryId, theories);
d_engine->theoryOf(currentTheoryId)->preRegisterTerm(current);
d_theories = Theory::setInsert(currentTheoryId, d_theories);
Debug("register::internal") << "PreRegisterVisitor::visit(" << current << "," << parent << "): adding " << currentTheoryId << std::endl;
}
if (!Theory::setContains(parentTheoryId, theories)) {
d_multipleTheories = d_multipleTheories || (theories != 0);
d_visited[current] = theories = Theory::setInsert(parentTheoryId, theories);
d_engine->theoryOf(parentTheoryId)->preRegisterTerm(current);
d_theories = Theory::setInsert(parentTheoryId, d_theories);
Debug("register::internal") << "PreRegisterVisitor::visit(" << current << "," << parent << "): adding " << parentTheoryId << std::endl;
}
Debug("register::internal") << "PreRegisterVisitor::visit(" << current << "," << parent << "): now registered with " << Theory::setToString(theories) << std::endl;
Assert(d_visited.find(current) != d_visited.end());
Assert(alreadyVisited(current, parent));
}
void PreRegisterVisitor::start(TNode node) {
d_theories = 0;
d_multipleTheories = false;
}
bool PreRegisterVisitor::done(TNode node) {
d_engine->markActive(d_theories);
return d_multipleTheories;
}
std::string SharedTermsVisitor::toString() const {
std::stringstream ss;
TNodeVisitedMap::const_iterator it = d_visited.begin();
for (; it != d_visited.end(); ++ it) {
ss << (*it).first << ": " << Theory::setToString((*it).second) << std::endl;
}
return ss.str();
}
bool SharedTermsVisitor::alreadyVisited(TNode current, TNode parent) const {
Debug("register::internal") << "SharedTermsVisitor::alreadyVisited(" << current << "," << parent << ") => ";
TNodeVisitedMap::const_iterator find = d_visited.find(current);
// If node is not visited at all, just return false
if (find == d_visited.end()) {
Debug("register::internal") << "1:false" << std::endl;
return false;
}
Theory::Set theories = (*find).second;
TheoryId currentTheoryId = Theory::theoryOf(current);
TheoryId parentTheoryId = Theory::theoryOf(parent);
if (Theory::setContains(currentTheoryId, theories)) {
// The current theory has already visited it, so now it depends on the parent
Debug("register::internal") << (Theory::setContains(parentTheoryId, theories) ? "2:true" : "2:false") << std::endl;
return Theory::setContains(parentTheoryId, theories);
} else {
// If the current theory is not registered, it still needs to be visited
Debug("register::internal") << "2:false" << std::endl;
return false;
}
}
void SharedTermsVisitor::visit(TNode current, TNode parent) {
Debug("register") << "SharedTermsVisitor::visit(" << current << "," << parent << ")" << std::endl;
Debug("register::internal") << toString() << std::endl;
// Get the theories of the terms
TheoryId currentTheoryId = Theory::theoryOf(current);
TheoryId parentTheoryId = Theory::theoryOf(parent);
Theory::Set theories = d_visited[current];
unsigned theoriesCount = theories == 0 ? 0 : 1;
Debug("register::internal") << "SharedTermsVisitor::visit(" << current << "," << parent << "): previously registered with " << Theory::setToString(theories) << std::endl;
if (!Theory::setContains(currentTheoryId, theories)) {
d_visited[current] = theories = Theory::setInsert(currentTheoryId, theories);
theoriesCount ++;
Debug("register::internal") << "SharedTermsVisitor::visit(" << current << "," << parent << "): adding " << currentTheoryId << std::endl;
}
if (!Theory::setContains(parentTheoryId, theories)) {
d_visited[current] = theories = Theory::setInsert(parentTheoryId, theories);
theoriesCount ++;
Debug("register::internal") << "SharedTermsVisitor::visit(" << current << "," << parent << "): adding " << parentTheoryId << std::endl;
}
Debug("register::internal") << "SharedTermsVisitor::visit(" << current << "," << parent << "): now registered with " << Theory::setToString(theories) << std::endl;
// If there is more than two theories and a new one has been added notify the shared terms database
if (theoriesCount > 1) {
d_sharedTerms.addSharedTerm(d_atom, current, theories);
}
Assert(d_visited.find(current) != d_visited.end());
Assert(alreadyVisited(current, parent));
}
void SharedTermsVisitor::start(TNode node) {
clear();
d_atom = node;
}
void SharedTermsVisitor::done(TNode node) {
clear();
}
void SharedTermsVisitor::clear() {
d_atom = TNode();
d_visited.clear();
}
|
