Var x = var(trail.last());
assigns [x] = l_Undef;
vardata[x].trail_index = -1;
- polarity[x] = sign(trail.last());
+ if(phase_saving >= 1 && (polarity[x] & 0x2) == 0)
+ polarity[x] = sign(trail.last());
if(intro_level(x) != -1) {// might be unregistered
insertVarOrder(x);
}
void TheoryModel::addSubstitution( TNode x, TNode t, bool invalidateCache ){
if( !d_substitutions.hasSubstitution( x ) ){
d_substitutions.addSubstitution( x, t, invalidateCache );
+ } else {
+#ifdef CVC4_ASSERTIONS
+ Node oldX = d_substitutions.getSubstitution(x);
+ // check that either the old substitution is the same, or it now maps to the new substitution
+ if(oldX != t && d_substitutions.apply(oldX) != d_substitutions.apply(t)) {
+ stringstream ss;
+ ss << "Two incompatible substitutions added to TheoryModel:\n"
+ << "the term: " << x << "\n"
+ << "old mapping: " << d_substitutions.apply(oldX) << "\n"
+ << "new mapping: " << d_substitutions.apply(t);
+ InternalError(ss.str());
+ }
+#endif /* CVC4_ASSERTIONS */
}
}
/**
* Adds a substitution from x to t.
*/
- void addSubstitution(TNode x, TNode t,
- bool invalidateCache = true);
+ void addSubstitution(TNode x, TNode t, bool invalidateCache = true);
/**
* Returns true iff x is in the substitution map
*/
- bool hasSubstitution(TNode x)
- { return d_substitutions.find(x) != d_substitutions.end(); }
+ bool hasSubstitution(TNode x) const {
+ return d_substitutions.find(x) != d_substitutions.end();
+ }
+
+ /**
+ * Returns the substitution mapping that was given for x via
+ * addSubstitution(). Note that the returned value might itself
+ * be in the map; for the actual substitution that would be
+ * performed for x, use .apply(x). This getSubstitution() function
+ * is mainly intended for constructing assertions about what has
+ * already been put in the map.
+ */
+ TNode getSubstitution(TNode x) const {
+ AssertArgument(hasSubstitution(x), x, "element not in this substitution map");
+ return (*d_substitutions.find(x)).second;
+ }
/**
* Apply the substitutions to the node.