}
else
{
- bool reduced = false;
- if (!einfo.d_const.isNull() && nrc.getType().isBoolean())
+ // if this was a predicate which changed after substitution + rewriting
+ if (!einfo.d_const.isNull() && nrc.getType().isBoolean() && nrc != n)
{
bool pol = einfo.d_const == d_true;
Node nrcAssert = pol ? nrc : nrc.negate();
Trace("strings-extf-debug") << " decomposable..." << std::endl;
Trace("strings-extf") << " resolve extf : " << sn << " -> " << nrc
<< ", const = " << einfo.d_const << std::endl;
- reduced = sendInternalInference(
+ // We send inferences internal here, which may help show unsat.
+ // However, we do not make a determination whether n can be marked
+ // reduced since this argument may be circular: we may infer than n
+ // can be reduced to something else, but that thing may argue that it
+ // can be reduced to n, in theory.
+ sendInternalInference(
einfo.d_exp, nrcAssert, effort == 0 ? "EXTF_d" : "EXTF_d-N");
- if (!reduced)
- {
- Trace("strings-extf") << "EXT: could not fully reduce ";
- Trace("strings-extf")
- << nAssert << " via " << nrcAssert << std::endl;
- }
- }
- if (reduced)
- {
- getExtTheory()->markReduced(n);
- }
- else
- {
- to_reduce = nrc;
}
+ to_reduce = nrc;
}
}else{
to_reduce = sterms[i];
regress0/strings/ilc-like.smt2
regress0/strings/indexof-sym-simp.smt2
regress0/strings/issue1189.smt2
+ regress0/strings/issue2958.smt2
regress0/strings/itos-entail.smt2
regress0/strings/leadingzero001.smt2
regress0/strings/loop001.smt2
--- /dev/null
+(set-info :smt-lib-version 2.5)
+(set-logic QF_SLIA)
+(set-info :status unsat)
+(declare-const x String)
+(assert (not (str.prefixof "ab" x)))
+(assert (str.in.re (str.substr x 0 2) (re.++ (str.to.re "ab") (re.* (str.to.re "dcab")))))
+(check-sat)