tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- 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 +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- 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 +118 -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 +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- 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 +224 -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 +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- 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 +6 -17
- 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 +0 -2
- 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/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 +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -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 +613 -6
- 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 +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -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 +260 -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-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -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 +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +30 -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 +110 -38
- 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 +345 -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 +18 -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 +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 +40 -4
- 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 +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 +67 -16
- 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 +165 -83
- 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 +122 -64
- 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 -289
- 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 +309 -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 +105 -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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -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 +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -16
- 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 +261 -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 +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- 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 +1986 -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 +1200 -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 +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +50 -19
- 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 +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- 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 +0 -2
- 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/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -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/values.ts +136 -338
- 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,353 @@
|
|
|
1
|
+
import { type AstManager, OP_SEQ_UNIT } from "./ast";
|
|
2
|
+
import { GuardSet, GuardSetCache } from "./guard-set";
|
|
3
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
4
|
+
import { RefVector } from "./ref-vector";
|
|
5
|
+
import { mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
|
|
6
|
+
import { guardToRangePredicate } from "./seq-range-predicate";
|
|
7
|
+
import type { ReRewriter } from "./seq-re-rewriter";
|
|
8
|
+
import { isReEmpty } from "./seq-re-util";
|
|
9
|
+
|
|
10
|
+
export const VIEW_FAILURE_NONE = 0;
|
|
11
|
+
export const VIEW_FAILURE_UNSUPPORTED = 1;
|
|
12
|
+
export const VIEW_FAILURE_BUDGET = 2;
|
|
13
|
+
export const VIEW_FAILURE_RESOURCE = 3;
|
|
14
|
+
export const VIEW_FAILURE_STATE_EXPANSION = 4;
|
|
15
|
+
export const VIEW_FAILURE_NULLABILITY = 5;
|
|
16
|
+
export const VIEW_FAILURE_GUARD = 6;
|
|
17
|
+
|
|
18
|
+
const INNER_LIMIT = 1 << 16;
|
|
19
|
+
const RANGE_CACHE_CAP = 1 << 16;
|
|
20
|
+
|
|
21
|
+
interface IntervalList {
|
|
22
|
+
ranges: number[];
|
|
23
|
+
targets: number[];
|
|
24
|
+
isOk: boolean;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
export interface ProductResult {
|
|
28
|
+
status: number;
|
|
29
|
+
word: number;
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
interface Parent {
|
|
33
|
+
key: string;
|
|
34
|
+
element: number;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
export const dedupViews = (views: readonly number[]) => {
|
|
38
|
+
const result: number[] = [];
|
|
39
|
+
for (let index = 0; index < views.length; index += 2) {
|
|
40
|
+
let isSeen = false;
|
|
41
|
+
for (let other = 0; other < result.length && !isSeen; other += 2)
|
|
42
|
+
isSeen = result[other] === views[index] && result[other + 1] === views[index + 1];
|
|
43
|
+
if (!isSeen) result.push(views[index], views[index + 1]);
|
|
44
|
+
}
|
|
45
|
+
return result;
|
|
46
|
+
};
|
|
47
|
+
|
|
48
|
+
export const getViewsKey = (manager: AstManager, views: readonly number[]) => {
|
|
49
|
+
const keys: number[][] = [];
|
|
50
|
+
for (let index = 0; index < views.length; index += 2)
|
|
51
|
+
keys.push([
|
|
52
|
+
manager.ids[views[index]],
|
|
53
|
+
views[index + 1] === -1 ? 0xffffffff : manager.ids[views[index + 1]],
|
|
54
|
+
]);
|
|
55
|
+
keys.sort((first, second) => first[0] - second[0] || first[1] - second[1]);
|
|
56
|
+
return keys
|
|
57
|
+
.filter(
|
|
58
|
+
(key, index) => index === 0 || key[0] !== keys[index - 1][0] || key[1] !== keys[index - 1][1],
|
|
59
|
+
)
|
|
60
|
+
.join(";");
|
|
61
|
+
};
|
|
62
|
+
|
|
63
|
+
export class ViewWitness {
|
|
64
|
+
private pins: RefVector;
|
|
65
|
+
private rangeCache: GuardSetCache;
|
|
66
|
+
private intervalCache = new Map<number, IntervalList>();
|
|
67
|
+
private intervalPins: RefVector;
|
|
68
|
+
private nullableCache = new Map<number, number>();
|
|
69
|
+
failure = VIEW_FAILURE_NONE;
|
|
70
|
+
|
|
71
|
+
constructor(
|
|
72
|
+
private manager: AstManager,
|
|
73
|
+
private re: ReRewriter,
|
|
74
|
+
private mode: number,
|
|
75
|
+
private checkpoint: () => number,
|
|
76
|
+
) {
|
|
77
|
+
this.pins = new RefVector(manager);
|
|
78
|
+
this.rangeCache = new GuardSetCache(manager);
|
|
79
|
+
this.intervalPins = new RefVector(manager);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
nullable(regex: number) {
|
|
83
|
+
const manager = this.manager;
|
|
84
|
+
const info = this.re.info.getInfo(regex).nullable;
|
|
85
|
+
if (info !== L_UNDEF) return info;
|
|
86
|
+
const cached = this.nullableCache.get(regex);
|
|
87
|
+
if (cached !== undefined) return cached;
|
|
88
|
+
const formula = this.re.isNullable(regex);
|
|
89
|
+
const result = manager.isTrue(formula) ? L_TRUE : manager.isFalse(formula) ? L_FALSE : L_UNDEF;
|
|
90
|
+
this.pins.push(regex);
|
|
91
|
+
this.nullableCache.set(regex, result);
|
|
92
|
+
return result;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
private getCofactors(regex: number) {
|
|
96
|
+
return this.re.getDerive().getCachedCofactors(this.mode, regex);
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private getIntervalCofactors(regex: number, variable: number) {
|
|
100
|
+
const manager = this.manager;
|
|
101
|
+
const cached = this.intervalCache.get(regex);
|
|
102
|
+
if (cached !== undefined) return cached.isOk ? cached : undefined;
|
|
103
|
+
const maxChar = manager.maxChar;
|
|
104
|
+
const result: IntervalList = { ranges: [], targets: [], isOk: true };
|
|
105
|
+
this.intervalCache.set(regex, result);
|
|
106
|
+
this.intervalPins.push(regex);
|
|
107
|
+
const transitions: number[] = [];
|
|
108
|
+
const bounds = [0];
|
|
109
|
+
const cofactors = this.getCofactors(regex);
|
|
110
|
+
for (let index = 0; index < cofactors.size; index += 2) {
|
|
111
|
+
const guard = cofactors.items[index];
|
|
112
|
+
const target = cofactors.items[index + 1];
|
|
113
|
+
if (isReEmpty(manager, target)) continue;
|
|
114
|
+
if (!this.rangeCache.has(guard))
|
|
115
|
+
this.rangeCache.insert(guard, guardToRangePredicate(manager, variable, guard));
|
|
116
|
+
const predicate = this.rangeCache.get(guard);
|
|
117
|
+
if (predicate === undefined) {
|
|
118
|
+
result.isOk = false;
|
|
119
|
+
return undefined;
|
|
120
|
+
}
|
|
121
|
+
this.intervalPins.push(target);
|
|
122
|
+
for (let range = 0; range < predicate.length; range += 2) {
|
|
123
|
+
transitions.push(predicate[range], predicate[range + 1], target);
|
|
124
|
+
bounds.push(predicate[range]);
|
|
125
|
+
if (predicate[range + 1] < maxChar) bounds.push(predicate[range + 1] + 1);
|
|
126
|
+
}
|
|
127
|
+
}
|
|
128
|
+
if (transitions.length === 0) return result;
|
|
129
|
+
const sorted = [...new Set(bounds)].sort((first, second) => first - second);
|
|
130
|
+
const hits: number[] = [];
|
|
131
|
+
for (let index = 0; index < sorted.length; index++) {
|
|
132
|
+
const lo = sorted[index];
|
|
133
|
+
const hi = index + 1 < sorted.length ? sorted[index + 1] - 1 : maxChar;
|
|
134
|
+
hits.length = 0;
|
|
135
|
+
for (let transition = 0; transition < transitions.length; transition += 3)
|
|
136
|
+
if (transitions[transition] <= lo && lo <= transitions[transition + 1])
|
|
137
|
+
hits.push(transitions[transition + 2]);
|
|
138
|
+
if (hits.length === 0) continue;
|
|
139
|
+
const ranges = result.ranges;
|
|
140
|
+
const last = ranges.length - 4;
|
|
141
|
+
if (last >= 0 && ranges[last + 1] + 1 === lo && ranges[last + 3] === hits.length) {
|
|
142
|
+
const first = ranges[last + 2];
|
|
143
|
+
if (hits.every((hit, position) => result.targets[first + position] === hit)) {
|
|
144
|
+
ranges[last + 1] = hi;
|
|
145
|
+
continue;
|
|
146
|
+
}
|
|
147
|
+
}
|
|
148
|
+
ranges.push(lo, hi, result.targets.length, hits.length);
|
|
149
|
+
result.targets.push(...hits);
|
|
150
|
+
}
|
|
151
|
+
return result;
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
productNonempty(variable: number, input: readonly number[], isWitnessWanted: boolean) {
|
|
155
|
+
const manager = this.manager;
|
|
156
|
+
this.failure = VIEW_FAILURE_NONE;
|
|
157
|
+
const seqSort = manager.sorts[variable];
|
|
158
|
+
const undecided: ProductResult = { status: L_UNDEF, word: -1 };
|
|
159
|
+
if (!manager.isSeqSort(seqSort)) {
|
|
160
|
+
this.failure = VIEW_FAILURE_UNSUPPORTED;
|
|
161
|
+
return undecided;
|
|
162
|
+
}
|
|
163
|
+
const elementSort = manager.getSeqElementSort(seqSort);
|
|
164
|
+
const views = dedupViews(input);
|
|
165
|
+
const size = views.length / 2;
|
|
166
|
+
if (size === 0)
|
|
167
|
+
return { status: L_TRUE, word: isWitnessWanted ? mkEmptySeq(manager, seqSort) : -1 };
|
|
168
|
+
const variable0 = manager.mkVar(0, elementSort);
|
|
169
|
+
const work: number[] = [];
|
|
170
|
+
const visited = new Set<string>();
|
|
171
|
+
const state: number[] = Array.from({ length: size }, () => -1);
|
|
172
|
+
const current: number[] = Array.from({ length: size }, () => -1);
|
|
173
|
+
const parents = new Map<string, Parent>();
|
|
174
|
+
let isUndecided = false;
|
|
175
|
+
const isAccept = () => {
|
|
176
|
+
for (let index = 0; index < size; index++) {
|
|
177
|
+
const target = views[2 * index + 1];
|
|
178
|
+
if (target !== -1) {
|
|
179
|
+
if (state[index] !== target) return false;
|
|
180
|
+
continue;
|
|
181
|
+
}
|
|
182
|
+
const nullable = this.nullable(state[index]);
|
|
183
|
+
if (nullable === L_TRUE) continue;
|
|
184
|
+
if (nullable === L_UNDEF) isUndecided = true;
|
|
185
|
+
return false;
|
|
186
|
+
}
|
|
187
|
+
return true;
|
|
188
|
+
};
|
|
189
|
+
for (let index = 0; index < size; index++) work.push(views[2 * index]);
|
|
190
|
+
const startKey = work.join(",");
|
|
191
|
+
visited.add(startKey);
|
|
192
|
+
const reconstruct = (endKey: string) => {
|
|
193
|
+
const elements: number[] = [];
|
|
194
|
+
for (let key = endKey; key !== startKey;) {
|
|
195
|
+
const parent = parents.get(key);
|
|
196
|
+
if (parent === undefined) break;
|
|
197
|
+
elements.push(parent.element);
|
|
198
|
+
key = parent.key;
|
|
199
|
+
}
|
|
200
|
+
const units: number[] = [];
|
|
201
|
+
for (let index = elements.length; index-- > 0;)
|
|
202
|
+
units.push(mkSeqApp(manager, OP_SEQ_UNIT, [elements[index]]));
|
|
203
|
+
return mkConcatOf(manager, units, seqSort);
|
|
204
|
+
};
|
|
205
|
+
let stateKey = "";
|
|
206
|
+
let isBailing = false;
|
|
207
|
+
let innerSteps = 0;
|
|
208
|
+
const isInnerStepExceeded = () => {
|
|
209
|
+
innerSteps++;
|
|
210
|
+
if (innerSteps <= INNER_LIMIT) return false;
|
|
211
|
+
this.failure = VIEW_FAILURE_STATE_EXPANSION;
|
|
212
|
+
return true;
|
|
213
|
+
};
|
|
214
|
+
const addChild = (element: number) => {
|
|
215
|
+
const childKey = current.join(",");
|
|
216
|
+
if (visited.has(childKey)) return;
|
|
217
|
+
visited.add(childKey);
|
|
218
|
+
if (isWitnessWanted && element !== -1) {
|
|
219
|
+
this.pins.push(element);
|
|
220
|
+
parents.set(childKey, { key: stateKey, element });
|
|
221
|
+
}
|
|
222
|
+
work.push(...current);
|
|
223
|
+
};
|
|
224
|
+
const isSweepOk = manager.isCharSort(elementSort);
|
|
225
|
+
const maxChar = manager.maxChar;
|
|
226
|
+
const lists: IntervalList[] = [];
|
|
227
|
+
const cursors: number[] = Array.from({ length: size }, () => 0);
|
|
228
|
+
const odometer: number[] = Array.from({ length: size }, () => 0);
|
|
229
|
+
const sweep = () => {
|
|
230
|
+
for (let index = 0; index < size; index++) {
|
|
231
|
+
const list = this.getIntervalCofactors(state[index], variable0);
|
|
232
|
+
if (list === undefined) return false;
|
|
233
|
+
lists[index] = list;
|
|
234
|
+
if (list.ranges.length === 0) return true;
|
|
235
|
+
cursors[index] = 0;
|
|
236
|
+
}
|
|
237
|
+
let begin = 0;
|
|
238
|
+
while (begin <= maxChar) {
|
|
239
|
+
if (isInnerStepExceeded()) {
|
|
240
|
+
isBailing = true;
|
|
241
|
+
return true;
|
|
242
|
+
}
|
|
243
|
+
let next = maxChar + 1;
|
|
244
|
+
let isCovered = true;
|
|
245
|
+
let isDone = false;
|
|
246
|
+
for (let index = 0; index < size; index++) {
|
|
247
|
+
const ranges = lists[index].ranges;
|
|
248
|
+
while (cursors[index] < ranges.length && ranges[cursors[index] + 1] < begin)
|
|
249
|
+
cursors[index] += 4;
|
|
250
|
+
if (cursors[index] === ranges.length) {
|
|
251
|
+
isDone = true;
|
|
252
|
+
break;
|
|
253
|
+
}
|
|
254
|
+
const lo = ranges[cursors[index]];
|
|
255
|
+
if (lo > begin) {
|
|
256
|
+
isCovered = false;
|
|
257
|
+
next = Math.min(next, lo);
|
|
258
|
+
} else next = Math.min(next, ranges[cursors[index] + 1] + 1);
|
|
259
|
+
}
|
|
260
|
+
if (isDone) break;
|
|
261
|
+
if (isCovered) {
|
|
262
|
+
odometer.fill(0);
|
|
263
|
+
for (;;) {
|
|
264
|
+
if (isInnerStepExceeded()) {
|
|
265
|
+
isBailing = true;
|
|
266
|
+
return true;
|
|
267
|
+
}
|
|
268
|
+
for (let index = 0; index < size; index++) {
|
|
269
|
+
const ranges = lists[index].ranges;
|
|
270
|
+
current[index] = lists[index].targets[ranges[cursors[index] + 2] + odometer[index]];
|
|
271
|
+
}
|
|
272
|
+
addChild(isWitnessWanted ? manager.mkChar(begin) : -1);
|
|
273
|
+
let index = size;
|
|
274
|
+
while (index-- > 0) {
|
|
275
|
+
if (++odometer[index] < lists[index].ranges[cursors[index] + 3]) break;
|
|
276
|
+
odometer[index] = 0;
|
|
277
|
+
}
|
|
278
|
+
if (index === -1) break;
|
|
279
|
+
}
|
|
280
|
+
}
|
|
281
|
+
begin = next;
|
|
282
|
+
}
|
|
283
|
+
return true;
|
|
284
|
+
};
|
|
285
|
+
const branches: RefVector[] = [];
|
|
286
|
+
const enumerate = (index: number, accumulated: GuardSet) => {
|
|
287
|
+
if (isBailing) return;
|
|
288
|
+
if (isInnerStepExceeded()) {
|
|
289
|
+
isBailing = true;
|
|
290
|
+
return;
|
|
291
|
+
}
|
|
292
|
+
if (index === size) {
|
|
293
|
+
const evaluated = isWitnessWanted ? accumulated.eval(true) : undefined;
|
|
294
|
+
addChild(evaluated?.status === L_TRUE ? evaluated.witness : -1);
|
|
295
|
+
return;
|
|
296
|
+
}
|
|
297
|
+
const cofactors = branches[index];
|
|
298
|
+
for (let pair = 0; pair < cofactors.size; pair += 2) {
|
|
299
|
+
const target = cofactors.items[pair + 1];
|
|
300
|
+
if (isReEmpty(manager, target)) continue;
|
|
301
|
+
const next = accumulated.clone();
|
|
302
|
+
next.conjoin(cofactors.items[pair]);
|
|
303
|
+
const status = next.eval(false).status;
|
|
304
|
+
if (status === L_UNDEF) {
|
|
305
|
+
next.release();
|
|
306
|
+
this.failure = VIEW_FAILURE_GUARD;
|
|
307
|
+
isBailing = true;
|
|
308
|
+
return;
|
|
309
|
+
}
|
|
310
|
+
if (status === L_FALSE) {
|
|
311
|
+
next.release();
|
|
312
|
+
continue;
|
|
313
|
+
}
|
|
314
|
+
current[index] = target;
|
|
315
|
+
enumerate(index + 1, next);
|
|
316
|
+
next.release();
|
|
317
|
+
if (isBailing) return;
|
|
318
|
+
}
|
|
319
|
+
};
|
|
320
|
+
while (work.length > 0) {
|
|
321
|
+
this.failure = this.checkpoint();
|
|
322
|
+
if (this.failure !== VIEW_FAILURE_NONE) return undecided;
|
|
323
|
+
innerSteps = 0;
|
|
324
|
+
for (let index = size; index-- > 0;) state[index] = work.pop()!;
|
|
325
|
+
if (isAccept())
|
|
326
|
+
return { status: L_TRUE, word: isWitnessWanted ? reconstruct(state.join(",")) : -1 };
|
|
327
|
+
if (isUndecided) {
|
|
328
|
+
this.failure = VIEW_FAILURE_NULLABILITY;
|
|
329
|
+
return undecided;
|
|
330
|
+
}
|
|
331
|
+
stateKey = state.join(",");
|
|
332
|
+
if (isSweepOk) {
|
|
333
|
+
const isSwept = sweep();
|
|
334
|
+
if (isBailing) return undecided;
|
|
335
|
+
if (isSwept) continue;
|
|
336
|
+
}
|
|
337
|
+
for (let index = 0; index < size; index++) branches[index] = this.getCofactors(state[index]);
|
|
338
|
+
const top = new GuardSet(manager, elementSort, variable0, this.rangeCache);
|
|
339
|
+
enumerate(0, top);
|
|
340
|
+
top.release();
|
|
341
|
+
if (isBailing) return undecided;
|
|
342
|
+
}
|
|
343
|
+
return { status: L_FALSE, word: -1 };
|
|
344
|
+
}
|
|
345
|
+
|
|
346
|
+
resetCache() {
|
|
347
|
+
this.intervalCache.clear();
|
|
348
|
+
this.intervalPins.reset();
|
|
349
|
+
this.nullableCache.clear();
|
|
350
|
+
this.pins.reset();
|
|
351
|
+
this.rangeCache.maybeReset(RANGE_CACHE_CAP);
|
|
352
|
+
}
|
|
353
|
+
}
|
|
@@ -0,0 +1,297 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import { KIND_APP, OP_DT_IS, OP_DT_RECOGNISER, OP_EQ, OP_IMPLIES, OP_NOT, SORT_BOOL } from "./ast";
|
|
3
|
+
import { BinJustification, CLS_AUX } from "./clause";
|
|
4
|
+
import type { Context } from "./context";
|
|
5
|
+
import { getRecognizerConstructor } from "./datatype-decl-plugin";
|
|
6
|
+
import type { Enode } from "./enode";
|
|
7
|
+
import { getIdentityHash, ObjHashtable, ObjMap } from "./hashtable";
|
|
8
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
9
|
+
import { type BoolVar, getVar, isNegated, type Literal, mkLiteral, negate } from "./literal";
|
|
10
|
+
import { RefVector } from "./ref-vector";
|
|
11
|
+
import type { SmtKernel } from "./smt-kernel";
|
|
12
|
+
|
|
13
|
+
const CHUNK_SIZE = 100;
|
|
14
|
+
|
|
15
|
+
type IndexSet = ObjHashtable;
|
|
16
|
+
|
|
17
|
+
const createIndexSet = () => new ObjHashtable(getIdentityHash);
|
|
18
|
+
|
|
19
|
+
const addAll = (target: IndexSet, source: IndexSet) => {
|
|
20
|
+
for (const index of source) target.add(index);
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
class ConsequenceFinder {
|
|
24
|
+
private readonly context: Context;
|
|
25
|
+
private antecedents = new Map<BoolVar, IndexSet>();
|
|
26
|
+
private readonly var2val: ObjMap<number>;
|
|
27
|
+
private readonly var2orig = new Map<number, number>();
|
|
28
|
+
private readonly assumption2orig = new Map<BoolVar, number>();
|
|
29
|
+
readonly consequences: RefVector;
|
|
30
|
+
|
|
31
|
+
constructor(private readonly kernel: SmtKernel) {
|
|
32
|
+
this.context = kernel.context;
|
|
33
|
+
const manager = this.context.manager;
|
|
34
|
+
this.var2val = new ObjMap((expr) => manager.hashes[expr]);
|
|
35
|
+
this.consequences = new RefVector(manager);
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
private antecedentToFormula(vars: IndexSet) {
|
|
39
|
+
const context = this.context;
|
|
40
|
+
const manager = context.manager;
|
|
41
|
+
const premises: number[] = [];
|
|
42
|
+
for (const index of vars) {
|
|
43
|
+
const expr = this.assumption2orig.get(index as BoolVar);
|
|
44
|
+
if (expr === undefined) continue;
|
|
45
|
+
premises.push(
|
|
46
|
+
context.getBoolVarAssignment(index as BoolVar) !== L_FALSE
|
|
47
|
+
? expr
|
|
48
|
+
: manager.mkApp(OP_NOT, [expr], SORT_BOOL),
|
|
49
|
+
);
|
|
50
|
+
}
|
|
51
|
+
return manager.mkAnd(premises);
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private addConsequence(premises: IndexSet, conclusion: number) {
|
|
55
|
+
const manager = this.context.manager;
|
|
56
|
+
this.consequences.push(
|
|
57
|
+
manager.mkApp(OP_IMPLIES, [this.antecedentToFormula(premises), conclusion], SORT_BOOL),
|
|
58
|
+
);
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
private justify(literal: Literal, premises: IndexSet) {
|
|
62
|
+
const context = this.context;
|
|
63
|
+
const addAntecedent = (antecedent: Literal) => {
|
|
64
|
+
const set = this.antecedents.get(getVar(antecedent));
|
|
65
|
+
if (set !== undefined) addAll(premises, set);
|
|
66
|
+
};
|
|
67
|
+
const justification = context.justifications[getVar(literal)];
|
|
68
|
+
if (typeof justification === "number") {
|
|
69
|
+
const store = context.clauses;
|
|
70
|
+
for (let index = 0; index < store.getNumLiterals(justification); index++) {
|
|
71
|
+
const other = store.getLiteral(justification, index);
|
|
72
|
+
if (getVar(other) !== getVar(literal)) addAntecedent(other);
|
|
73
|
+
}
|
|
74
|
+
} else if (justification instanceof BinJustification) addAntecedent(justification.literal);
|
|
75
|
+
else if (justification !== null && justification !== "axiom")
|
|
76
|
+
for (const antecedent of context.conflictResolution.justificationToLiterals(justification))
|
|
77
|
+
addAntecedent(antecedent);
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
private extractFixedConsequence(literal: Literal, assumptions: IndexSet) {
|
|
81
|
+
const context = this.context;
|
|
82
|
+
const manager = context.manager;
|
|
83
|
+
if (literal === context.trueLiteral) return;
|
|
84
|
+
const expr = context.boolVar2Expr[getVar(literal)];
|
|
85
|
+
const premises = createIndexSet();
|
|
86
|
+
if (assumptions.has(getVar(literal))) premises.add(getVar(literal));
|
|
87
|
+
else this.justify(literal, premises);
|
|
88
|
+
const conclusion = (() => {
|
|
89
|
+
if (this.var2val.has(expr)) {
|
|
90
|
+
this.var2val.delete(expr);
|
|
91
|
+
const orig = this.var2orig.get(expr) as number;
|
|
92
|
+
return isNegated(literal) ? manager.mkApp(OP_NOT, [orig], SORT_BOOL) : orig;
|
|
93
|
+
}
|
|
94
|
+
if (isNegated(literal) || manager.kinds[expr] !== KIND_APP) return -1;
|
|
95
|
+
if (manager.decls[expr] === OP_EQ) {
|
|
96
|
+
const lhs = manager.getArg(expr, 0);
|
|
97
|
+
const rhs = manager.getArg(expr, 1);
|
|
98
|
+
if (this.var2val.has(rhs) && manager.isValue(lhs)) {
|
|
99
|
+
this.var2val.delete(rhs);
|
|
100
|
+
return manager.mkEq(this.var2orig.get(rhs) as number, lhs);
|
|
101
|
+
}
|
|
102
|
+
if (this.var2val.has(lhs) && manager.isValue(rhs)) {
|
|
103
|
+
this.var2val.delete(lhs);
|
|
104
|
+
return manager.mkEq(this.var2orig.get(lhs) as number, rhs);
|
|
105
|
+
}
|
|
106
|
+
return -1;
|
|
107
|
+
}
|
|
108
|
+
const op = manager.getOp(expr);
|
|
109
|
+
if (op !== OP_DT_RECOGNISER && op !== OP_DT_IS) return -1;
|
|
110
|
+
const arg = manager.getArg(expr, 0);
|
|
111
|
+
if (!this.var2val.has(arg)) return -1;
|
|
112
|
+
this.var2val.delete(arg);
|
|
113
|
+
const constructor = getRecognizerConstructor(manager, manager.decls[expr]);
|
|
114
|
+
// Z3 names the fresh constant that stands for the variable here, not the variable.
|
|
115
|
+
return manager.mkEq(
|
|
116
|
+
this.var2orig.get(arg) as number,
|
|
117
|
+
manager.mkApp(constructor, [], manager.sorts[arg]),
|
|
118
|
+
);
|
|
119
|
+
})();
|
|
120
|
+
if (conclusion !== -1) this.addConsequence(premises, conclusion);
|
|
121
|
+
this.antecedents.set(getVar(literal), premises);
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
private extractFixedConsequences(start: number, assumptions: IndexSet) {
|
|
125
|
+
const context = this.context;
|
|
126
|
+
context.popToSearchLevel();
|
|
127
|
+
const literals = context.assignedLiterals;
|
|
128
|
+
const size = literals.length;
|
|
129
|
+
for (let index = start; index < size; index++)
|
|
130
|
+
this.extractFixedConsequence(literals[index], assumptions);
|
|
131
|
+
return size;
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
// Z3 takes the literal of the value itself for a Boolean that is not internalized yet.
|
|
135
|
+
private mkDiseq(expr: number, value: number) {
|
|
136
|
+
const context = this.context;
|
|
137
|
+
const manager = context.manager;
|
|
138
|
+
if (manager.sorts[expr] === SORT_BOOL) {
|
|
139
|
+
if (!context.isBInternalized(expr)) context.internalize(expr, false);
|
|
140
|
+
return mkLiteral(context.getBoolVar(expr), value === manager.trueExpr);
|
|
141
|
+
}
|
|
142
|
+
const eq = context.mkEqAtom(expr, value);
|
|
143
|
+
context.internalize(eq, false);
|
|
144
|
+
return mkLiteral(context.getBoolVar(eq), true);
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
private areEqual(key: number, value: number) {
|
|
148
|
+
const keyNode = this.context.getEnode(key);
|
|
149
|
+
const valueNode = this.context.getEnode(value);
|
|
150
|
+
return keyNode !== undefined && valueNode !== undefined && keyNode.root === valueNode.root;
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
private deleteUnfixed() {
|
|
154
|
+
const context = this.context;
|
|
155
|
+
const manager = context.manager;
|
|
156
|
+
const toDelete: number[] = [];
|
|
157
|
+
for (const [key, value] of this.var2val) {
|
|
158
|
+
const keyNode = context.getEnode(key);
|
|
159
|
+
if (manager.sorts[key] === SORT_BOOL) {
|
|
160
|
+
const literal = context.getLiteral(key);
|
|
161
|
+
const assignment = context.getAssignment(literal);
|
|
162
|
+
if (assignment === L_UNDEF) toDelete.push(key);
|
|
163
|
+
else if (assignment === L_TRUE) {
|
|
164
|
+
if (value === manager.falseExpr) toDelete.push(key);
|
|
165
|
+
else context.forcePhase(negate(literal));
|
|
166
|
+
} else if (value === manager.trueExpr) toDelete.push(key);
|
|
167
|
+
else context.forcePhase(literal);
|
|
168
|
+
} else if (this.areEqual(key, value)) continue;
|
|
169
|
+
else if (keyNode !== undefined && manager.areDistinct(value, keyNode.root.owner))
|
|
170
|
+
toDelete.push(key);
|
|
171
|
+
else if (context.getAssignment(this.mkDiseq(key, value)) === L_TRUE) toDelete.push(key);
|
|
172
|
+
}
|
|
173
|
+
for (const key of toDelete) this.var2val.delete(key);
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
// The clause short-circuits the congruence justifications in the next rounds.
|
|
177
|
+
private extractFixedEqs() {
|
|
178
|
+
const context = this.context;
|
|
179
|
+
const manager = context.manager;
|
|
180
|
+
const toDelete: number[] = [];
|
|
181
|
+
for (const [key, value] of this.var2val) {
|
|
182
|
+
if (manager.sorts[key] === SORT_BOOL || !this.areEqual(key, value)) continue;
|
|
183
|
+
const literals = context.conflictResolution.eqToLiterals(
|
|
184
|
+
context.getEnode(value) as Enode,
|
|
185
|
+
context.getEnode(key) as Enode,
|
|
186
|
+
);
|
|
187
|
+
const premises = createIndexSet();
|
|
188
|
+
for (const literal of literals) {
|
|
189
|
+
const set = this.antecedents.get(getVar(literal));
|
|
190
|
+
if (set !== undefined) addAll(premises, set);
|
|
191
|
+
}
|
|
192
|
+
this.addConsequence(premises, manager.mkEq(this.var2orig.get(key) as number, value));
|
|
193
|
+
toDelete.push(key);
|
|
194
|
+
const clause = literals.map(negate);
|
|
195
|
+
clause.push(negate(this.mkDiseq(key, value)));
|
|
196
|
+
context.mkClause(clause, null, CLS_AUX);
|
|
197
|
+
}
|
|
198
|
+
for (const key of toDelete) this.var2val.delete(key);
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
run(assumptions0: readonly number[], vars0: readonly number[]) {
|
|
202
|
+
const kernel = this.kernel;
|
|
203
|
+
const context = this.context;
|
|
204
|
+
const manager = context.manager;
|
|
205
|
+
for (const assumption of assumptions0)
|
|
206
|
+
if (manager.sorts[assumption] !== SORT_BOOL)
|
|
207
|
+
throw new SmtUnsupportedError("a get-consequences assumption that is not Boolean");
|
|
208
|
+
this.antecedents.set(getVar(context.trueLiteral), createIndexSet());
|
|
209
|
+
context.popToBaseLevel();
|
|
210
|
+
const trail = new RefVector(manager);
|
|
211
|
+
const vars: number[] = [];
|
|
212
|
+
const assumptions: number[] = [];
|
|
213
|
+
const assumptionSet = createIndexSet();
|
|
214
|
+
const level = context.scopeLevel;
|
|
215
|
+
let isPushed = false;
|
|
216
|
+
const define = (expr: number, prefix: string) => {
|
|
217
|
+
if (manager.isUninterpretedConst(expr)) return expr;
|
|
218
|
+
if (!isPushed) kernel.push();
|
|
219
|
+
isPushed = true;
|
|
220
|
+
const fresh = manager.mkFreshConst(prefix, manager.sorts[expr]);
|
|
221
|
+
trail.push(fresh);
|
|
222
|
+
kernel.assertExpr(manager.mkEq(fresh, expr));
|
|
223
|
+
return fresh;
|
|
224
|
+
};
|
|
225
|
+
try {
|
|
226
|
+
for (const expr of vars0) {
|
|
227
|
+
const variable = define(expr, "v");
|
|
228
|
+
vars.push(variable);
|
|
229
|
+
this.var2orig.set(variable, expr);
|
|
230
|
+
}
|
|
231
|
+
for (const assumption of assumptions0) {
|
|
232
|
+
const constant = define(assumption, "a");
|
|
233
|
+
assumptions.push(constant);
|
|
234
|
+
if (!context.isEInternalized(constant)) context.internalize(constant, false);
|
|
235
|
+
const boolVar = getVar(context.getLiteral(constant));
|
|
236
|
+
assumptionSet.add(boolVar);
|
|
237
|
+
this.assumption2orig.set(boolVar, assumption);
|
|
238
|
+
}
|
|
239
|
+
const result = kernel.check(assumptions);
|
|
240
|
+
if (result !== L_TRUE) return result;
|
|
241
|
+
if (context.qmanager.hasQuantifiers()) return L_UNDEF;
|
|
242
|
+
const model = context.getModel();
|
|
243
|
+
for (const variable of vars) {
|
|
244
|
+
const value = model.eval(variable, false);
|
|
245
|
+
trail.pushOwned(value);
|
|
246
|
+
if (manager.isValue(value)) this.var2val.set(variable, value);
|
|
247
|
+
}
|
|
248
|
+
this.extractFixedConsequences(0, assumptionSet);
|
|
249
|
+
context.popToBaseLevel();
|
|
250
|
+
kernel.initAssumptions(assumptions);
|
|
251
|
+
let numUnits = 0;
|
|
252
|
+
while (this.var2val.size > 0) {
|
|
253
|
+
let numVars = 0;
|
|
254
|
+
for (const [variable, value] of this.var2val) {
|
|
255
|
+
if (numVars >= CHUNK_SIZE) break;
|
|
256
|
+
if (context.checkCanceled()) return L_UNDEF;
|
|
257
|
+
const literal = this.mkDiseq(variable, value);
|
|
258
|
+
if (context.getAssignment(literal) !== L_UNDEF) continue;
|
|
259
|
+
context.markLiteralAsRelevant(literal);
|
|
260
|
+
numVars++;
|
|
261
|
+
context.pushScope();
|
|
262
|
+
context.assign(literal, "axiom", true);
|
|
263
|
+
while (context.canPropagate()) {
|
|
264
|
+
if (context.propagate()) break;
|
|
265
|
+
if (context.resolveConflict()) continue;
|
|
266
|
+
if (context.isInconsistent()) return L_UNDEF;
|
|
267
|
+
}
|
|
268
|
+
}
|
|
269
|
+
let status = context.boundedSearch();
|
|
270
|
+
while (status === L_UNDEF && !context.hasSearchFailure()) {
|
|
271
|
+
context.incLimits();
|
|
272
|
+
status = context.boundedSearch();
|
|
273
|
+
}
|
|
274
|
+
if (status !== L_TRUE && context.hasSearchFailure()) return status;
|
|
275
|
+
if (status === L_FALSE) context.resetConflict();
|
|
276
|
+
if (status === L_TRUE) this.deleteUnfixed();
|
|
277
|
+
numUnits = this.extractFixedConsequences(numUnits, assumptionSet);
|
|
278
|
+
this.extractFixedEqs();
|
|
279
|
+
}
|
|
280
|
+
return L_TRUE;
|
|
281
|
+
} finally {
|
|
282
|
+
if (context.scopeLevel > level + (isPushed ? 1 : 0))
|
|
283
|
+
context.popScope(context.scopeLevel - level - (isPushed ? 1 : 0));
|
|
284
|
+
if (isPushed) kernel.pop(1);
|
|
285
|
+
trail.reset();
|
|
286
|
+
}
|
|
287
|
+
}
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
export const getConsequences = (
|
|
291
|
+
kernel: SmtKernel,
|
|
292
|
+
assumptions: readonly number[],
|
|
293
|
+
vars: readonly number[],
|
|
294
|
+
) => {
|
|
295
|
+
const finder = new ConsequenceFinder(kernel);
|
|
296
|
+
return { result: finder.run(assumptions, vars), consequences: finder.consequences };
|
|
297
|
+
};
|