tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +55 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +146 -58
- package/dist/prove.js +143 -55
- package/dist/run.cjs +43 -43
- package/dist/run.js +45 -45
- package/dist/transfer.cjs +29 -26
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +261 -68
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +1 -1
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +2 -6
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/index.ts +5 -3
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +0 -2
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +224 -82
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +86 -49
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -9
- package/src/prover/isabelle/isar/method.ts +5 -9
- package/src/prover/isabelle/isar/proof.ts +33 -18
- package/src/prover/isabelle/isar/rule-cases.ts +14 -22
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -56
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +1 -3
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +0 -2
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/methods.ts +50 -3
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +3 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +25 -16
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +3 -6
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +0 -1
- package/src/prover/smt/solver/asserted-formulas.ts +9 -3
- package/src/prover/smt/solver/ast-lt.ts +1 -2
- package/src/prover/smt/solver/ast-util.ts +3 -3
- package/src/prover/smt/solver/ast.ts +112 -156
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +15 -19
- package/src/prover/smt/solver/bv1-blast.ts +1 -11
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +1 -4
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +19 -16
- package/src/prover/smt/solver/check-logic.ts +6 -2
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +0 -1
- package/src/prover/smt/solver/context.ts +41 -14
- package/src/prover/smt/solver/ctx-simplify.ts +1 -3
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +2 -5
- package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +1 -3
- package/src/prover/smt/solver/distribute-forall.ts +1 -11
- package/src/prover/smt/solver/dom-simplify.ts +1 -3
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
- package/src/prover/smt/solver/enode.ts +15 -2
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
- package/src/prover/smt/solver/euf/egraph.ts +68 -43
- package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
- package/src/prover/smt/solver/euf/mam.ts +7 -55
- package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
- package/src/prover/smt/solver/euf/q-solver.ts +2 -2
- package/src/prover/smt/solver/euf/th-solver.ts +1 -10
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +204 -80
- package/src/prover/smt/solver/factor.ts +37 -26
- package/src/prover/smt/solver/fd-solver.ts +3 -5
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +1 -3
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +19 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/goal.ts +3 -2
- package/src/prover/smt/solver/goal2nlsat.ts +57 -32
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +41 -3
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +0 -1
- package/src/prover/smt/solver/lia2pb.ts +18 -5
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +26 -7
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +1 -2
- package/src/prover/smt/solver/macro-finder.ts +1 -4
- package/src/prover/smt/solver/mam-compiler.ts +14 -15
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +5 -14
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
- package/src/prover/smt/solver/maxlex.ts +0 -8
- package/src/prover/smt/solver/maxsmt-base.ts +7 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
- package/src/prover/smt/solver/model-based-opt.ts +1 -2
- package/src/prover/smt/solver/model-checker.ts +0 -1
- package/src/prover/smt/solver/model-evaluator.ts +9 -6
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +3 -2
- package/src/prover/smt/solver/model-macro-solver.ts +3 -4
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +2 -5
- package/src/prover/smt/solver/mus.ts +1 -3
- package/src/prover/smt/solver/muz/dl-context.ts +67 -9
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
- package/src/prover/smt/solver/muz/hnf.ts +6 -6
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
- package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
- package/src/prover/smt/solver/muz/substitution.ts +88 -39
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +4 -4
- package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +379 -217
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +112 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +15 -10
- package/src/prover/smt/solver/opt-nlsat.ts +97 -77
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +22 -11
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +13 -12
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +2 -3
- package/src/prover/smt/solver/pb-rewriter.ts +14 -20
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +2 -3
- package/src/prover/smt/solver/probes.ts +4 -7
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +6 -7
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +50 -16
- package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +13 -24
- package/src/prover/smt/solver/qe.ts +48 -57
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +70 -91
- package/src/prover/smt/solver/quant-hoist.ts +0 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +14 -10
- package/src/prover/smt/solver/quasi-macros.ts +9 -20
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +17 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
- package/src/prover/smt/solver/rewriter.ts +1 -2
- package/src/prover/smt/solver/rlimit.ts +13 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
- package/src/prover/smt/solver/sat/clause.ts +1 -6
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +4 -7
- package/src/prover/smt/solver/sat/consequences.ts +1 -2
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
- package/src/prover/smt/solver/sat/model-converter.ts +2 -18
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
- package/src/prover/smt/solver/sat/probing.ts +22 -21
- package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
- package/src/prover/smt/solver/sat/scc.ts +0 -1
- package/src/prover/smt/solver/sat/simplifier.ts +16 -60
- package/src/prover/smt/solver/sat/solver.ts +45 -68
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +7 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +20 -36
- package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
- package/src/prover/smt/solver/seq-derive.ts +9 -15
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
- package/src/prover/smt/solver/seq-factory.ts +0 -1
- package/src/prover/smt/solver/seq-monadic.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
- package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
- package/src/prover/smt/solver/seq-re-util.ts +2 -5
- package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
- package/src/prover/smt/solver/seq-regex-live.ts +6 -8
- package/src/prover/smt/solver/seq-rewriter.ts +31 -34
- package/src/prover/smt/solver/seq-skolem.ts +0 -24
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +4 -6
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +8 -3
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +18 -14
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
- package/src/prover/smt/solver/smtlib-script.ts +957 -750
- package/src/prover/smt/solver/solve-eqs.ts +11 -19
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -2
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +77 -18
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +25 -60
- package/src/prover/smt/solver/theory-bv.ts +15 -54
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +46 -79
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
- package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -2
- package/src/prover/smt/solver/theory-pb.ts +12 -11
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +2 -3
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
- package/src/prover/smt/solver/theory-seq-state.ts +8 -26
- package/src/prover/smt/solver/theory-seq.ts +32 -55
- package/src/prover/smt/solver/theory.ts +16 -2
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
- package/src/prover/smt/solver/var-subst.ts +2 -3
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/zenon/decide.ts +9 -13
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +12 -13
- package/src/prover/zenon/parse.ts +0 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +1 -3
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +165 -78
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,9 +1,6 @@
|
|
|
1
|
-
// Ported from Z3 (src/sat/sat_simplifier.h, src/sat/sat_simplifier.cpp,
|
|
2
|
-
// src/sat/sat_simplifier_params.pyg, src/sat/sat_clause_set.h, src/sat/sat_clause_set.cpp,
|
|
3
|
-
// src/util/heap.h, src/util/util.h), MIT license, see z3-license.txt.
|
|
4
1
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
5
2
|
import type { RandomGen } from "../random-gen";
|
|
6
|
-
import { type ClauseArena, NULL_LITERAL } from "./clause";
|
|
3
|
+
import { type ClauseArena, NULL_LITERAL, UINT_MAX } from "./clause";
|
|
7
4
|
import { UseList } from "./clause-use-list";
|
|
8
5
|
import { getBool, getNumber, type SatParams } from "./config";
|
|
9
6
|
import { MC_ABCE, MC_ACCE, MC_BCE, MC_CCE, MC_ELIM_VAR } from "./model-converter";
|
|
@@ -17,8 +14,6 @@ const ABCE_T = 3;
|
|
|
17
14
|
const ATE_T = 4;
|
|
18
15
|
const NO_T = 5;
|
|
19
16
|
|
|
20
|
-
const UINT_MAX = 4294967295;
|
|
21
|
-
|
|
22
17
|
const isApproxSubset = (first: number, second: number) => (first | second) === second;
|
|
23
18
|
|
|
24
19
|
const shuffle = (lits: number[], rand: RandomGen) => {
|
|
@@ -606,7 +601,6 @@ class BlockedClauseElim {
|
|
|
606
601
|
if (!this.isSelectClause(2)) continue;
|
|
607
602
|
const other = wlist.getLiteral(index);
|
|
608
603
|
const result = this.cceBinary(lit, other, elimType);
|
|
609
|
-
this.incBc(result);
|
|
610
604
|
if (result === ATE_T) {
|
|
611
605
|
wlist.setLearned(index, true);
|
|
612
606
|
solver.setLearned1(other, lit, true);
|
|
@@ -633,7 +627,6 @@ class BlockedClauseElim {
|
|
|
633
627
|
if (arena.wasRemoved(clause) || arena.isLearned(clause)) continue;
|
|
634
628
|
if (!this.isSelectClause(arena.size[clause])) continue;
|
|
635
629
|
const result = this.cceClause(clause, elimType);
|
|
636
|
-
this.incBc(result);
|
|
637
630
|
if (result === ATE_T) {
|
|
638
631
|
solver.mc.addAte(this.coveredClause);
|
|
639
632
|
simplifier.setLearnedClause(clause);
|
|
@@ -646,15 +639,6 @@ class BlockedClauseElim {
|
|
|
646
639
|
}
|
|
647
640
|
}
|
|
648
641
|
|
|
649
|
-
private incBc(elimType: number) {
|
|
650
|
-
const simplifier = this.simplifier;
|
|
651
|
-
if (elimType === CCE_T) simplifier.numCce++;
|
|
652
|
-
else if (elimType === ACCE_T) simplifier.numAcce++;
|
|
653
|
-
else if (elimType === ABCE_T) simplifier.numAbce++;
|
|
654
|
-
else if (elimType === ATE_T) simplifier.numAte++;
|
|
655
|
-
else if (elimType === BCE_T) simplifier.numBce++;
|
|
656
|
-
}
|
|
657
|
-
|
|
658
642
|
private isSelectClause(size: number) {
|
|
659
643
|
return size > 3 || this.simplifier.solver.rand.next() % 4 === 0;
|
|
660
644
|
}
|
|
@@ -668,7 +652,6 @@ class BlockedClauseElim {
|
|
|
668
652
|
if (lit !== this.blocked && this.isProcessVar(lit >> 1)) this.queue.decreased(lit ^ 1);
|
|
669
653
|
}
|
|
670
654
|
solver.mc.insert(entry, this.coveredClause);
|
|
671
|
-
solver.mc.setClause(entry, arena.getLits(clause));
|
|
672
655
|
}
|
|
673
656
|
|
|
674
657
|
private blockCoveredBinary(other: number, lit: number) {
|
|
@@ -676,7 +659,6 @@ class BlockedClauseElim {
|
|
|
676
659
|
const entry = solver.mc.mk(this.kind, this.blocked >> 1);
|
|
677
660
|
this.simplifier.setLearnedBinary(lit, other);
|
|
678
661
|
solver.mc.insert(entry, this.coveredClause);
|
|
679
|
-
solver.mc.setClause(entry, [lit, other]);
|
|
680
662
|
if (this.isProcessVar(other >> 1)) this.queue.decreased(other ^ 1);
|
|
681
663
|
}
|
|
682
664
|
}
|
|
@@ -719,15 +701,7 @@ export class Simplifier {
|
|
|
719
701
|
private isSubsumption: boolean;
|
|
720
702
|
private subsumptionLimit: number;
|
|
721
703
|
readonly isElimVars: boolean;
|
|
722
|
-
numBce = 0;
|
|
723
|
-
numCce = 0;
|
|
724
|
-
numAcce = 0;
|
|
725
|
-
numAbce = 0;
|
|
726
|
-
numAte = 0;
|
|
727
|
-
numSubsumed = 0;
|
|
728
704
|
numElimVars = 0;
|
|
729
|
-
numSubRes = 0;
|
|
730
|
-
numElimLits = 0;
|
|
731
705
|
private isLearnedInUseLists = false;
|
|
732
706
|
private oldNumElimVars = 0;
|
|
733
707
|
private bsClauses: number[] = [];
|
|
@@ -1092,33 +1066,30 @@ export class Simplifier {
|
|
|
1092
1066
|
const second = this.bsClauses[index];
|
|
1093
1067
|
const lit = this.bsLits[index];
|
|
1094
1068
|
if (!arena.wasRemoved(second) && lit === NULL_LITERAL) {
|
|
1095
|
-
if (arena.isLearned(first) && !arena.isLearned(second))
|
|
1069
|
+
if (arena.isLearned(first) && !arena.isLearned(second)) arena.setLearned(first, false);
|
|
1096
1070
|
this.removeClause(second);
|
|
1097
|
-
this.numSubsumed++;
|
|
1098
1071
|
} else if (!arena.wasRemoved(second)) {
|
|
1099
1072
|
this.elimLit(second, lit);
|
|
1100
|
-
this.numSubRes++;
|
|
1101
1073
|
}
|
|
1102
1074
|
if (solver.isInconsistent) break;
|
|
1103
1075
|
}
|
|
1104
1076
|
}
|
|
1105
1077
|
|
|
1106
|
-
|
|
1107
|
-
|
|
1108
|
-
if (clause !== this.dummy) this.useList.unblock(clause);
|
|
1109
|
-
}
|
|
1110
|
-
|
|
1078
|
+
// tmp_clause::set computes the approximation only when it allocates the clause, so every later
|
|
1079
|
+
// binary is filtered with the approximation of the first one.
|
|
1111
1080
|
private setDummy(first: number, second: number, isLearned: boolean) {
|
|
1112
1081
|
const arena = this.solver.arena;
|
|
1113
|
-
|
|
1082
|
+
const previousArena = this.dummyArena;
|
|
1083
|
+
if (previousArena !== arena) {
|
|
1084
|
+
const previous = this.dummy;
|
|
1114
1085
|
this.dummyArena = arena;
|
|
1115
1086
|
this.dummy = arena.mkClause([first, second], 2, isLearned);
|
|
1087
|
+
if (previousArena !== undefined) arena.approx[this.dummy] = previousArena.approx[previous];
|
|
1116
1088
|
return this.dummy;
|
|
1117
1089
|
}
|
|
1118
1090
|
arena.set(this.dummy, 0, first);
|
|
1119
1091
|
arena.set(this.dummy, 1, second);
|
|
1120
1092
|
arena.setLearned(this.dummy, isLearned);
|
|
1121
|
-
arena.updateApprox(this.dummy);
|
|
1122
1093
|
return this.dummy;
|
|
1123
1094
|
}
|
|
1124
1095
|
|
|
@@ -1164,9 +1135,8 @@ export class Simplifier {
|
|
|
1164
1135
|
}
|
|
1165
1136
|
}
|
|
1166
1137
|
for (const second of this.bsClauses) {
|
|
1167
|
-
if (arena.isLearned(first) && !arena.isLearned(second))
|
|
1138
|
+
if (arena.isLearned(first) && !arena.isLearned(second)) arena.setLearned(first, false);
|
|
1168
1139
|
this.removeClause(second);
|
|
1169
|
-
this.numSubsumed++;
|
|
1170
1140
|
}
|
|
1171
1141
|
}
|
|
1172
1142
|
|
|
@@ -1217,7 +1187,7 @@ export class Simplifier {
|
|
|
1217
1187
|
const oldTrailSize = solver.trail.length;
|
|
1218
1188
|
const numClauses = solver.clauses.length;
|
|
1219
1189
|
solver.assignScoped(lit);
|
|
1220
|
-
solver.
|
|
1190
|
+
solver.propagate(false);
|
|
1221
1191
|
if (solver.isInconsistent) return;
|
|
1222
1192
|
const newTrailSize = solver.trail.length;
|
|
1223
1193
|
for (let index = oldTrailSize; index < newTrailSize; index++) {
|
|
@@ -1236,7 +1206,6 @@ export class Simplifier {
|
|
|
1236
1206
|
const solver = this.solver;
|
|
1237
1207
|
const arena = solver.arena;
|
|
1238
1208
|
this.isNeedingCleanup = true;
|
|
1239
|
-
this.numElimLits++;
|
|
1240
1209
|
this.insertElimTodo(lit >> 1);
|
|
1241
1210
|
arena.elim(clause, lit);
|
|
1242
1211
|
this.useList.eraseNotRemoved(lit, clause);
|
|
@@ -1298,11 +1267,10 @@ export class Simplifier {
|
|
|
1298
1267
|
|
|
1299
1268
|
private elimDupBins() {
|
|
1300
1269
|
const solver = this.solver;
|
|
1301
|
-
let numElim = 0;
|
|
1302
1270
|
for (const wlist of solver.watches) {
|
|
1303
1271
|
solver.checkpoint();
|
|
1304
1272
|
const size = wlist.size;
|
|
1305
|
-
const order = Array.from({ length: size }, (
|
|
1273
|
+
const order = Array.from({ length: size }, (_value, index) => index);
|
|
1306
1274
|
const getRank = (index: number) =>
|
|
1307
1275
|
wlist.isBinary(index)
|
|
1308
1276
|
? 2 * wlist.getLiteral(index) + (wlist.isLearned(index) ? 1 : 0)
|
|
@@ -1315,10 +1283,7 @@ export class Simplifier {
|
|
|
1315
1283
|
const val1 = data[2 * index];
|
|
1316
1284
|
const val2 = data[2 * index + 1];
|
|
1317
1285
|
if ((val2 & 3) === 0) {
|
|
1318
|
-
if (val1 === lastLit)
|
|
1319
|
-
numElim++;
|
|
1320
|
-
continue;
|
|
1321
|
-
}
|
|
1286
|
+
if (val1 === lastLit) continue;
|
|
1322
1287
|
lastLit = val1;
|
|
1323
1288
|
}
|
|
1324
1289
|
wlist.data[2 * next] = val1;
|
|
@@ -1327,7 +1292,6 @@ export class Simplifier {
|
|
|
1327
1292
|
}
|
|
1328
1293
|
wlist.setEnd(next);
|
|
1329
1294
|
}
|
|
1330
|
-
this.numSubsumed += Math.trunc(numElim / 2);
|
|
1331
1295
|
}
|
|
1332
1296
|
|
|
1333
1297
|
private subsume() {
|
|
@@ -1390,14 +1354,6 @@ export class Simplifier {
|
|
|
1390
1354
|
}
|
|
1391
1355
|
}
|
|
1392
1356
|
|
|
1393
|
-
private numNonlearnedBin(lit: number) {
|
|
1394
|
-
const wlist = this.solver.watches[lit ^ 1];
|
|
1395
|
-
let count = 0;
|
|
1396
|
-
for (let index = 0; index < wlist.size; index++)
|
|
1397
|
-
if (wlist.isBinary(index) && !wlist.isLearned(index)) count++;
|
|
1398
|
-
return count;
|
|
1399
|
-
}
|
|
1400
|
-
|
|
1401
1357
|
private orderVarsForElim() {
|
|
1402
1358
|
const solver = this.solver;
|
|
1403
1359
|
const sizes = this.useList.size;
|
|
@@ -1409,8 +1365,8 @@ export class Simplifier {
|
|
|
1409
1365
|
if (solver.valueVar(boolVar) !== L_UNDEF) continue;
|
|
1410
1366
|
const numPos = sizes[2 * boolVar];
|
|
1411
1367
|
const numNeg = sizes[2 * boolVar + 1];
|
|
1412
|
-
const numBinPos =
|
|
1413
|
-
const numBinNeg =
|
|
1368
|
+
const numBinPos = solver.watches[2 * boolVar + 1].numNonlearnedBin();
|
|
1369
|
+
const numBinNeg = solver.watches[2 * boolVar].numNonlearnedBin();
|
|
1414
1370
|
costs[boolVar] =
|
|
1415
1371
|
(Math.imul(2 * numPos, numNeg) +
|
|
1416
1372
|
Math.imul(numPos, numBinNeg) +
|
|
@@ -1536,8 +1492,8 @@ export class Simplifier {
|
|
|
1536
1492
|
if (solver.valueVar(boolVar) !== L_UNDEF) return false;
|
|
1537
1493
|
const posLit = 2 * boolVar;
|
|
1538
1494
|
const negLit = 2 * boolVar + 1;
|
|
1539
|
-
const numBinPos =
|
|
1540
|
-
const numBinNeg =
|
|
1495
|
+
const numBinPos = solver.watches[negLit].numNonlearnedBin();
|
|
1496
|
+
const numBinNeg = solver.watches[posLit].numNonlearnedBin();
|
|
1541
1497
|
const numPos = this.useList.numIrredundant(posLit) + numBinPos;
|
|
1542
1498
|
const numNeg = this.useList.numIrredundant(negLit) + numBinNeg;
|
|
1543
1499
|
if (numPos >= this.resOccCutoff && numNeg >= this.resOccCutoff) return false;
|
|
@@ -1,12 +1,10 @@
|
|
|
1
|
-
// Ported from Z3 (src/sat/sat_solver.h, src/sat/sat_solver.cpp, src/sat/sat_gc.cpp,
|
|
2
|
-
// src/sat/sat_justification.h, src/util/ema.h), MIT license, see z3-license.txt.
|
|
3
1
|
import { SmtCanceledError } from "../../../../errors";
|
|
4
2
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
5
3
|
import { RandomGen } from "../random-gen";
|
|
6
4
|
import type { ResourceLimit } from "../rlimit";
|
|
7
5
|
import { AsymmBranch } from "./asymm-branch";
|
|
8
6
|
import { Cleaner } from "./cleaner";
|
|
9
|
-
import { ClauseArena, NULL_LITERAL } from "./clause";
|
|
7
|
+
import { ClauseArena, NULL_LITERAL, UINT_MAX } from "./clause";
|
|
10
8
|
import {
|
|
11
9
|
GC_DYN_PSM,
|
|
12
10
|
GC_GLUE,
|
|
@@ -68,15 +66,15 @@ export interface SatExtension {
|
|
|
68
66
|
flushRoots(): void;
|
|
69
67
|
initUseList(useVars: Set<number>): void;
|
|
70
68
|
findMutexes(lits: number[], mutexes: number[][]): void;
|
|
69
|
+
toFormulas(lit2expr: (lit: number) => number, formulas: number[]): void;
|
|
71
70
|
}
|
|
72
71
|
|
|
73
|
-
const UINT_MAX = 4294967295;
|
|
74
72
|
const RANDOM_MAX_VALUE = 0x7fff;
|
|
75
73
|
|
|
76
74
|
const S_SAT = 0;
|
|
77
75
|
const S_UNSAT = 1;
|
|
78
76
|
|
|
79
|
-
|
|
77
|
+
class Ema {
|
|
80
78
|
private beta = 1;
|
|
81
79
|
value = 0;
|
|
82
80
|
private period = 0;
|
|
@@ -124,7 +122,7 @@ const sortClauses = (clauses: number[], isLess: (first: number, second: number)
|
|
|
124
122
|
|
|
125
123
|
export class Solver {
|
|
126
124
|
config: SatConfig;
|
|
127
|
-
rand
|
|
125
|
+
rand: RandomGen;
|
|
128
126
|
arena = new ClauseArena();
|
|
129
127
|
cleaner: Cleaner;
|
|
130
128
|
mc = new ModelConverter();
|
|
@@ -141,7 +139,6 @@ export class Solver {
|
|
|
141
139
|
model = new Int8Array(0);
|
|
142
140
|
isModelCurrent = false;
|
|
143
141
|
isInconsistent = false;
|
|
144
|
-
isSearching = false;
|
|
145
142
|
conflictJustLevel = 0;
|
|
146
143
|
conflictLevel = 0;
|
|
147
144
|
conflictVal = 0;
|
|
@@ -149,14 +146,12 @@ export class Solver {
|
|
|
149
146
|
notL = NULL_LITERAL;
|
|
150
147
|
clauses: number[] = [];
|
|
151
148
|
learned: number[] = [];
|
|
152
|
-
numFrozen = 0;
|
|
153
149
|
watches: WatchList[] = [];
|
|
154
150
|
assignment = new Int8Array(16);
|
|
155
151
|
justLevel = new Uint32Array(8);
|
|
156
152
|
private varCount = 0;
|
|
157
153
|
justVal: number[] = [];
|
|
158
154
|
justKind: number[] = [];
|
|
159
|
-
decision: boolean[] = [];
|
|
160
155
|
mark: boolean[] = [];
|
|
161
156
|
litMark: boolean[] = [];
|
|
162
157
|
eliminated: boolean[] = [];
|
|
@@ -199,7 +194,6 @@ export class Solver {
|
|
|
199
194
|
scopes: Scope[] = [];
|
|
200
195
|
core: number[] = [];
|
|
201
196
|
conflicts = 0;
|
|
202
|
-
decisions = 0;
|
|
203
197
|
conflictsSinceInit = 0;
|
|
204
198
|
restarts = 0;
|
|
205
199
|
conflictsSinceRestart = 0;
|
|
@@ -216,7 +210,7 @@ export class Solver {
|
|
|
216
210
|
isSimplifyEnabled = true;
|
|
217
211
|
isRestartEnabled = true;
|
|
218
212
|
lemma: number[] = [];
|
|
219
|
-
private incremental
|
|
213
|
+
private incremental: boolean;
|
|
220
214
|
private assumptions: number[] = [];
|
|
221
215
|
private assumptionSet = new Set<number>();
|
|
222
216
|
readonly userScopeLiterals: number[] = [];
|
|
@@ -240,7 +234,7 @@ export class Solver {
|
|
|
240
234
|
this.asymmBranch = new AsymmBranch(this, params);
|
|
241
235
|
this.probing = new Probing(this, params);
|
|
242
236
|
this.updateParams();
|
|
243
|
-
this.mkVar(false
|
|
237
|
+
this.mkVar(false);
|
|
244
238
|
}
|
|
245
239
|
|
|
246
240
|
private updateParams() {
|
|
@@ -333,7 +327,7 @@ export class Solver {
|
|
|
333
327
|
}
|
|
334
328
|
}
|
|
335
329
|
|
|
336
|
-
mkVar(isExternal: boolean
|
|
330
|
+
mkVar(isExternal: boolean) {
|
|
337
331
|
this.isModelCurrent = false;
|
|
338
332
|
const boolVar = this.varCount++;
|
|
339
333
|
this.activeVars.push(boolVar);
|
|
@@ -349,7 +343,6 @@ export class Solver {
|
|
|
349
343
|
this.justLevel[boolVar] = UINT_MAX;
|
|
350
344
|
this.justVal.push(0);
|
|
351
345
|
this.justKind.push(JUSTIFICATION_NONE);
|
|
352
|
-
this.decision.push(isDecision);
|
|
353
346
|
this.eliminated.push(false);
|
|
354
347
|
this.external.push(isExternal);
|
|
355
348
|
this.varScope.push(this.scopeLvl);
|
|
@@ -396,15 +389,11 @@ export class Solver {
|
|
|
396
389
|
}
|
|
397
390
|
|
|
398
391
|
delClause(clause: number) {
|
|
399
|
-
if (this.arena.isFrozen(clause)) this.numFrozen--;
|
|
400
392
|
this.arena.delClause(clause);
|
|
401
393
|
}
|
|
402
394
|
|
|
403
395
|
mkClauseCore(lits: number[], isRedundant: boolean, isTheory = false): number {
|
|
404
|
-
if (!isRedundant || isTheory)
|
|
405
|
-
if (!this.simplifyClause(lits)) return -1;
|
|
406
|
-
if (!this.isSearching) this.mc.addClause(lits);
|
|
407
|
-
}
|
|
396
|
+
if ((!isRedundant || isTheory) && !this.simplifyClause(lits)) return -1;
|
|
408
397
|
switch (lits.length) {
|
|
409
398
|
case 0:
|
|
410
399
|
this.setConflict();
|
|
@@ -722,7 +711,7 @@ export class Solver {
|
|
|
722
711
|
this.trail.push(lit);
|
|
723
712
|
}
|
|
724
713
|
|
|
725
|
-
|
|
714
|
+
propagate(isUpdating: boolean) {
|
|
726
715
|
if (this.isExtPropagating()) this.ext?.unitPropagate?.();
|
|
727
716
|
while (this.qhead < this.trail.length && !this.isInconsistent) {
|
|
728
717
|
do {
|
|
@@ -737,10 +726,6 @@ export class Solver {
|
|
|
737
726
|
return !this.isInconsistent;
|
|
738
727
|
}
|
|
739
728
|
|
|
740
|
-
propagate(isUpdating: boolean) {
|
|
741
|
-
return this.propagateCore(isUpdating);
|
|
742
|
-
}
|
|
743
|
-
|
|
744
729
|
private propagateClause(clause: number, isUpdating: boolean, assignLevel: number, first: number) {
|
|
745
730
|
const arena = this.arena;
|
|
746
731
|
arena.markUsed(clause);
|
|
@@ -890,38 +875,33 @@ export class Solver {
|
|
|
890
875
|
check(assumptions: readonly number[] = []) {
|
|
891
876
|
this.reasonUnknown = "no reason given";
|
|
892
877
|
this.popToBaseLevel();
|
|
893
|
-
this.isSearching = true;
|
|
894
878
|
this.isGivenUp = false;
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
879
|
+
this.initSearch();
|
|
880
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
881
|
+
this.propagate(false);
|
|
882
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
883
|
+
this.initAssumptions(assumptions);
|
|
884
|
+
this.propagate(false);
|
|
885
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
886
|
+
if (this.config.isForcingCleanup) this.doCleanup(true);
|
|
887
|
+
if (this.config.isGcBurst) {
|
|
888
|
+
this.conflictsSinceGc = this.gcThreshold + 1;
|
|
889
|
+
this.doGc();
|
|
890
|
+
}
|
|
891
|
+
if (this.config.isEnablingPreSimplify) {
|
|
892
|
+
this.doSimplify();
|
|
902
893
|
if (this.checkInconsistent()) return L_FALSE;
|
|
903
|
-
if (this.config.isForcingCleanup) this.doCleanup(true);
|
|
904
|
-
if (this.config.isGcBurst) {
|
|
905
|
-
this.conflictsSinceGc = this.gcThreshold + 1;
|
|
906
|
-
this.doGc();
|
|
907
|
-
}
|
|
908
|
-
if (this.config.isEnablingPreSimplify) {
|
|
909
|
-
this.doSimplify();
|
|
910
|
-
if (this.checkInconsistent()) return L_FALSE;
|
|
911
|
-
}
|
|
912
|
-
if (this.config.maxConflicts === 0) return L_UNDEF;
|
|
913
|
-
if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
|
|
914
|
-
this.restartThreshold = this.config.burstSearch;
|
|
915
|
-
const result = this.boundedSearch();
|
|
916
|
-
if (result !== L_UNDEF || this.isGivenUp) return result;
|
|
917
|
-
this.popReinit(this.scopeLvl);
|
|
918
|
-
this.conflictsSinceRestart = 0;
|
|
919
|
-
this.restartThreshold = this.config.restartInitial;
|
|
920
|
-
}
|
|
921
|
-
return this.basicSearch();
|
|
922
|
-
} finally {
|
|
923
|
-
this.isSearching = false;
|
|
924
894
|
}
|
|
895
|
+
if (this.config.maxConflicts === 0) return L_UNDEF;
|
|
896
|
+
if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
|
|
897
|
+
this.restartThreshold = this.config.burstSearch;
|
|
898
|
+
const result = this.boundedSearch();
|
|
899
|
+
if (result !== L_UNDEF || this.isGivenUp) return result;
|
|
900
|
+
this.popReinit(this.scopeLvl);
|
|
901
|
+
this.conflictsSinceRestart = 0;
|
|
902
|
+
this.restartThreshold = this.config.restartInitial;
|
|
903
|
+
}
|
|
904
|
+
return this.basicSearch();
|
|
925
905
|
}
|
|
926
906
|
|
|
927
907
|
checkInconsistent() {
|
|
@@ -1082,6 +1062,14 @@ export class Solver {
|
|
|
1082
1062
|
this.reasonUnknown = "sat.canceled";
|
|
1083
1063
|
return true;
|
|
1084
1064
|
}
|
|
1065
|
+
if (this.config.restartMax <= this.restarts) {
|
|
1066
|
+
this.reasonUnknown = "sat.max.restarts";
|
|
1067
|
+
return true;
|
|
1068
|
+
}
|
|
1069
|
+
if (this.config.inprocessMax <= this.simplifications) {
|
|
1070
|
+
this.reasonUnknown = "sat.max.inprocess";
|
|
1071
|
+
return true;
|
|
1072
|
+
}
|
|
1085
1073
|
return this.reachedMaxConflicts();
|
|
1086
1074
|
}
|
|
1087
1075
|
|
|
@@ -1129,7 +1117,6 @@ export class Solver {
|
|
|
1129
1117
|
const next = this.nextVar();
|
|
1130
1118
|
if (next === -1) return false;
|
|
1131
1119
|
this.push();
|
|
1132
|
-
this.decisions++;
|
|
1133
1120
|
this.assignScoped(2 * next + (this.guess(next) ? 0 : 1));
|
|
1134
1121
|
return true;
|
|
1135
1122
|
}
|
|
@@ -1831,7 +1818,7 @@ export class Solver {
|
|
|
1831
1818
|
// variables, the scope variable is the last one.
|
|
1832
1819
|
userPush() {
|
|
1833
1820
|
this.popToBaseLevel();
|
|
1834
|
-
this.userScopeLiterals.push(2 * this.mkVar(true
|
|
1821
|
+
this.userScopeLiterals.push(2 * this.mkVar(true));
|
|
1835
1822
|
this.ext?.userPush?.();
|
|
1836
1823
|
}
|
|
1837
1824
|
|
|
@@ -1844,7 +1831,10 @@ export class Solver {
|
|
|
1844
1831
|
this.ext?.userPop?.(numScopes);
|
|
1845
1832
|
this.gcVars(maxVar);
|
|
1846
1833
|
this.qhead = 0;
|
|
1834
|
+
const wasSuspended = this.limit.isSuspended;
|
|
1835
|
+
this.limit.isSuspended = true;
|
|
1847
1836
|
this.propagate(false);
|
|
1837
|
+
this.limit.isSuspended = wasSuspended;
|
|
1848
1838
|
}
|
|
1849
1839
|
|
|
1850
1840
|
// gc_vars: drop the variables from maxVar on, with their watches and clauses.
|
|
@@ -1903,7 +1893,6 @@ export class Solver {
|
|
|
1903
1893
|
for (const values of [
|
|
1904
1894
|
this.justVal,
|
|
1905
1895
|
this.justKind,
|
|
1906
|
-
this.decision,
|
|
1907
1896
|
this.eliminated,
|
|
1908
1897
|
this.external,
|
|
1909
1898
|
this.varScope,
|
|
@@ -1933,16 +1922,6 @@ export class Solver {
|
|
|
1933
1922
|
this.activityInc >>>= 14;
|
|
1934
1923
|
}
|
|
1935
1924
|
|
|
1936
|
-
numClauses() {
|
|
1937
|
-
let numClauses = this.trail.length;
|
|
1938
|
-
for (let lit = 0; lit < this.watches.length; lit++) {
|
|
1939
|
-
const wlist = this.watches[lit];
|
|
1940
|
-
for (let index = 0; index < wlist.size; index++)
|
|
1941
|
-
if (wlist.isBinary(index) && (lit ^ 1) < wlist.getLiteral(index)) numClauses++;
|
|
1942
|
-
}
|
|
1943
|
-
return numClauses + this.clauses.length + this.learned.length;
|
|
1944
|
-
}
|
|
1945
|
-
|
|
1946
1925
|
doCleanup(isForced: boolean) {
|
|
1947
1926
|
if (this.conflictsSinceInit === 0 && !isForced) return false;
|
|
1948
1927
|
return this.atBaseLvl() && !this.isInconsistent && this.cleaner.run(isForced);
|
|
@@ -2064,12 +2043,10 @@ export class Solver {
|
|
|
2064
2043
|
this.detachClause(clause);
|
|
2065
2044
|
arena.inactRounds[clause] = 0;
|
|
2066
2045
|
arena.setFrozen(clause, true);
|
|
2067
|
-
this.numFrozen++;
|
|
2068
2046
|
}
|
|
2069
2047
|
}
|
|
2070
2048
|
} else if (this.psm(clause) <= Math.trunc(arena.size[clause] * this.minDTk)) {
|
|
2071
2049
|
arena.setFrozen(clause, false);
|
|
2072
|
-
this.numFrozen--;
|
|
2073
2050
|
if (!this.activateFrozenClause(clause)) {
|
|
2074
2051
|
this.delClause(clause);
|
|
2075
2052
|
continue;
|
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/sat/sat_watched.h, src/sat/sat_watched.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
|
-
|
|
4
1
|
export const WATCH_BINARY = 0;
|
|
5
2
|
export const WATCH_CLAUSE = 1;
|
|
6
3
|
export const WATCH_EXT_CONSTRAINT = 2;
|
|
@@ -66,6 +63,13 @@ export class WatchList {
|
|
|
66
63
|
: this.data[2 * index + 1] & ~4;
|
|
67
64
|
}
|
|
68
65
|
|
|
66
|
+
numNonlearnedBin() {
|
|
67
|
+
let count = 0;
|
|
68
|
+
for (let index = 0; index < this.size; index++)
|
|
69
|
+
if (this.isBinary(index) && !this.isLearned(index)) count++;
|
|
70
|
+
return count;
|
|
71
|
+
}
|
|
72
|
+
|
|
69
73
|
getClause(index: number) {
|
|
70
74
|
return this.data[2 * index];
|
|
71
75
|
}
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_axioms.cpp, src/smt/seq_axioms.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
import { SmtUnsupportedError } from "../../../errors";
|
|
3
1
|
import {
|
|
4
2
|
type AstManager,
|
|
5
3
|
FAMILY_ARITH,
|
|
@@ -25,7 +23,6 @@ import {
|
|
|
25
23
|
OP_SEQ_PREFIX,
|
|
26
24
|
OP_SEQ_UNIT,
|
|
27
25
|
OP_STRING_FROM_CODE,
|
|
28
|
-
OP_STRING_ITOS,
|
|
29
26
|
OP_STRING_LT,
|
|
30
27
|
OP_STRING_STOI,
|
|
31
28
|
OP_STRING_TO_CODE,
|
|
@@ -37,7 +34,7 @@ import { FALSE_LITERAL, type Literal, TRUE_LITERAL, negate } from "./literal";
|
|
|
37
34
|
import { isBinaryApp, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
|
|
38
35
|
import { SeqSkolem } from "./seq-skolem";
|
|
39
36
|
|
|
40
|
-
|
|
37
|
+
interface SeqAxiomsHost {
|
|
41
38
|
rewrite(expr: number): number;
|
|
42
39
|
mkEqLiteral(first: number, second: number): Literal;
|
|
43
40
|
ensureEnode(expr: number): void;
|
|
@@ -63,7 +60,7 @@ export const getMinLengthOf = (manager: AstManager, seq: number): number => {
|
|
|
63
60
|
|
|
64
61
|
const UINT_MAX = 0xffffffff;
|
|
65
62
|
|
|
66
|
-
|
|
63
|
+
const getMaxLengthOf = (manager: AstManager, seq: number): number => {
|
|
67
64
|
const getLength = (expr: number) => {
|
|
68
65
|
if (isEmptySeq(manager, expr)) return 0;
|
|
69
66
|
const op = manager.getOp(expr);
|
|
@@ -181,13 +178,8 @@ export class SeqAxioms {
|
|
|
181
178
|
return result;
|
|
182
179
|
}
|
|
183
180
|
|
|
184
|
-
|
|
185
|
-
return this.host.rewrite(this.mkSeq(OP_SEQ_LENGTH, [seq]));
|
|
186
|
-
}
|
|
187
|
-
|
|
188
|
-
private purify(expr: number | undefined) {
|
|
181
|
+
private purify(expr: number) {
|
|
189
182
|
const manager = this.manager;
|
|
190
|
-
if (expr === undefined) return undefined;
|
|
191
183
|
if (manager.depths[expr] === 1 || manager.isValue(expr)) return expr;
|
|
192
184
|
if (this.host.rewrite(expr) === expr) return expr;
|
|
193
185
|
let result = this.purified.get(expr);
|
|
@@ -257,9 +249,9 @@ export class SeqAxioms {
|
|
|
257
249
|
extractAxiom(expr: number) {
|
|
258
250
|
const manager = this.manager;
|
|
259
251
|
const [seqArg, indexArg, lengthArg] = manager.getArgs(expr);
|
|
260
|
-
const seq = this.purify(seqArg)
|
|
261
|
-
const index = this.purify(indexArg)
|
|
262
|
-
const length = this.purify(lengthArg)
|
|
252
|
+
const seq = this.purify(seqArg);
|
|
253
|
+
const index = this.purify(indexArg);
|
|
254
|
+
const length = this.purify(lengthArg);
|
|
263
255
|
if (this.smallSegmentAxiom(expr, seqArg, indexArg, lengthArg)) return;
|
|
264
256
|
if (this.isTail(seq, indexArg, lengthArg)) {
|
|
265
257
|
this.tailAxiom(expr, seq);
|
|
@@ -437,9 +429,9 @@ export class SeqAxioms {
|
|
|
437
429
|
const args = manager.getArgs(index);
|
|
438
430
|
const minusOne = this.mkInt(-1);
|
|
439
431
|
const zero = this.mkInt(0);
|
|
440
|
-
const offset = this.purify(args[2]);
|
|
441
|
-
const pattern = this.purify(args[1])
|
|
442
|
-
const text = this.purify(args[0])
|
|
432
|
+
const offset = args.length > 2 ? this.purify(args[2]) : undefined;
|
|
433
|
+
const pattern = this.purify(args[1]);
|
|
434
|
+
const text = this.purify(args[0]);
|
|
443
435
|
const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
|
|
444
436
|
const isMinusOne = this.mkEq(index, minusOne);
|
|
445
437
|
const isZero = this.mkEq(index, zero);
|
|
@@ -512,8 +504,8 @@ export class SeqAxioms {
|
|
|
512
504
|
lastIndexofAxiom(index: number) {
|
|
513
505
|
const manager = this.manager;
|
|
514
506
|
const [textArg, patternArg] = manager.getArgs(index);
|
|
515
|
-
const text = this.purify(textArg)
|
|
516
|
-
const pattern = this.purify(patternArg)
|
|
507
|
+
const text = this.purify(textArg);
|
|
508
|
+
const pattern = this.purify(patternArg);
|
|
517
509
|
const minusOne = this.mkInt(-1);
|
|
518
510
|
const zero = this.mkInt(0);
|
|
519
511
|
const skolem = this.skolem;
|
|
@@ -540,9 +532,9 @@ export class SeqAxioms {
|
|
|
540
532
|
replaceAxiom(replace: number) {
|
|
541
533
|
const manager = this.manager;
|
|
542
534
|
const [source, patternArg, targetArg] = manager.getArgs(replace);
|
|
543
|
-
const text = this.purify(source)
|
|
544
|
-
const pattern = this.purify(patternArg)
|
|
545
|
-
const target = this.purify(targetArg)
|
|
535
|
+
const text = this.purify(source);
|
|
536
|
+
const pattern = this.purify(patternArg);
|
|
537
|
+
const target = this.purify(targetArg);
|
|
546
538
|
const skolem = this.skolem;
|
|
547
539
|
const left = skolem.mkIndexofLeft(text, pattern);
|
|
548
540
|
const right = skolem.mkIndexofRight(text, pattern);
|
|
@@ -566,8 +558,8 @@ export class SeqAxioms {
|
|
|
566
558
|
atAxiom(expr: number) {
|
|
567
559
|
const manager = this.manager;
|
|
568
560
|
const [seqArg, indexArg] = manager.getArgs(expr);
|
|
569
|
-
const seq = this.purify(seqArg)
|
|
570
|
-
const index = this.purify(indexArg)
|
|
561
|
+
const seq = this.purify(seqArg);
|
|
562
|
+
const index = this.purify(indexArg);
|
|
571
563
|
this.mkInt(0);
|
|
572
564
|
const one = this.mkInt(1);
|
|
573
565
|
const empty = this.mkEmpty(manager.sorts[expr]);
|
|
@@ -748,8 +740,8 @@ export class SeqAxioms {
|
|
|
748
740
|
ltAxiom(expr: number) {
|
|
749
741
|
const manager = this.manager;
|
|
750
742
|
const [firstArg, secondArg] = manager.getArgs(expr);
|
|
751
|
-
const first = this.purify(firstArg)
|
|
752
|
-
const second = this.purify(secondArg)
|
|
743
|
+
const first = this.purify(firstArg);
|
|
744
|
+
const second = this.purify(secondArg);
|
|
753
745
|
const charSort = manager.getSeqElementSort(manager.sorts[first]);
|
|
754
746
|
const lt = expr;
|
|
755
747
|
const gt = this.mkSeq(OP_STRING_LT, [second, first]);
|
|
@@ -896,8 +888,8 @@ export class SeqAxioms {
|
|
|
896
888
|
private affixAxiom(expr: number, name: string, isPrefix: boolean) {
|
|
897
889
|
const manager = this.manager;
|
|
898
890
|
const [firstArg, secondArg] = manager.getArgs(expr);
|
|
899
|
-
const first = this.purify(firstArg)
|
|
900
|
-
const second = this.purify(secondArg)
|
|
891
|
+
const first = this.purify(firstArg);
|
|
892
|
+
const second = this.purify(secondArg);
|
|
901
893
|
const firstLength = this.mkLenAxiom(first);
|
|
902
894
|
const secondLength = this.mkLenAxiom(second);
|
|
903
895
|
const isLonger = this.mkGe(this.mkSub(firstLength, secondLength), 1);
|
|
@@ -1000,12 +992,4 @@ export class SeqAxioms {
|
|
|
1000
992
|
this.addClause([this.mkNot(tracker), this.mkLe(this.mkLenAxiom(target), limit)]);
|
|
1001
993
|
return tracker;
|
|
1002
994
|
}
|
|
1003
|
-
|
|
1004
|
-
ubvAxiom(): never {
|
|
1005
|
-
throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
|
|
1006
|
-
}
|
|
1007
|
-
|
|
1008
|
-
isItos(expr: number) {
|
|
1009
|
-
return this.manager.getOp(expr) === OP_STRING_ITOS;
|
|
1010
|
-
}
|
|
1011
995
|
}
|