void JustificationHeuristic::computeITEs(TNode n, IteList &l)
{
Trace("jh-ite") << " computeITEs( " << n << ", &l)\n";
+ d_visitedComputeITE.insert(n);
for(unsigned i=0; i<n.getNumChildren(); ++i) {
SkolemMap::iterator it2 = d_iteAssertions.find(n[i]);
if(it2 != d_iteAssertions.end()) {
l.push_back(make_pair(n[i], it2->second));
Assert(n[i].getNumChildren() == 0);
}
- computeITEs(n[i], l);
+ if(d_visitedComputeITE.find(n[i]) ==
+ d_visitedComputeITE.end()) {
+ computeITEs(n[i], l);
+ }
}
}
// Compute the list of ITEs
// TODO: optimize by avoiding multiple lookup for d_iteCache[n]
d_iteCache[n] = IteList();
+ d_visitedComputeITE.clear();
computeITEs(n, d_iteCache[n]);
return d_iteCache[n];
}
* term-ITE.
*/
hash_set<TNode,TNodeHashFunction> d_visited;
+
+ /**
+ * Set to track visited nodes in a dfs search done in computeITE
+ * function
+ */
+ hash_set<TNode,TNodeHashFunction> d_visitedComputeITE;
public:
JustificationHeuristic(CVC4::DecisionEngine* de, context::Context *c):
ITEDecisionStrategy(de, c),