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
|
@@ -1,6 +1,7 @@
|
|
|
1
|
-
//
|
|
2
|
-
//
|
|
3
|
-
|
|
1
|
+
// Of Z3's nlsat parameters only seed and factor are ported, so nlsat_simplify and the bounds of
|
|
2
|
+
// eliminated variables are not. The search counts its steps against the resource limit, but not the
|
|
3
|
+
// memory, which Z3 also bounds by max_memory.
|
|
4
|
+
import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
|
|
4
5
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
5
6
|
import { type Dependency, linearize, mkJoin, mkLeaf } from "../lp/dependency";
|
|
6
7
|
import { RandomGen } from "../random-gen";
|
|
@@ -12,7 +13,8 @@ import { Evaluator } from "./evaluator";
|
|
|
12
13
|
import { Explain } from "./explain";
|
|
13
14
|
import type { IntervalSet } from "./interval-set";
|
|
14
15
|
import { NULL_VAR, type Polynomial, PolynomialCache, PolynomialManager } from "./polynomial";
|
|
15
|
-
import {
|
|
16
|
+
import { NlsatTranscendentals } from "./transcendentals";
|
|
17
|
+
import { type Clause, type IneqAtom, type IneqKind, isIneqAtom, type RootKind } from "./types";
|
|
16
18
|
|
|
17
19
|
const NULL_BOOL_VAR = Infinity;
|
|
18
20
|
|
|
@@ -41,7 +43,7 @@ export class NlsatSolver {
|
|
|
41
43
|
private justifications: (Justification | null)[] = [];
|
|
42
44
|
private bwatches: Clause[][] = [];
|
|
43
45
|
private isDead: boolean[] = [];
|
|
44
|
-
|
|
46
|
+
readonly atoms = new AtomTable(this.pm, this.cache, {
|
|
45
47
|
onMk: (boolVar) => {
|
|
46
48
|
this.bvalues[boolVar] = L_UNDEF;
|
|
47
49
|
this.levels[boolVar] = Infinity;
|
|
@@ -66,12 +68,16 @@ export class NlsatSolver {
|
|
|
66
68
|
private var2eq: (IneqAtom | null)[] = [];
|
|
67
69
|
private perm: number[] = [];
|
|
68
70
|
private invPerm: number[] = [];
|
|
69
|
-
|
|
71
|
+
readonly explain = new Explain(this.pm, this.am, this.cache, {
|
|
70
72
|
atoms: this.atoms,
|
|
71
73
|
sample: this.assignment,
|
|
72
74
|
getValue: (literal) => this.value(literal),
|
|
73
75
|
var2eq: this.var2eq,
|
|
76
|
+
getNumVars: () => this.isInt.length,
|
|
77
|
+
reorder: (permutation) => this.reorder(permutation),
|
|
78
|
+
restoreOrder: () => this.restoreOrder(),
|
|
74
79
|
});
|
|
80
|
+
readonly transcendentals = new NlsatTranscendentals(this);
|
|
75
81
|
private bk = 0;
|
|
76
82
|
private xk = NULL_VAR;
|
|
77
83
|
private scopeLevel = 0;
|
|
@@ -83,7 +89,10 @@ export class NlsatSolver {
|
|
|
83
89
|
private lemmaAssumptions: Dependency = null;
|
|
84
90
|
private randomSeed = 0;
|
|
85
91
|
private isReordered = false;
|
|
92
|
+
private maxVar = NULL_VAR;
|
|
93
|
+
private nextTag = 0;
|
|
86
94
|
maxConflicts = Infinity;
|
|
95
|
+
isReordering = true;
|
|
87
96
|
readonly stats = {
|
|
88
97
|
conflicts: 0,
|
|
89
98
|
restarts: 0,
|
|
@@ -93,19 +102,18 @@ export class NlsatSolver {
|
|
|
93
102
|
irrationalAssignments: 0,
|
|
94
103
|
};
|
|
95
104
|
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
constructor(
|
|
99
|
-
private limit: ResourceLimit | null = null,
|
|
100
|
-
private budget = Infinity,
|
|
101
|
-
) {
|
|
105
|
+
constructor(private limit: ResourceLimit | null = null) {
|
|
102
106
|
this.mkClause([TRUE_LITERAL], false, null);
|
|
103
107
|
}
|
|
104
108
|
|
|
109
|
+
updtParams(seed: number, isFactoring: boolean) {
|
|
110
|
+
this.randomSeed = seed;
|
|
111
|
+
this.ism.setSeed(seed);
|
|
112
|
+
this.explain.isFactoring = isFactoring;
|
|
113
|
+
}
|
|
114
|
+
|
|
105
115
|
private checkpoint() {
|
|
106
|
-
this.
|
|
107
|
-
if ((this.limit !== null && !this.limit.inc()) || this.steps > this.budget)
|
|
108
|
-
throw new SmtCanceledError();
|
|
116
|
+
if (this.limit !== null && !this.limit.inc()) throw new SmtCanceledError();
|
|
109
117
|
}
|
|
110
118
|
|
|
111
119
|
mkVar(isInt: boolean) {
|
|
@@ -127,6 +135,57 @@ export class NlsatSolver {
|
|
|
127
135
|
return this.atoms.getAtom(literal);
|
|
128
136
|
}
|
|
129
137
|
|
|
138
|
+
mkBoolVar() {
|
|
139
|
+
return this.atoms.mkBoolVar();
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
mkRootAtom(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
|
|
143
|
+
return this.atoms.mkRootAtom(kind, variable, index, polynomial);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
getBoolValue(boolVar: number) {
|
|
147
|
+
return this.bvalues[boolVar];
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
vars(literal: number) {
|
|
151
|
+
const atom = this.atoms.getAtom(literal);
|
|
152
|
+
if (atom === null) return [];
|
|
153
|
+
if (isIneqAtom(atom))
|
|
154
|
+
return atom.polynomials.flatMap((polynomial) => this.pm.getVars(polynomial));
|
|
155
|
+
return [...this.pm.getVars(atom.polynomial), atom.maxVar];
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
getRvalues() {
|
|
159
|
+
return this.assignment.map((value) => (value === undefined ? undefined : this.am.copy(value)));
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
setRvalues(values: readonly (Anum | undefined)[]) {
|
|
163
|
+
this.setAssignment(values);
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
getBvalues(boolVars: Iterable<number>) {
|
|
167
|
+
const values: number[] = [];
|
|
168
|
+
for (const boolVar of boolVars) {
|
|
169
|
+
while (values.length <= boolVar) values.push(L_UNDEF);
|
|
170
|
+
if (this.atoms.atoms[boolVar] === null) values[boolVar] = this.bvalues[boolVar];
|
|
171
|
+
}
|
|
172
|
+
return values;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
setBvalues(values: readonly number[]) {
|
|
176
|
+
for (const [boolVar, value] of values.entries())
|
|
177
|
+
if (value !== L_UNDEF) this.bvalues[boolVar] = value;
|
|
178
|
+
}
|
|
179
|
+
|
|
180
|
+
setMaxVar(variable: number) {
|
|
181
|
+
this.maxVar = variable;
|
|
182
|
+
}
|
|
183
|
+
|
|
184
|
+
getMaxVarSup() {
|
|
185
|
+
if (this.maxVar === NULL_VAR || this.assignment[this.maxVar] === undefined) return null;
|
|
186
|
+
return this.ism.queryMaxInComplement(this.infeasible[this.maxVar]);
|
|
187
|
+
}
|
|
188
|
+
|
|
130
189
|
mkExternalClause(literals: readonly number[], assumption: number | null) {
|
|
131
190
|
this.mkClause(literals, false, assumption === null ? null : mkLeaf(assumption));
|
|
132
191
|
}
|
|
@@ -139,17 +198,8 @@ export class NlsatSolver {
|
|
|
139
198
|
return linearize([this.lemmaAssumptions]);
|
|
140
199
|
}
|
|
141
200
|
|
|
142
|
-
private getMaxVar(clause: Clause) {
|
|
143
|
-
let result = NULL_VAR;
|
|
144
|
-
for (const literal of clause.literals) {
|
|
145
|
-
const atom = this.atoms.getAtom(literal);
|
|
146
|
-
if (atom !== null && (result === NULL_VAR || atom.maxVar > result)) result = atom.maxVar;
|
|
147
|
-
}
|
|
148
|
-
return result;
|
|
149
|
-
}
|
|
150
|
-
|
|
151
201
|
private getClauseDegree(clause: Clause) {
|
|
152
|
-
if (this.
|
|
202
|
+
if (this.atoms.getMaxVarOfLiterals(clause.literals) === NULL_VAR) return 0;
|
|
153
203
|
let max = 0;
|
|
154
204
|
for (const literal of clause.literals) {
|
|
155
205
|
const atom = this.atoms.getAtom(literal);
|
|
@@ -191,13 +241,13 @@ export class NlsatSolver {
|
|
|
191
241
|
}
|
|
192
242
|
|
|
193
243
|
private addClauseToWatches(clause: Clause) {
|
|
194
|
-
const variable = this.
|
|
244
|
+
const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
|
|
195
245
|
if (variable !== NULL_VAR) this.watches[variable].push(clause);
|
|
196
246
|
else this.bwatches[Math.max(...clause.literals.map((literal) => literal >> 1))].push(clause);
|
|
197
247
|
}
|
|
198
248
|
|
|
199
249
|
private delClause(clause: Clause) {
|
|
200
|
-
const variable = this.
|
|
250
|
+
const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
|
|
201
251
|
const watches =
|
|
202
252
|
variable !== NULL_VAR
|
|
203
253
|
? this.watches[variable]
|
|
@@ -275,7 +325,7 @@ export class NlsatSolver {
|
|
|
275
325
|
this.setLiteralToTrue(literal, DECISION);
|
|
276
326
|
}
|
|
277
327
|
|
|
278
|
-
|
|
328
|
+
value(literal: number) {
|
|
279
329
|
const assigned = this.getAssignedValue(literal);
|
|
280
330
|
if (assigned !== L_UNDEF) return assigned;
|
|
281
331
|
const atom = this.atoms.getAtom(literal);
|
|
@@ -347,7 +397,9 @@ export class NlsatSolver {
|
|
|
347
397
|
this.checkpoint();
|
|
348
398
|
if (this.value(literal) === L_FALSE) continue;
|
|
349
399
|
if (this.value(literal) === L_TRUE) return true;
|
|
350
|
-
const atom = this.atoms.getAtom(literal)
|
|
400
|
+
const atom = this.atoms.getAtom(literal);
|
|
401
|
+
if (atom === null)
|
|
402
|
+
throw new SmtInvariantError("a literal of an arithmetic clause has no atom");
|
|
351
403
|
const set = this.evaluator.infeasibleIntervals(atom, (literal & 1) === 1, clause);
|
|
352
404
|
if (set === null) {
|
|
353
405
|
this.propagate(literal, null);
|
|
@@ -410,7 +462,10 @@ export class NlsatSolver {
|
|
|
410
462
|
}
|
|
411
463
|
|
|
412
464
|
private selectWitness() {
|
|
413
|
-
const
|
|
465
|
+
const set = this.infeasible[this.xk];
|
|
466
|
+
const witness =
|
|
467
|
+
(this.xk === this.maxVar ? this.ism.pickMaxInComplement(set) : null) ??
|
|
468
|
+
this.ism.pickInComplement(set, true);
|
|
414
469
|
if (!this.am.isRational(witness)) this.stats.irrationalAssignments++;
|
|
415
470
|
this.assignment[this.xk] = witness;
|
|
416
471
|
}
|
|
@@ -507,7 +562,11 @@ export class NlsatSolver {
|
|
|
507
562
|
}
|
|
508
563
|
bounds.push([variable, lower]);
|
|
509
564
|
}
|
|
510
|
-
if (bounds.length === 0)
|
|
565
|
+
if (bounds.length === 0) {
|
|
566
|
+
if (this.transcendentals.isEmpty || !this.transcendentals.refine()) return result;
|
|
567
|
+
this.initSearch();
|
|
568
|
+
continue;
|
|
569
|
+
}
|
|
511
570
|
this.initSearch();
|
|
512
571
|
for (const bound of bounds) {
|
|
513
572
|
this.lemma.reset();
|
|
@@ -541,6 +600,32 @@ export class NlsatSolver {
|
|
|
541
600
|
return result;
|
|
542
601
|
}
|
|
543
602
|
|
|
603
|
+
// Keeps in assumptions the ones in the core when unsatisfiable, and none otherwise.
|
|
604
|
+
checkAssumptions(assumptions: number[]) {
|
|
605
|
+
const tags = assumptions.map((literal) => {
|
|
606
|
+
const tag = --this.nextTag;
|
|
607
|
+
this.mkExternalClause([literal], tag);
|
|
608
|
+
return tag;
|
|
609
|
+
});
|
|
610
|
+
const result = this.check();
|
|
611
|
+
const core: number[] = [];
|
|
612
|
+
if (result === L_FALSE)
|
|
613
|
+
for (const tag of this.getCore()) {
|
|
614
|
+
const index = tags.indexOf(tag);
|
|
615
|
+
if (index !== -1) core.push(assumptions[index]);
|
|
616
|
+
}
|
|
617
|
+
const isKept = (clause: Clause) => {
|
|
618
|
+
const isFound = linearize([clause.assumptions]).some((tag) => tags.includes(tag));
|
|
619
|
+
if (isFound) this.delClause(clause);
|
|
620
|
+
return !isFound;
|
|
621
|
+
};
|
|
622
|
+
this.clauses = this.clauses.filter(isKept);
|
|
623
|
+
this.learned = this.learned.filter(isKept);
|
|
624
|
+
assumptions.length = 0;
|
|
625
|
+
assumptions.push(...core);
|
|
626
|
+
return result;
|
|
627
|
+
}
|
|
628
|
+
|
|
544
629
|
private isFullDimensional(literal: number) {
|
|
545
630
|
const atom = this.atoms.getAtom(literal);
|
|
546
631
|
if (atom === null) return true;
|
|
@@ -566,6 +651,110 @@ export class NlsatSolver {
|
|
|
566
651
|
for (let index = 0; index < sorted.length; index++) clauses[index] = sorted[index];
|
|
567
652
|
}
|
|
568
653
|
|
|
654
|
+
private projectModel(cube: ScopedLiterals) {
|
|
655
|
+
const seen = new Set<number>();
|
|
656
|
+
for (const clause of this.clauses) {
|
|
657
|
+
this.checkpoint();
|
|
658
|
+
const witness = clause.literals.find((literal) => this.value(literal) === L_TRUE);
|
|
659
|
+
if (witness === undefined) throw new SmtInvariantError("nlsat's model falsifies a clause");
|
|
660
|
+
if (this.atoms.getAtom(witness) === null || seen.has(witness >> 1)) continue;
|
|
661
|
+
seen.add(witness >> 1);
|
|
662
|
+
cube.push(witness);
|
|
663
|
+
}
|
|
664
|
+
// Strict sector bounds keep every point of the projection extensible.
|
|
665
|
+
this.explain.isFullDimensional = false;
|
|
666
|
+
const projected = new ScopedLiterals(this.atoms);
|
|
667
|
+
try {
|
|
668
|
+
for (let variable = this.isInt.length - 1; variable >= 1 && cube.size > 0; variable--) {
|
|
669
|
+
this.checkpoint();
|
|
670
|
+
projected.reset();
|
|
671
|
+
this.explain.projectVariable(variable, cube.literals, projected);
|
|
672
|
+
[cube.literals, projected.literals] = [projected.literals, cube.literals];
|
|
673
|
+
}
|
|
674
|
+
} finally {
|
|
675
|
+
projected.reset();
|
|
676
|
+
}
|
|
677
|
+
}
|
|
678
|
+
|
|
679
|
+
private getCubeSup(cube: ScopedLiterals) {
|
|
680
|
+
let infeasible: IntervalSet | null = null;
|
|
681
|
+
for (const literal of cube.literals) {
|
|
682
|
+
const excluded = this.evaluator.infeasibleIntervals(
|
|
683
|
+
this.atoms.getAtom(literal)!,
|
|
684
|
+
(literal & 1) === 1,
|
|
685
|
+
null,
|
|
686
|
+
);
|
|
687
|
+
infeasible = this.ism.mkUnion(infeasible, excluded);
|
|
688
|
+
}
|
|
689
|
+
if (this.ism.isFull(infeasible))
|
|
690
|
+
throw new SmtInvariantError("nlsat's model projection is inconsistent");
|
|
691
|
+
return this.ism.queryMaxInComplement(infeasible);
|
|
692
|
+
}
|
|
693
|
+
|
|
694
|
+
checkLimit(variable: number, bound: Anum | null) {
|
|
695
|
+
if (variable !== 0 || this.invPerm[0] !== 0)
|
|
696
|
+
throw new SmtInvariantError("nlsat checks the limit of the first variable");
|
|
697
|
+
if (this.isInt.some(Boolean)) return L_UNDEF;
|
|
698
|
+
const limit = bound === null ? null : this.am.copy(bound);
|
|
699
|
+
const savedMaxVar = this.maxVar;
|
|
700
|
+
this.maxVar = variable;
|
|
701
|
+
const tag = --this.nextTag;
|
|
702
|
+
try {
|
|
703
|
+
if (limit !== null) {
|
|
704
|
+
const isRational = this.am.isRational(limit);
|
|
705
|
+
const polynomial = this.pm.fromCoeffs(this.am.getPolynomial(limit), variable);
|
|
706
|
+
const upper = isRational
|
|
707
|
+
? this.mkIneqLiteral("LT", [polynomial], [false])
|
|
708
|
+
: 2 * this.mkRootAtom("ROOT_LT", variable, this.am.getRootIndex(limit), polynomial);
|
|
709
|
+
this.mkExternalClause([upper], tag);
|
|
710
|
+
}
|
|
711
|
+
while (true) {
|
|
712
|
+
this.checkpoint();
|
|
713
|
+
const status = this.check();
|
|
714
|
+
if (status !== L_TRUE) return status;
|
|
715
|
+
const cube = new ScopedLiterals(this.atoms);
|
|
716
|
+
try {
|
|
717
|
+
this.projectModel(cube);
|
|
718
|
+
const sup = this.getCubeSup(cube);
|
|
719
|
+
if (
|
|
720
|
+
limit === null
|
|
721
|
+
? sup === null
|
|
722
|
+
: sup !== null && !sup.isAttained && this.am.compare(sup.sup, limit) === 0
|
|
723
|
+
)
|
|
724
|
+
return L_TRUE;
|
|
725
|
+
this.mkExternalClause(
|
|
726
|
+
cube.literals.map((literal) => literal ^ 1),
|
|
727
|
+
tag,
|
|
728
|
+
);
|
|
729
|
+
} finally {
|
|
730
|
+
cube.reset();
|
|
731
|
+
}
|
|
732
|
+
}
|
|
733
|
+
} finally {
|
|
734
|
+
this.retract(tag);
|
|
735
|
+
this.maxVar = savedMaxVar;
|
|
736
|
+
}
|
|
737
|
+
}
|
|
738
|
+
|
|
739
|
+
retract(tag: number, maxLemmas = Infinity) {
|
|
740
|
+
this.initSearch();
|
|
741
|
+
this.explain.reset();
|
|
742
|
+
this.lemma.reset();
|
|
743
|
+
this.lazyClause.reset();
|
|
744
|
+
this.lemmaAssumptions = null;
|
|
745
|
+
const isKept = (clause: Clause) => {
|
|
746
|
+
const isFound = linearize([clause.assumptions]).includes(tag);
|
|
747
|
+
if (isFound) this.delClause(clause);
|
|
748
|
+
return !isFound;
|
|
749
|
+
};
|
|
750
|
+
this.clauses = this.clauses.filter(isKept);
|
|
751
|
+
this.learned = this.learned.filter(isKept);
|
|
752
|
+
if (this.learned.length <= maxLemmas) return;
|
|
753
|
+
this.learned.sort((first, second) => first.literals.length - second.literals.length);
|
|
754
|
+
for (const clause of this.learned.splice(maxLemmas).reverse()) this.delClause(clause);
|
|
755
|
+
}
|
|
756
|
+
|
|
757
|
+
// Like Z3, only a falsified clause restores the assignment.
|
|
569
758
|
checkAssignment(values: readonly (Anum | undefined)[]) {
|
|
570
759
|
const saved = this.assignment.map((value) =>
|
|
571
760
|
value === undefined ? undefined : this.am.copy(value),
|
|
@@ -720,12 +909,7 @@ export class NlsatSolver {
|
|
|
720
909
|
this.resetMarks();
|
|
721
910
|
const literals = this.lemma.literals;
|
|
722
911
|
if (!isDecision) {
|
|
723
|
-
|
|
724
|
-
for (const literal of literals) {
|
|
725
|
-
const variable = this.atoms.getMaxVar(literal);
|
|
726
|
-
if (variable !== NULL_VAR && (maxVar === NULL_VAR || variable > maxVar)) maxVar = variable;
|
|
727
|
-
}
|
|
728
|
-
this.undoUntilStage(maxVar);
|
|
912
|
+
this.undoUntilStage(this.atoms.getMaxVarOfLiterals(literals));
|
|
729
913
|
return this.mkClause(literals, true, this.lemmaAssumptions);
|
|
730
914
|
}
|
|
731
915
|
if (literals.every((literal) => this.atoms.getAtom(literal) === null)) {
|
|
@@ -750,11 +934,18 @@ export class NlsatSolver {
|
|
|
750
934
|
return level === -1 ? this.scopeLevel - 1 : level;
|
|
751
935
|
}
|
|
752
936
|
|
|
937
|
+
private isRootLiteral(literal: number) {
|
|
938
|
+
const atom = this.atoms.getAtom(literal);
|
|
939
|
+
return atom !== null && !isIneqAtom(atom);
|
|
940
|
+
}
|
|
941
|
+
|
|
753
942
|
private canReorder() {
|
|
754
|
-
return
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
)
|
|
943
|
+
return (
|
|
944
|
+
this.isReordering &&
|
|
945
|
+
this.maxVar === NULL_VAR &&
|
|
946
|
+
[...this.learned, ...this.clauses].every((clause) =>
|
|
947
|
+
clause.literals.every((literal) => !this.isRootLiteral(literal)),
|
|
948
|
+
)
|
|
758
949
|
);
|
|
759
950
|
}
|
|
760
951
|
|
|
@@ -800,11 +991,10 @@ export class NlsatSolver {
|
|
|
800
991
|
this.reorder(permutation);
|
|
801
992
|
}
|
|
802
993
|
|
|
803
|
-
|
|
994
|
+
reorder(permutation: readonly number[]) {
|
|
804
995
|
let kept = 0;
|
|
805
996
|
for (const clause of this.learned) {
|
|
806
|
-
if (clause.literals.some((literal) => this.
|
|
807
|
-
this.delClause(clause);
|
|
997
|
+
if (clause.literals.some((literal) => this.isRootLiteral(literal))) this.delClause(clause);
|
|
808
998
|
else this.learned[kept++] = clause;
|
|
809
999
|
}
|
|
810
1000
|
this.learned.length = kept;
|
|
@@ -828,6 +1018,7 @@ export class NlsatSolver {
|
|
|
828
1018
|
else polynomials.add(atom.polynomial);
|
|
829
1019
|
}
|
|
830
1020
|
this.pm.rename(permutation, polynomials);
|
|
1021
|
+
this.transcendentals.rename(permutation);
|
|
831
1022
|
this.atoms.reinitCache();
|
|
832
1023
|
this.setAssignment(assignment);
|
|
833
1024
|
this.reattachArithClauses(this.clauses);
|
|
@@ -844,7 +1035,7 @@ export class NlsatSolver {
|
|
|
844
1035
|
|
|
845
1036
|
private reattachArithClauses(clauses: readonly Clause[]) {
|
|
846
1037
|
for (const clause of clauses) {
|
|
847
|
-
const variable = this.
|
|
1038
|
+
const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
|
|
848
1039
|
if (variable !== NULL_VAR) this.watches[variable].push(clause);
|
|
849
1040
|
}
|
|
850
1041
|
}
|