diff options
| -rw-r--r-- | src/theory/arrays/options | 2 | ||||
| -rw-r--r-- | src/theory/arrays/theory_arrays.cpp | 2 |
2 files changed, 1 insertions, 3 deletions
diff --git a/src/theory/arrays/options b/src/theory/arrays/options index 41c56f51d..8a971cfe8 100644 --- a/src/theory/arrays/options +++ b/src/theory/arrays/options @@ -14,7 +14,7 @@ option arraysLazyRIntro1 --arrays-lazy-rintro1 bool :default true :read-write option arraysModelBased --arrays-model-based bool :default false :read-write turn on model-based arrray solver -option arraysEagerIndexSplitting --arrays-eager-index bool :default false :read-write +option arraysEagerIndexSplitting --arrays-eager-index bool :default true :read-write turn on eager index splitting for generated array lemmas endmodule diff --git a/src/theory/arrays/theory_arrays.cpp b/src/theory/arrays/theory_arrays.cpp index 02575edd4..9ed6de31f 100644 --- a/src/theory/arrays/theory_arrays.cpp +++ b/src/theory/arrays/theory_arrays.cpp @@ -1009,7 +1009,6 @@ void TheoryArrays::checkModel(Effort e) context::CDList<TNode>::const_iterator shared_it = shared_terms_begin(), shared_it_end = shared_terms_end(), shared_it2; Node modelVal, modelVal2, d; vector<TNode> assumptions; - bool invert; for (; shared_it != shared_it_end; ++shared_it) { if ((*shared_it).getType().isArray()) { continue; @@ -1038,7 +1037,6 @@ void TheoryArrays::checkModel(Effort e) } } Assert(modelVal2.isConst()); - invert = (modelVal != modelVal2); d = (*shared_it).eqNode(*shared_it2); if (modelVal != modelVal2) { d = d.notNode(); |