tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- 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 +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- 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 +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- 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 +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- 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 +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +111 -39
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- 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 +30 -11
- 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 +1 -10
- 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 +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- 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 +68 -17
- 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 +167 -85
- 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 +220 -0
- 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 +324 -0
- 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 +163 -99
- 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 +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- 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 +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,734 @@
|
|
|
1
|
+
import { SmtCanceledError, SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
OP_ADD,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_EQ,
|
|
9
|
+
OP_IMPLIES,
|
|
10
|
+
OP_OR,
|
|
11
|
+
OP_UBV2INT,
|
|
12
|
+
OP_ULEQ,
|
|
13
|
+
SORT_BOOL,
|
|
14
|
+
SORT_INT,
|
|
15
|
+
} from "./ast";
|
|
16
|
+
import { mkNot } from "./ast-util";
|
|
17
|
+
import { BoundManager } from "./bound-manager";
|
|
18
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
19
|
+
import { Bv2IntContext, Bv2IntRewriter } from "./bv2int-rewriter";
|
|
20
|
+
import { createCard2Bv } from "./card2bv";
|
|
21
|
+
import { DependentExprState } from "./dependent-expr-state";
|
|
22
|
+
import { Enum2BvRewriter } from "./dt2bv-tactic";
|
|
23
|
+
import { assignOwned, release } from "./expr-ref";
|
|
24
|
+
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
25
|
+
import {
|
|
26
|
+
type Definition,
|
|
27
|
+
type Dependency,
|
|
28
|
+
getDependencyValues,
|
|
29
|
+
Goal,
|
|
30
|
+
mkDependencyLeaf,
|
|
31
|
+
} from "./goal";
|
|
32
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
33
|
+
import type { ProtoModel } from "./proto-model";
|
|
34
|
+
import type { Rational } from "./rational";
|
|
35
|
+
import { RefVector } from "./ref-vector";
|
|
36
|
+
import { Rewriter } from "./rewriter";
|
|
37
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
38
|
+
import { applyDefinitions, getRewriterOptions } from "./tactic";
|
|
39
|
+
import { UINT_MAX } from "./sat/clause";
|
|
40
|
+
import type { SatParams } from "./sat/config";
|
|
41
|
+
import { IncSatSolver } from "./sat/inc-sat-solver";
|
|
42
|
+
|
|
43
|
+
const getNumBits = (value: bigint) => {
|
|
44
|
+
let bound = 1n;
|
|
45
|
+
let numBits = 1;
|
|
46
|
+
while (bound <= value) {
|
|
47
|
+
numBits++;
|
|
48
|
+
bound *= 2n;
|
|
49
|
+
}
|
|
50
|
+
return numBits;
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
const collectBounds = (manager: AstManager, bounds: BoundManager, form: number) => {
|
|
54
|
+
if (manager.getOp(form) !== OP_AND) {
|
|
55
|
+
bounds.add(form);
|
|
56
|
+
return;
|
|
57
|
+
}
|
|
58
|
+
for (const arg of manager.getArgs(form)) collectBounds(manager, bounds, arg);
|
|
59
|
+
};
|
|
60
|
+
|
|
61
|
+
class SolverFormulas extends Goal {
|
|
62
|
+
override assert(form: number, dependency?: Dependency) {
|
|
63
|
+
if (this.manager.isFalse(form)) this.isInconsistent = true;
|
|
64
|
+
this.forms.push(form);
|
|
65
|
+
this.dependencies.push(dependency);
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
override update(index: number, form: number, dependency?: Dependency) {
|
|
69
|
+
if (this.manager.isFalse(form)) this.isInconsistent = true;
|
|
70
|
+
this.forms.set(index, form);
|
|
71
|
+
this.dependencies[index] = dependency;
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
flattenSuffix(qhead: number) {
|
|
75
|
+
const manager = this.manager;
|
|
76
|
+
const forms = this.forms;
|
|
77
|
+
const seen = new Set<number>();
|
|
78
|
+
const pinned = new RefVector(manager);
|
|
79
|
+
let kept = qhead;
|
|
80
|
+
for (let index = qhead; index < forms.size; index++) {
|
|
81
|
+
const form = forms.items[index];
|
|
82
|
+
const dependency = this.dependencies[index];
|
|
83
|
+
pinned.push(form);
|
|
84
|
+
if (seen.has(form)) continue;
|
|
85
|
+
seen.add(form);
|
|
86
|
+
if (manager.isTrue(form)) continue;
|
|
87
|
+
if (manager.getOp(form) === OP_AND) {
|
|
88
|
+
const numArgs = manager.getNumArgs(form);
|
|
89
|
+
for (let argIndex = 0; argIndex < numArgs; argIndex++)
|
|
90
|
+
this.assert(manager.getArg(form, argIndex), dependency);
|
|
91
|
+
continue;
|
|
92
|
+
}
|
|
93
|
+
if (manager.isNot(form) && manager.getOp(manager.getArg(form, 0)) === OP_OR) {
|
|
94
|
+
const disjunction = manager.getArg(form, 0);
|
|
95
|
+
const numArgs = manager.getNumArgs(disjunction);
|
|
96
|
+
for (let argIndex = 0; argIndex < numArgs; argIndex++)
|
|
97
|
+
this.assert(mkNot(manager, manager.getArg(disjunction, argIndex)), dependency);
|
|
98
|
+
continue;
|
|
99
|
+
}
|
|
100
|
+
if (index !== kept) {
|
|
101
|
+
forms.set(kept, form);
|
|
102
|
+
this.dependencies[kept] = dependency;
|
|
103
|
+
}
|
|
104
|
+
kept++;
|
|
105
|
+
}
|
|
106
|
+
this.shrinkTo(kept);
|
|
107
|
+
pinned.reset();
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
shrinkTo(size: number) {
|
|
111
|
+
this.forms.shrink(size);
|
|
112
|
+
this.dependencies.length = size;
|
|
113
|
+
}
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
// Z3's dep_expr_state reads the formulas in place, without holding one.
|
|
117
|
+
class FdState extends DependentExprState {
|
|
118
|
+
declare readonly goal: SolverFormulas;
|
|
119
|
+
|
|
120
|
+
override get(index: number) {
|
|
121
|
+
return this.goal.forms.items[index];
|
|
122
|
+
}
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
class MacroReplacer extends RewriterTpl {
|
|
126
|
+
constructor(
|
|
127
|
+
manager: AstManager,
|
|
128
|
+
private readonly decl: number,
|
|
129
|
+
private readonly def: number,
|
|
130
|
+
) {
|
|
131
|
+
super(manager);
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
override isRewritingPatterns() {
|
|
135
|
+
return false;
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
override getSubst(expr: number) {
|
|
139
|
+
return this.manager.kinds[expr] === KIND_APP && this.manager.decls[expr] === this.decl
|
|
140
|
+
? this.def
|
|
141
|
+
: undefined;
|
|
142
|
+
}
|
|
143
|
+
}
|
|
144
|
+
|
|
145
|
+
const addVars = (manager: AstManager, expr: number, freeVars: Set<number>) => {
|
|
146
|
+
const visited = new Set<number>();
|
|
147
|
+
const todo = [expr];
|
|
148
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
149
|
+
if (visited.has(current)) continue;
|
|
150
|
+
visited.add(current);
|
|
151
|
+
if (manager.kinds[current] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(current).body);
|
|
152
|
+
else if (manager.kinds[current] === KIND_APP) {
|
|
153
|
+
if (manager.isUninterpreted(current)) freeVars.add(manager.decls[current]);
|
|
154
|
+
manager.pushArgs(current, todo);
|
|
155
|
+
}
|
|
156
|
+
}
|
|
157
|
+
};
|
|
158
|
+
|
|
159
|
+
const retainDefinitions = (manager: AstManager, definitions: readonly Definition[]) => {
|
|
160
|
+
for (const definition of definitions) {
|
|
161
|
+
manager.incDeclRef(definition.decl);
|
|
162
|
+
if (definition.def !== -1) manager.incRef(definition.def);
|
|
163
|
+
}
|
|
164
|
+
return [...definitions];
|
|
165
|
+
};
|
|
166
|
+
|
|
167
|
+
const releaseDefinitions = (manager: AstManager, definitions: readonly Definition[]) => {
|
|
168
|
+
for (let index = definitions.length - 1; index >= 0; index--) {
|
|
169
|
+
const definition = definitions[index];
|
|
170
|
+
if (definition.def !== -1) manager.decRef(definition.def);
|
|
171
|
+
manager.decDeclRef(definition.decl);
|
|
172
|
+
}
|
|
173
|
+
};
|
|
174
|
+
|
|
175
|
+
class ModelTrail {
|
|
176
|
+
readonly entries: Definition[] = [];
|
|
177
|
+
|
|
178
|
+
constructor(private readonly manager: AstManager) {}
|
|
179
|
+
|
|
180
|
+
hide(decl: number) {
|
|
181
|
+
this.manager.incDeclRef(decl);
|
|
182
|
+
this.entries.push({ decl, def: -1 });
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
define(decl: number, def: number) {
|
|
186
|
+
this.manager.incDeclRef(decl);
|
|
187
|
+
this.manager.incRef(def);
|
|
188
|
+
this.entries.push({ decl, def });
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
shrink(size: number) {
|
|
192
|
+
releaseDefinitions(this.manager, this.entries.splice(size));
|
|
193
|
+
}
|
|
194
|
+
|
|
195
|
+
replay(qhead: number, assumptions: RefVector, fmls: SolverFormulas) {
|
|
196
|
+
const manager = this.manager;
|
|
197
|
+
if (this.entries.length === 0) return;
|
|
198
|
+
if (qhead === fmls.forms.size && assumptions.size === 0) return;
|
|
199
|
+
const freeVars = new Set<number>();
|
|
200
|
+
for (let index = qhead; index < fmls.forms.size; index++)
|
|
201
|
+
addVars(manager, fmls.forms.items[index], freeVars);
|
|
202
|
+
for (const assumption of assumptions.items) addVars(manager, assumption, freeVars);
|
|
203
|
+
if (!this.entries.some((entry) => entry.def !== -1 && freeVars.has(entry.decl))) return;
|
|
204
|
+
for (const entry of this.entries) {
|
|
205
|
+
if (entry.def === -1 || !freeVars.has(entry.decl)) continue;
|
|
206
|
+
addVars(manager, entry.def, freeVars);
|
|
207
|
+
const replacer = new MacroReplacer(manager, entry.decl, entry.def);
|
|
208
|
+
// Deviation from Z3: macro_replacer returns the rewrite of a named formula's last name, which drops the formula.
|
|
209
|
+
for (let index = qhead; index < fmls.forms.size; index++) {
|
|
210
|
+
const form = fmls.forms.items[index];
|
|
211
|
+
const replaced = replacer.rewrite(form);
|
|
212
|
+
replacer.reset();
|
|
213
|
+
if (replaced !== form) fmls.update(index, replaced, fmls.getDependency(index));
|
|
214
|
+
manager.decRef(replaced);
|
|
215
|
+
}
|
|
216
|
+
for (let index = 0; index < assumptions.size; index++) {
|
|
217
|
+
assumptions.setOwned(index, replacer.rewrite(assumptions.items[index]));
|
|
218
|
+
replacer.reset();
|
|
219
|
+
}
|
|
220
|
+
replacer.release();
|
|
221
|
+
}
|
|
222
|
+
}
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
class BoundedInt2BvSimplifier {
|
|
226
|
+
private readonly bounds: BoundManager[];
|
|
227
|
+
private readonly bvFns: number[] = [];
|
|
228
|
+
private readonly intFns: number[] = [];
|
|
229
|
+
private readonly fnLimits: number[] = [];
|
|
230
|
+
private readonly int2bv = new Map<number, number>();
|
|
231
|
+
private readonly bv2offset = new Map<number, Rational>();
|
|
232
|
+
private readonly context: Bv2IntContext;
|
|
233
|
+
private readonly rewriter: Bv2IntRewriter;
|
|
234
|
+
private readonly sideConditions: RefVector;
|
|
235
|
+
|
|
236
|
+
constructor(private readonly manager: AstManager) {
|
|
237
|
+
this.bounds = [new BoundManager(manager)];
|
|
238
|
+
this.context = new Bv2IntContext(manager, UINT_MAX);
|
|
239
|
+
this.rewriter = new Bv2IntRewriter(manager, this.context);
|
|
240
|
+
this.sideConditions = new RefVector(manager);
|
|
241
|
+
}
|
|
242
|
+
|
|
243
|
+
private accumulateSubstitution(
|
|
244
|
+
substitution: ExprSafeReplace,
|
|
245
|
+
bounds: BoundManager,
|
|
246
|
+
trail: ModelTrail,
|
|
247
|
+
) {
|
|
248
|
+
const manager = this.manager;
|
|
249
|
+
for (const expr of bounds.boundedVars) {
|
|
250
|
+
const lower = bounds.lowers.get(expr);
|
|
251
|
+
const upper = bounds.uppers.get(expr);
|
|
252
|
+
if (
|
|
253
|
+
lower === undefined ||
|
|
254
|
+
upper === undefined ||
|
|
255
|
+
lower.value.compare(upper.value) > 0 ||
|
|
256
|
+
lower.isStrict ||
|
|
257
|
+
upper.isStrict ||
|
|
258
|
+
manager.sorts[expr] !== SORT_INT
|
|
259
|
+
)
|
|
260
|
+
continue;
|
|
261
|
+
const decl = manager.decls[expr];
|
|
262
|
+
const bvDecl =
|
|
263
|
+
this.int2bv.get(decl) ?? this.addBitVector(decl, lower.value, upper.value, trail);
|
|
264
|
+
const offset = this.bv2offset.get(bvDecl) ?? lower.value;
|
|
265
|
+
substitution.insert(expr, this.mkValue(bvDecl, offset));
|
|
266
|
+
}
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
private mkValue(bvDecl: number, offset: Rational) {
|
|
270
|
+
const manager = this.manager;
|
|
271
|
+
const unsigned = mkBvApp(manager, OP_UBV2INT, [
|
|
272
|
+
manager.mkApp(bvDecl, [], manager.funcDecls[bvDecl].range),
|
|
273
|
+
]);
|
|
274
|
+
return offset.isZero()
|
|
275
|
+
? unsigned
|
|
276
|
+
: manager.mkApp(OP_ADD, [unsigned, manager.mkNumeral(offset.num)], SORT_INT);
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
private addBitVector(decl: number, lower: Rational, upper: Rational, trail: ModelTrail) {
|
|
280
|
+
const manager = this.manager;
|
|
281
|
+
const domainSize = upper.sub(lower).num + 1n;
|
|
282
|
+
const numBits = getNumBits(domainSize);
|
|
283
|
+
const bits = manager.mkFreshConst("b", manager.mkBvSort(numBits));
|
|
284
|
+
manager.incRef(bits);
|
|
285
|
+
const bvDecl = manager.decls[bits];
|
|
286
|
+
this.int2bv.set(decl, bvDecl);
|
|
287
|
+
this.bv2offset.set(bvDecl, lower);
|
|
288
|
+
manager.incDeclRef(bvDecl);
|
|
289
|
+
this.bvFns.push(bvDecl);
|
|
290
|
+
manager.incDeclRef(decl);
|
|
291
|
+
this.intFns.push(decl);
|
|
292
|
+
trail.hide(bvDecl);
|
|
293
|
+
trail.define(decl, this.mkValue(bvDecl, lower));
|
|
294
|
+
if (!lower.isZero() && (domainSize & (domainSize - 1n)) !== 0n)
|
|
295
|
+
this.sideConditions.push(
|
|
296
|
+
mkBvApp(manager, OP_ULEQ, [bits, manager.mkBvNumeral(domainSize - 1n, numBits)]),
|
|
297
|
+
);
|
|
298
|
+
manager.decRef(bits);
|
|
299
|
+
return bvDecl;
|
|
300
|
+
}
|
|
301
|
+
|
|
302
|
+
reduce(state: FdState, trail: ModelTrail) {
|
|
303
|
+
const manager = this.manager;
|
|
304
|
+
const fmls = state.goal;
|
|
305
|
+
const bounds = this.bounds[this.bounds.length - 1];
|
|
306
|
+
state.forEachIndex((index) => collectBounds(manager, bounds, fmls.forms.items[index]));
|
|
307
|
+
const substitution = new ExprSafeReplace(manager);
|
|
308
|
+
try {
|
|
309
|
+
for (const scopeBounds of this.bounds)
|
|
310
|
+
this.accumulateSubstitution(substitution, scopeBounds, trail);
|
|
311
|
+
if (substitution.sources.size > 0) {
|
|
312
|
+
let replaced = -1;
|
|
313
|
+
let result = -1;
|
|
314
|
+
try {
|
|
315
|
+
state.forEachIndex((index) => {
|
|
316
|
+
const form = fmls.forms.items[index];
|
|
317
|
+
replaced = assignOwned(manager, replaced, substitution.apply(form));
|
|
318
|
+
result = assignOwned(manager, result, this.rewriter.rewrite(replaced));
|
|
319
|
+
if (result !== form) fmls.update(index, result, fmls.getDependency(index));
|
|
320
|
+
});
|
|
321
|
+
} finally {
|
|
322
|
+
release(manager, result);
|
|
323
|
+
release(manager, replaced);
|
|
324
|
+
}
|
|
325
|
+
}
|
|
326
|
+
for (const condition of this.sideConditions.items) fmls.assert(condition);
|
|
327
|
+
this.sideConditions.reset();
|
|
328
|
+
this.rewriter.reset();
|
|
329
|
+
} finally {
|
|
330
|
+
substitution.release();
|
|
331
|
+
}
|
|
332
|
+
}
|
|
333
|
+
|
|
334
|
+
push() {
|
|
335
|
+
this.fnLimits.push(this.bvFns.length);
|
|
336
|
+
this.bounds.push(new BoundManager(this.manager));
|
|
337
|
+
}
|
|
338
|
+
|
|
339
|
+
pop(numScopes: number) {
|
|
340
|
+
const manager = this.manager;
|
|
341
|
+
const limit = this.fnLimits[this.fnLimits.length - numScopes];
|
|
342
|
+
for (let index = this.intFns.length - 1; index >= limit; index--) {
|
|
343
|
+
this.int2bv.delete(this.intFns[index]);
|
|
344
|
+
this.bv2offset.delete(this.bvFns[index]);
|
|
345
|
+
}
|
|
346
|
+
for (const decl of this.bvFns.splice(limit)) manager.decDeclRef(decl);
|
|
347
|
+
for (const decl of this.intFns.splice(limit)) manager.decDeclRef(decl);
|
|
348
|
+
this.fnLimits.length -= numScopes;
|
|
349
|
+
this.bounds.length -= numScopes;
|
|
350
|
+
}
|
|
351
|
+
|
|
352
|
+
release() {
|
|
353
|
+
const manager = this.manager;
|
|
354
|
+
this.sideConditions.reset();
|
|
355
|
+
this.rewriter.release();
|
|
356
|
+
this.context.release();
|
|
357
|
+
for (const decl of this.intFns) manager.decDeclRef(decl);
|
|
358
|
+
for (const decl of this.bvFns) manager.decDeclRef(decl);
|
|
359
|
+
}
|
|
360
|
+
}
|
|
361
|
+
|
|
362
|
+
class Enum2BvSimplifier {
|
|
363
|
+
private readonly rewriter: Enum2BvRewriter;
|
|
364
|
+
private readonly hidden = new Set<number>();
|
|
365
|
+
private readonly defined = new Set<number>();
|
|
366
|
+
private readonly hiddenTrail: number[] = [];
|
|
367
|
+
private readonly definedTrail: number[] = [];
|
|
368
|
+
private readonly hiddenLimits: number[] = [];
|
|
369
|
+
private readonly definedLimits: number[] = [];
|
|
370
|
+
|
|
371
|
+
constructor(private readonly manager: AstManager) {
|
|
372
|
+
this.rewriter = new Enum2BvRewriter(manager, undefined);
|
|
373
|
+
}
|
|
374
|
+
|
|
375
|
+
reduce(state: FdState, trail: ModelTrail) {
|
|
376
|
+
const manager = this.manager;
|
|
377
|
+
const fmls = state.goal;
|
|
378
|
+
const rewriter = this.rewriter;
|
|
379
|
+
let result = -1;
|
|
380
|
+
try {
|
|
381
|
+
state.forEachIndex((index) => {
|
|
382
|
+
const form = fmls.forms.items[index];
|
|
383
|
+
result = assignOwned(manager, result, rewriter.rewrite(form));
|
|
384
|
+
if (result !== form) fmls.update(index, result, fmls.getDependency(index));
|
|
385
|
+
});
|
|
386
|
+
const bounds = new RefVector(manager);
|
|
387
|
+
for (const bound of rewriter.bounds.items) bounds.push(bound);
|
|
388
|
+
rewriter.bounds.reset();
|
|
389
|
+
for (const bound of bounds.items) fmls.assert(bound);
|
|
390
|
+
bounds.reset();
|
|
391
|
+
for (const [, index] of rewriter.enumIndexes) {
|
|
392
|
+
const bvDecl = rewriter.enumBvs[index];
|
|
393
|
+
if (this.hidden.has(bvDecl)) continue;
|
|
394
|
+
this.hidden.add(bvDecl);
|
|
395
|
+
manager.incDeclRef(bvDecl);
|
|
396
|
+
this.hiddenTrail.push(bvDecl);
|
|
397
|
+
trail.hide(bvDecl);
|
|
398
|
+
}
|
|
399
|
+
for (const [decl, index] of rewriter.enumIndexes) {
|
|
400
|
+
if (this.defined.has(decl)) continue;
|
|
401
|
+
this.defined.add(decl);
|
|
402
|
+
manager.incDeclRef(decl);
|
|
403
|
+
this.definedTrail.push(decl);
|
|
404
|
+
trail.define(decl, rewriter.enumDefs.items[index]);
|
|
405
|
+
}
|
|
406
|
+
} finally {
|
|
407
|
+
release(manager, result);
|
|
408
|
+
}
|
|
409
|
+
}
|
|
410
|
+
|
|
411
|
+
push() {
|
|
412
|
+
this.rewriter.push();
|
|
413
|
+
this.hiddenLimits.push(this.hiddenTrail.length);
|
|
414
|
+
this.definedLimits.push(this.definedTrail.length);
|
|
415
|
+
}
|
|
416
|
+
|
|
417
|
+
pop(numScopes: number) {
|
|
418
|
+
const manager = this.manager;
|
|
419
|
+
const hiddenLimit = this.hiddenLimits[this.hiddenLimits.length - numScopes];
|
|
420
|
+
const definedLimit = this.definedLimits[this.definedLimits.length - numScopes];
|
|
421
|
+
for (let index = this.hiddenTrail.length - 1; index >= hiddenLimit; index--)
|
|
422
|
+
this.hidden.delete(this.hiddenTrail[index]);
|
|
423
|
+
for (let index = this.definedTrail.length - 1; index >= definedLimit; index--)
|
|
424
|
+
this.defined.delete(this.definedTrail[index]);
|
|
425
|
+
for (const decl of this.hiddenTrail.splice(hiddenLimit)) manager.decDeclRef(decl);
|
|
426
|
+
for (const decl of this.definedTrail.splice(definedLimit)) manager.decDeclRef(decl);
|
|
427
|
+
this.hiddenLimits.length -= numScopes;
|
|
428
|
+
this.definedLimits.length -= numScopes;
|
|
429
|
+
this.rewriter.pop(numScopes);
|
|
430
|
+
}
|
|
431
|
+
|
|
432
|
+
release() {
|
|
433
|
+
const manager = this.manager;
|
|
434
|
+
for (const decl of this.definedTrail) manager.decDeclRef(decl);
|
|
435
|
+
for (const decl of this.hiddenTrail) manager.decDeclRef(decl);
|
|
436
|
+
this.rewriter.release();
|
|
437
|
+
}
|
|
438
|
+
}
|
|
439
|
+
|
|
440
|
+
// The sole uninterpreted constant of a term, which stands for it in the SAT solver.
|
|
441
|
+
const getRepresentative = (manager: AstManager, expr: number) => {
|
|
442
|
+
const visited = new Set<number>();
|
|
443
|
+
const todo = [expr];
|
|
444
|
+
let result = -1;
|
|
445
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
446
|
+
if (visited.has(current)) continue;
|
|
447
|
+
visited.add(current);
|
|
448
|
+
if (manager.isUninterpretedConst(current)) {
|
|
449
|
+
if (result !== -1 && result !== current) return -1;
|
|
450
|
+
result = current;
|
|
451
|
+
} else if (manager.kinds[current] === KIND_QUANTIFIER)
|
|
452
|
+
todo.push(manager.getQuantifier(current).body);
|
|
453
|
+
else if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
|
|
454
|
+
}
|
|
455
|
+
return result;
|
|
456
|
+
};
|
|
457
|
+
|
|
458
|
+
interface FdScope {
|
|
459
|
+
qhead: number;
|
|
460
|
+
size: number;
|
|
461
|
+
trailSize: number;
|
|
462
|
+
isInconsistent: boolean;
|
|
463
|
+
}
|
|
464
|
+
|
|
465
|
+
export class FdSolver {
|
|
466
|
+
private readonly solver: IncSatSolver;
|
|
467
|
+
private readonly fmls: SolverFormulas;
|
|
468
|
+
private readonly state: FdState;
|
|
469
|
+
private readonly trail: ModelTrail;
|
|
470
|
+
private readonly int2bv: BoundedInt2BvSimplifier;
|
|
471
|
+
private readonly enum2bv: Enum2BvSimplifier;
|
|
472
|
+
private readonly coreReplace: ExprSafeReplace;
|
|
473
|
+
private readonly core: RefVector;
|
|
474
|
+
private readonly scopes: FdScope[] = [];
|
|
475
|
+
private converter: Definition[] = [];
|
|
476
|
+
private model: ProtoModel | undefined;
|
|
477
|
+
|
|
478
|
+
constructor(
|
|
479
|
+
private readonly manager: AstManager,
|
|
480
|
+
params: SatParams,
|
|
481
|
+
isIncremental = true,
|
|
482
|
+
) {
|
|
483
|
+
this.solver = new IncSatSolver(manager, params, isIncremental);
|
|
484
|
+
this.fmls = new SolverFormulas(manager);
|
|
485
|
+
this.state = new FdState(manager, this.fmls);
|
|
486
|
+
this.trail = new ModelTrail(manager);
|
|
487
|
+
this.int2bv = new BoundedInt2BvSimplifier(manager);
|
|
488
|
+
this.enum2bv = new Enum2BvSimplifier(manager);
|
|
489
|
+
this.coreReplace = new ExprSafeReplace(manager);
|
|
490
|
+
this.core = new RefVector(manager);
|
|
491
|
+
}
|
|
492
|
+
|
|
493
|
+
get reasonUnknown() {
|
|
494
|
+
return this.solver.reasonUnknown;
|
|
495
|
+
}
|
|
496
|
+
|
|
497
|
+
assertExpr(form: number, name = -1) {
|
|
498
|
+
this.clearModel();
|
|
499
|
+
this.fmls.forms.push(form);
|
|
500
|
+
this.fmls.dependencies.push(name === -1 ? undefined : mkDependencyLeaf(name));
|
|
501
|
+
}
|
|
502
|
+
|
|
503
|
+
push() {
|
|
504
|
+
this.flush([]).reset();
|
|
505
|
+
this.scopes.push({
|
|
506
|
+
qhead: this.state.qhead,
|
|
507
|
+
size: this.fmls.forms.size,
|
|
508
|
+
trailSize: this.trail.entries.length,
|
|
509
|
+
isInconsistent: this.fmls.isInconsistent,
|
|
510
|
+
});
|
|
511
|
+
this.int2bv.push();
|
|
512
|
+
this.enum2bv.push();
|
|
513
|
+
this.solver.push();
|
|
514
|
+
}
|
|
515
|
+
|
|
516
|
+
pop(numScopes: number) {
|
|
517
|
+
this.solver.pop(numScopes);
|
|
518
|
+
this.clearModel();
|
|
519
|
+
this.int2bv.pop(numScopes);
|
|
520
|
+
this.enum2bv.pop(numScopes);
|
|
521
|
+
const scope = this.scopes[this.scopes.length - numScopes];
|
|
522
|
+
this.scopes.length -= numScopes;
|
|
523
|
+
this.trail.shrink(scope.trailSize);
|
|
524
|
+
this.fmls.isInconsistent = scope.isInconsistent;
|
|
525
|
+
this.fmls.shrinkTo(scope.size);
|
|
526
|
+
this.state.qhead = scope.qhead;
|
|
527
|
+
}
|
|
528
|
+
|
|
529
|
+
check(assumptions: readonly number[] = []) {
|
|
530
|
+
const flushed = this.flush(assumptions);
|
|
531
|
+
const result = this.solver.check(flushed.items);
|
|
532
|
+
flushed.reset();
|
|
533
|
+
// solver::check_sat counts a step to see whether the limit stopped a search that gave up.
|
|
534
|
+
if (result === L_UNDEF) this.manager.limit.inc();
|
|
535
|
+
return result;
|
|
536
|
+
}
|
|
537
|
+
|
|
538
|
+
getModel() {
|
|
539
|
+
if (this.model !== undefined) return this.model;
|
|
540
|
+
const model = this.solver.mkModel();
|
|
541
|
+
if (model === null) return undefined;
|
|
542
|
+
const converted = this.converter.length > 0 ? applyDefinitions(this.converter, model) : model;
|
|
543
|
+
converted.incRef();
|
|
544
|
+
this.model = converted;
|
|
545
|
+
return converted;
|
|
546
|
+
}
|
|
547
|
+
|
|
548
|
+
getUnsatCore() {
|
|
549
|
+
this.core.reset();
|
|
550
|
+
for (const expr of this.solver.getUnsatCore())
|
|
551
|
+
this.core.pushOwned(this.coreReplace.apply(expr));
|
|
552
|
+
return this.core.items;
|
|
553
|
+
}
|
|
554
|
+
|
|
555
|
+
getConsequences(assumptions: readonly number[], vars: readonly number[]) {
|
|
556
|
+
const manager = this.manager;
|
|
557
|
+
const flushed = this.flush([...assumptions, ...vars]);
|
|
558
|
+
const asms1 = flushed.items.slice(0, assumptions.length);
|
|
559
|
+
const vars1 = flushed.items.slice(assumptions.length);
|
|
560
|
+
const queryVars = vars1.map((expr) => {
|
|
561
|
+
const representative = getRepresentative(manager, expr);
|
|
562
|
+
return representative === -1 ? expr : representative;
|
|
563
|
+
});
|
|
564
|
+
const found = this.solver.getConsequences(asms1, queryVars);
|
|
565
|
+
const trail = new RefVector(manager);
|
|
566
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
567
|
+
const consequences = new RefVector(manager);
|
|
568
|
+
for (const consequence of found.consequences) {
|
|
569
|
+
const premise = manager.getArg(consequence, 0);
|
|
570
|
+
const conclusion = manager.getArg(consequence, 1);
|
|
571
|
+
const [query, value] = (() => {
|
|
572
|
+
if (manager.decls[conclusion] === OP_EQ) {
|
|
573
|
+
const lhs = manager.getArg(conclusion, 0);
|
|
574
|
+
const rhs = manager.getArg(conclusion, 1);
|
|
575
|
+
for (const queryVar of queryVars) {
|
|
576
|
+
if (lhs === queryVar) return [lhs, rhs];
|
|
577
|
+
if (rhs === queryVar) return [rhs, lhs];
|
|
578
|
+
}
|
|
579
|
+
return [-1, -1];
|
|
580
|
+
}
|
|
581
|
+
if (manager.isUninterpretedConst(conclusion)) return [conclusion, manager.trueExpr];
|
|
582
|
+
if (
|
|
583
|
+
manager.isNot(conclusion) &&
|
|
584
|
+
manager.isUninterpretedConst(manager.getArg(conclusion, 0))
|
|
585
|
+
)
|
|
586
|
+
return [manager.getArg(conclusion, 0), manager.falseExpr];
|
|
587
|
+
return [-1, -1];
|
|
588
|
+
})();
|
|
589
|
+
const index = queryVars.findIndex(
|
|
590
|
+
(queryVar, position) => queryVar === query && vars[position] !== vars1[position],
|
|
591
|
+
);
|
|
592
|
+
const decoded = (() => {
|
|
593
|
+
if (query === -1 || index === -1) return consequence;
|
|
594
|
+
const substitution = new ExprSafeReplace(manager);
|
|
595
|
+
substitution.insert(query, value);
|
|
596
|
+
const replaced = substitution.apply(vars1[index]);
|
|
597
|
+
trail.pushOwned(replaced);
|
|
598
|
+
substitution.release();
|
|
599
|
+
const rewritten = rewriter.rewrite(replaced);
|
|
600
|
+
trail.pushOwned(rewritten);
|
|
601
|
+
return manager.mkApp(
|
|
602
|
+
OP_IMPLIES,
|
|
603
|
+
[premise, manager.mkEq(vars[index], rewritten)],
|
|
604
|
+
SORT_BOOL,
|
|
605
|
+
);
|
|
606
|
+
})();
|
|
607
|
+
consequences.pushOwned(this.coreReplace.apply(decoded));
|
|
608
|
+
}
|
|
609
|
+
rewriter.release();
|
|
610
|
+
trail.reset();
|
|
611
|
+
flushed.reset();
|
|
612
|
+
return { result: found.result, consequences };
|
|
613
|
+
}
|
|
614
|
+
|
|
615
|
+
getAssertions() {
|
|
616
|
+
return this.solver.getAssertions();
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
getConverters(): Goal["converters"] {
|
|
620
|
+
const definitions = retainDefinitions(this.manager, this.converter);
|
|
621
|
+
return [...(definitions.length > 0 ? [{ definitions }] : []), ...this.solver.getConverters()];
|
|
622
|
+
}
|
|
623
|
+
|
|
624
|
+
private flush(assumptions: readonly number[]) {
|
|
625
|
+
const manager = this.manager;
|
|
626
|
+
const fmls = this.fmls;
|
|
627
|
+
this.clearModel();
|
|
628
|
+
const qhead = this.state.qhead;
|
|
629
|
+
const flushed = new RefVector(manager);
|
|
630
|
+
for (const assumption of assumptions) flushed.push(assumption);
|
|
631
|
+
this.coreReplace.reset();
|
|
632
|
+
this.replay(qhead, flushed);
|
|
633
|
+
if (qhead < fmls.forms.size) {
|
|
634
|
+
this.reduce();
|
|
635
|
+
if (!manager.limit.inc()) return flushed;
|
|
636
|
+
this.replay(qhead, flushed);
|
|
637
|
+
this.state.qhead = fmls.forms.size;
|
|
638
|
+
}
|
|
639
|
+
flushed.items.forEach((assumption, index) =>
|
|
640
|
+
this.coreReplace.insert(assumption, assumptions[index]),
|
|
641
|
+
);
|
|
642
|
+
const converter = retainDefinitions(manager, this.trail.entries);
|
|
643
|
+
releaseDefinitions(manager, this.converter);
|
|
644
|
+
this.converter = converter;
|
|
645
|
+
for (let index = qhead; index < fmls.forms.size; index++) {
|
|
646
|
+
const names = getDependencyValues(fmls.getDependency(index));
|
|
647
|
+
if (names.length === 0) this.solver.assertExpr(fmls.forms.items[index]);
|
|
648
|
+
else this.solver.assertNamed(fmls.forms.items[index], manager.mkAnd(names));
|
|
649
|
+
}
|
|
650
|
+
return flushed;
|
|
651
|
+
}
|
|
652
|
+
|
|
653
|
+
private replay(qhead: number, assumptions: RefVector) {
|
|
654
|
+
const manager = this.manager;
|
|
655
|
+
this.trail.replay(qhead, assumptions, this.fmls);
|
|
656
|
+
if (assumptions.size === 0) return;
|
|
657
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
658
|
+
for (let index = 0; index < assumptions.size; index++)
|
|
659
|
+
assumptions.setOwned(index, rewriter.rewrite(assumptions.items[index]));
|
|
660
|
+
rewriter.release();
|
|
661
|
+
}
|
|
662
|
+
|
|
663
|
+
private reduce() {
|
|
664
|
+
const manager = this.manager;
|
|
665
|
+
const fmls = this.fmls;
|
|
666
|
+
const state = this.state;
|
|
667
|
+
if (fmls.isInconsistent || !manager.limit.inc()) return;
|
|
668
|
+
const simplifiers = [
|
|
669
|
+
() => this.int2bv.reduce(state, this.trail),
|
|
670
|
+
() => {
|
|
671
|
+
const simplifier = createCard2Bv(manager, getRewriterOptions(manager, new Map()))(state);
|
|
672
|
+
try {
|
|
673
|
+
simplifier.reduce();
|
|
674
|
+
} finally {
|
|
675
|
+
simplifier.release();
|
|
676
|
+
}
|
|
677
|
+
},
|
|
678
|
+
() => this.enum2bv.reduce(state, this.trail),
|
|
679
|
+
];
|
|
680
|
+
for (const simplify of simplifiers) {
|
|
681
|
+
if (fmls.isInconsistent || !manager.limit.inc()) break;
|
|
682
|
+
try {
|
|
683
|
+
simplify();
|
|
684
|
+
} catch (error) {
|
|
685
|
+
// The rewriter_exception of a canceled rewrite or of a nested datatype.
|
|
686
|
+
if (!(error instanceof SmtCanceledError || error instanceof SmtTacticError)) throw error;
|
|
687
|
+
break;
|
|
688
|
+
}
|
|
689
|
+
fmls.flattenSuffix(state.qhead);
|
|
690
|
+
}
|
|
691
|
+
fmls.flattenSuffix(state.qhead);
|
|
692
|
+
}
|
|
693
|
+
|
|
694
|
+
private clearModel() {
|
|
695
|
+
this.model?.decRef();
|
|
696
|
+
this.model = undefined;
|
|
697
|
+
}
|
|
698
|
+
|
|
699
|
+
release() {
|
|
700
|
+
this.clearModel();
|
|
701
|
+
this.core.reset();
|
|
702
|
+
this.coreReplace.release();
|
|
703
|
+
releaseDefinitions(this.manager, this.converter);
|
|
704
|
+
this.converter = [];
|
|
705
|
+
this.int2bv.release();
|
|
706
|
+
this.enum2bv.release();
|
|
707
|
+
this.trail.shrink(0);
|
|
708
|
+
this.fmls.reset();
|
|
709
|
+
this.solver.release();
|
|
710
|
+
}
|
|
711
|
+
}
|
|
712
|
+
|
|
713
|
+
export const createFdTactic = (manager: AstManager, params: SatParams) => (goal: Goal) => {
|
|
714
|
+
const solver = new FdSolver(manager, params, false);
|
|
715
|
+
try {
|
|
716
|
+
for (const form of goal.forms.items) solver.assertExpr(form);
|
|
717
|
+
const result = solver.check();
|
|
718
|
+
goal.reset();
|
|
719
|
+
if (result === L_TRUE) {
|
|
720
|
+
const model = solver.getModel();
|
|
721
|
+
model?.incRef();
|
|
722
|
+
if (model !== undefined) goal.model = model;
|
|
723
|
+
} else if (result === L_FALSE) goal.assert(manager.falseExpr);
|
|
724
|
+
else {
|
|
725
|
+
if (!manager.limit.inc()) throw new SmtTacticError("canceled");
|
|
726
|
+
for (const form of solver.getAssertions()) goal.assert(form);
|
|
727
|
+
goal.converters = [...goal.converters, ...solver.getConverters()];
|
|
728
|
+
}
|
|
729
|
+
goal.depth++;
|
|
730
|
+
return [goal];
|
|
731
|
+
} finally {
|
|
732
|
+
solver.release();
|
|
733
|
+
}
|
|
734
|
+
};
|