tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- 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 -16
- 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 +615 -53
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- 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 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- 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 +39 -30
- 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 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- 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 -23
- 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 +907 -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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +176 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- 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 +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 -21
- 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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +21 -26
- 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 +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- 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 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- 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 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +1301 -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 +3140 -365
- 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 +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- 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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- 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 +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- 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 +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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,22 +1,9 @@
|
|
|
1
|
-
|
|
2
|
-
// src/math/lp/nla_explanations.cpp, src/math/lp/factorization.cpp,
|
|
3
|
-
// src/math/lp/factorization_factory_imp.cpp, src/math/lp/nla_solver.cpp), MIT license, see
|
|
4
|
-
// z3-license.txt. The nonlinear core over lar_solver: the monomials whose values disagree with the
|
|
5
|
-
// products of their factors' values are refined by lemmas, which the passes below generate, and
|
|
6
|
-
// by literals to split on, and by nlsat's search on what they leave open, see nra-solver.ts.
|
|
1
|
+
import { SmtInvariantError } from "../../../../errors";
|
|
7
2
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
8
|
-
import
|
|
3
|
+
import { ResourceLimit } from "../rlimit";
|
|
9
4
|
import { Rational } from "../rational";
|
|
10
5
|
import { IndexedUintSet } from "./containers";
|
|
11
|
-
import {
|
|
12
|
-
COLUMN_BOXED,
|
|
13
|
-
COLUMN_FIXED,
|
|
14
|
-
COLUMN_FREE,
|
|
15
|
-
COLUMN_LOWER,
|
|
16
|
-
COLUMN_UPPER,
|
|
17
|
-
LP_FEASIBLE,
|
|
18
|
-
LP_OPTIMAL,
|
|
19
|
-
} from "./core-solver";
|
|
6
|
+
import { COLUMN_BOXED, COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
|
|
20
7
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
21
8
|
import type { Dependency } from "./dependency";
|
|
22
9
|
import { Explanation } from "./explanation";
|
|
@@ -26,7 +13,7 @@ import { Impq } from "./numeric-pair";
|
|
|
26
13
|
import { Backoff, SqueezeSchedule } from "./nla-backoff";
|
|
27
14
|
import { Basics } from "./nla-basics";
|
|
28
15
|
import { Divisions } from "./nla-divisions";
|
|
29
|
-
import { Emonics, Monic } from "./nla-emonics";
|
|
16
|
+
import { Emonics, type Monic } from "./nla-emonics";
|
|
30
17
|
import { type Factor, type Factorization, mkFactor, mkMonFactorization } from "./nla-factorization";
|
|
31
18
|
import { Grobner } from "./nla-grobner";
|
|
32
19
|
import { Horner } from "./nla-horner";
|
|
@@ -35,6 +22,7 @@ import { MonomialBounds } from "./nla-monomial-bounds";
|
|
|
35
22
|
import { Monotone } from "./nla-monotone";
|
|
36
23
|
import { Order } from "./nla-order";
|
|
37
24
|
import { Patcher } from "./nla-patcher";
|
|
25
|
+
import { checkPower } from "./nla-powers";
|
|
38
26
|
import { Tangents } from "./nla-tangents";
|
|
39
27
|
import { NlaThrottle } from "./nla-throttle";
|
|
40
28
|
import {
|
|
@@ -45,6 +33,7 @@ import {
|
|
|
45
33
|
mkIneq,
|
|
46
34
|
negateKind,
|
|
47
35
|
} from "./nla-types";
|
|
36
|
+
import { NlaTranscendentals } from "./nla-transcendentals";
|
|
48
37
|
import { NraSolver } from "./nra-solver";
|
|
49
38
|
import { getSignedVarVar, isSignedVarNegated, mkSignedVar, VarEqs } from "./nla-var-eqs";
|
|
50
39
|
|
|
@@ -56,8 +45,6 @@ interface NlaParams {
|
|
|
56
45
|
hornerFrequency: number;
|
|
57
46
|
hornerRowLengthLimit: number;
|
|
58
47
|
grobner: boolean;
|
|
59
|
-
grobnerRowLengthLimit: number;
|
|
60
|
-
grobnerFrequency: number;
|
|
61
48
|
grobnerEqsGrowth: number;
|
|
62
49
|
grobnerExprSizeGrowth: number;
|
|
63
50
|
grobnerExprDegreeGrowth: number;
|
|
@@ -79,29 +66,19 @@ interface NlaParams {
|
|
|
79
66
|
orderBinomialSign: boolean;
|
|
80
67
|
tangents: boolean;
|
|
81
68
|
tangentsBoxCorners: boolean;
|
|
82
|
-
expensivePatching: boolean;
|
|
83
|
-
expp: boolean;
|
|
84
|
-
monomialSandwich: boolean;
|
|
85
|
-
monomialSandwichMaxFanout: number;
|
|
86
|
-
monomialBinomialSign: boolean;
|
|
87
69
|
reducePseudoLinear: boolean;
|
|
88
70
|
delay: number;
|
|
89
|
-
propagateLinearMonomials: boolean;
|
|
90
71
|
linearizeViolatedMonomials: boolean;
|
|
91
72
|
optimizeBounds: boolean;
|
|
92
73
|
optimizeBoundsLpMaxVars: number;
|
|
93
|
-
crossNested: boolean;
|
|
94
74
|
}
|
|
95
75
|
|
|
96
|
-
// The arith.nl parameters of Z3's defaults that nla reads.
|
|
97
76
|
export const NLA_PARAMS: Readonly<NlaParams> = {
|
|
98
77
|
horner: true,
|
|
99
78
|
hornerSubsFixed: 2,
|
|
100
79
|
hornerFrequency: 4,
|
|
101
80
|
hornerRowLengthLimit: 10,
|
|
102
81
|
grobner: true,
|
|
103
|
-
grobnerRowLengthLimit: 10,
|
|
104
|
-
grobnerFrequency: 4,
|
|
105
82
|
grobnerEqsGrowth: 10,
|
|
106
83
|
grobnerExprSizeGrowth: 2,
|
|
107
84
|
grobnerExprDegreeGrowth: 2,
|
|
@@ -123,18 +100,11 @@ export const NLA_PARAMS: Readonly<NlaParams> = {
|
|
|
123
100
|
orderBinomialSign: true,
|
|
124
101
|
tangents: true,
|
|
125
102
|
tangentsBoxCorners: false,
|
|
126
|
-
expensivePatching: false,
|
|
127
|
-
expp: false,
|
|
128
|
-
monomialSandwich: false,
|
|
129
|
-
monomialSandwichMaxFanout: 0,
|
|
130
|
-
monomialBinomialSign: false,
|
|
131
103
|
reducePseudoLinear: true,
|
|
132
104
|
delay: 10,
|
|
133
|
-
propagateLinearMonomials: true,
|
|
134
105
|
linearizeViolatedMonomials: true,
|
|
135
106
|
optimizeBounds: true,
|
|
136
107
|
optimizeBoundsLpMaxVars: 120,
|
|
137
|
-
crossNested: true,
|
|
138
108
|
};
|
|
139
109
|
|
|
140
110
|
interface NlaEquality {
|
|
@@ -164,23 +134,27 @@ export class NlaCore {
|
|
|
164
134
|
isCheckFeasible = false;
|
|
165
135
|
isNlaSatisfied = false;
|
|
166
136
|
readonly throttle: NlaThrottle;
|
|
167
|
-
readonly tangents: Tangents;
|
|
168
|
-
readonly basics: Basics;
|
|
169
|
-
readonly order: Order;
|
|
170
|
-
readonly monotone: Monotone;
|
|
137
|
+
private readonly tangents: Tangents;
|
|
138
|
+
private readonly basics: Basics;
|
|
139
|
+
private readonly order: Order;
|
|
140
|
+
private readonly monotone: Monotone;
|
|
171
141
|
readonly divisions: Divisions;
|
|
172
142
|
readonly intervals: Intervals;
|
|
173
|
-
readonly monomialBounds: MonomialBounds;
|
|
174
|
-
readonly patcher: Patcher;
|
|
175
|
-
readonly horner: Horner;
|
|
143
|
+
private readonly monomialBounds: MonomialBounds;
|
|
144
|
+
private readonly patcher: Patcher;
|
|
145
|
+
private readonly horner: Horner;
|
|
176
146
|
readonly grobner: Grobner;
|
|
147
|
+
readonly nraLimit = new ResourceLimit(Infinity);
|
|
177
148
|
readonly nra = new NraSolver(this);
|
|
178
|
-
|
|
149
|
+
readonly transcendentals = new NlaTranscendentals(this);
|
|
179
150
|
isUsingNraModel = false;
|
|
180
151
|
private nlsatBackoff: Backoff;
|
|
181
152
|
private checkAssignmentFailCount = 0;
|
|
182
153
|
private squeezeSchedule = new SqueezeSchedule();
|
|
183
154
|
isRelevant: (lpVar: number) => boolean = () => true;
|
|
155
|
+
addMulDefHook: (vars: number[]) => number = () => {
|
|
156
|
+
throw new SmtInvariantError("nla has no hook to define a product");
|
|
157
|
+
};
|
|
184
158
|
|
|
185
159
|
constructor(
|
|
186
160
|
readonly lra: LarSolver,
|
|
@@ -207,16 +181,10 @@ export class NlaCore {
|
|
|
207
181
|
};
|
|
208
182
|
}
|
|
209
183
|
|
|
210
|
-
get settings() {
|
|
211
|
-
return this.lra.settings;
|
|
212
|
-
}
|
|
213
|
-
|
|
214
184
|
get stats() {
|
|
215
185
|
return this.lra.settings.stats;
|
|
216
186
|
}
|
|
217
187
|
|
|
218
|
-
// Values and bounds.
|
|
219
|
-
|
|
220
188
|
val(lpVar: number) {
|
|
221
189
|
return this.lra.getValue(lpVar).x;
|
|
222
190
|
}
|
|
@@ -236,7 +204,7 @@ export class NlaCore {
|
|
|
236
204
|
return factor.isNegated ? value.neg() : value;
|
|
237
205
|
}
|
|
238
206
|
|
|
239
|
-
compareHolds(left: Rational, cmp: number, right: Rational) {
|
|
207
|
+
private compareHolds(left: Rational, cmp: number, right: Rational) {
|
|
240
208
|
const comparison = left.compare(right);
|
|
241
209
|
switch (cmp) {
|
|
242
210
|
case KIND_LE:
|
|
@@ -254,7 +222,7 @@ export class NlaCore {
|
|
|
254
222
|
}
|
|
255
223
|
}
|
|
256
224
|
|
|
257
|
-
value(term: LarTerm) {
|
|
225
|
+
private value(term: LarTerm) {
|
|
258
226
|
let result = Rational.zero;
|
|
259
227
|
for (const entry of term.coeffs) result = result.add(entry[1].mul(this.val(entry[0])));
|
|
260
228
|
return result;
|
|
@@ -301,10 +269,6 @@ export class NlaCore {
|
|
|
301
269
|
return this.lra.isFixed(lpVar);
|
|
302
270
|
}
|
|
303
271
|
|
|
304
|
-
varIsFree(lpVar: number) {
|
|
305
|
-
return this.lra.isFree(lpVar);
|
|
306
|
-
}
|
|
307
|
-
|
|
308
272
|
varHasPositiveLowerBound(lpVar: number) {
|
|
309
273
|
const lower = this.lra.getLowerBound(lpVar);
|
|
310
274
|
return (
|
|
@@ -321,7 +285,7 @@ export class NlaCore {
|
|
|
321
285
|
);
|
|
322
286
|
}
|
|
323
287
|
|
|
324
|
-
varIsBig(lpVar: number) {
|
|
288
|
+
private varIsBig(lpVar: number) {
|
|
325
289
|
return !this.varIsInt(lpVar) && this.val(lpVar).isBig();
|
|
326
290
|
}
|
|
327
291
|
|
|
@@ -341,8 +305,6 @@ export class NlaCore {
|
|
|
341
305
|
return vars.some((lpVar) => this.val(lpVar).isZero());
|
|
342
306
|
}
|
|
343
307
|
|
|
344
|
-
// Monomials and their canonization.
|
|
345
|
-
|
|
346
308
|
isMonicVar(lpVar: number) {
|
|
347
309
|
return this.emons.isMonicVar(lpVar);
|
|
348
310
|
}
|
|
@@ -351,26 +313,22 @@ export class NlaCore {
|
|
|
351
313
|
return this.emons.get(lpVar);
|
|
352
314
|
}
|
|
353
315
|
|
|
354
|
-
|
|
355
|
-
return
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
sortedRvars(factor: Factor) {
|
|
359
|
-
return factor.isMon ? this.emons.get(factor.variable).rvars : [this.mapToRoot(factor.variable)];
|
|
316
|
+
private sortedRvars(factor: Factor) {
|
|
317
|
+
return factor.isMon
|
|
318
|
+
? this.emons.get(factor.variable).rvars
|
|
319
|
+
: [getSignedVarVar(this.varEqs.findVar(factor.variable))];
|
|
360
320
|
}
|
|
361
321
|
|
|
362
|
-
|
|
363
|
-
return isSignedVarNegated(this.varEqs.findVar(lpVar));
|
|
364
|
-
}
|
|
365
|
-
|
|
366
|
-
canonizeSignFactor(factor: Factor) {
|
|
322
|
+
private canonizeSignFactor(factor: Factor) {
|
|
367
323
|
return (
|
|
368
324
|
factor.isNegated !==
|
|
369
|
-
(factor.isMon
|
|
325
|
+
(factor.isMon
|
|
326
|
+
? this.emons.get(factor.variable).rsign
|
|
327
|
+
: isSignedVarNegated(this.varEqs.findVar(factor.variable)))
|
|
370
328
|
);
|
|
371
329
|
}
|
|
372
330
|
|
|
373
|
-
canonizeSignFactorization(factorization: Factorization) {
|
|
331
|
+
private canonizeSignFactorization(factorization: Factorization) {
|
|
374
332
|
let sign = false;
|
|
375
333
|
for (const factor of factorization.factors) sign = sign !== this.canonizeSignFactor(factor);
|
|
376
334
|
return sign;
|
|
@@ -386,31 +344,25 @@ export class NlaCore {
|
|
|
386
344
|
return sign;
|
|
387
345
|
}
|
|
388
346
|
|
|
389
|
-
findCanonicalMonicOfVars(vars: number[]) {
|
|
390
|
-
return this.emons.findCanonical(vars)?.variable;
|
|
391
|
-
}
|
|
392
|
-
|
|
393
|
-
isCanonicalMonic(lpVar: number) {
|
|
394
|
-
return this.emons.isCanonicalMonic(lpVar);
|
|
395
|
-
}
|
|
396
|
-
|
|
397
347
|
addMonic(lpVar: number, vars: number[]) {
|
|
398
348
|
this.emons.add(lpVar, vars);
|
|
399
349
|
this.monicsWithChangedBounds.add(lpVar);
|
|
400
350
|
}
|
|
401
351
|
|
|
402
|
-
|
|
403
|
-
|
|
352
|
+
addMulDef(vars: number[]) {
|
|
353
|
+
const lpVar = this.addMulDefHook(vars);
|
|
354
|
+
this.addMonic(lpVar, vars);
|
|
355
|
+
return lpVar;
|
|
404
356
|
}
|
|
405
357
|
|
|
406
|
-
// check_monic: whether the value of the monic is the product of its factors' values.
|
|
407
358
|
checkMonic(monic: Monic) {
|
|
408
359
|
const value = this.lra.getValue(monic.variable);
|
|
409
360
|
if (this.lra.isInt(monic.variable) && !value.x.isInt()) return true;
|
|
410
|
-
return this.
|
|
361
|
+
return this.mulVal(monic).equals(value.x);
|
|
411
362
|
}
|
|
412
363
|
|
|
413
364
|
hasRelevantMonomial() {
|
|
365
|
+
if (!this.transcendentals.isEmpty) return true;
|
|
414
366
|
return this.emons.monics.some((monic) => this.isRelevant(monic.variable));
|
|
415
367
|
}
|
|
416
368
|
|
|
@@ -433,7 +385,6 @@ export class NlaCore {
|
|
|
433
385
|
return weight;
|
|
434
386
|
}
|
|
435
387
|
|
|
436
|
-
// divide: the factor b with bc = b * c, up to sign.
|
|
437
388
|
divide(product: Monic, divisor: Factor): Factor | undefined {
|
|
438
389
|
const divisorVars = this.sortedRvars(divisor);
|
|
439
390
|
const quotientVars = getVectorDiv(product.rvars, divisorVars);
|
|
@@ -450,7 +401,6 @@ export class NlaCore {
|
|
|
450
401
|
return quotient;
|
|
451
402
|
}
|
|
452
403
|
|
|
453
|
-
// The factorizations of a monic: into its variables first, then into two canonical factors.
|
|
454
404
|
*getFactorizations(rooted: Monic): Generator<Factorization> {
|
|
455
405
|
const vars = rooted.rvars;
|
|
456
406
|
const monic = this.emons.get(rooted.variable);
|
|
@@ -460,7 +410,7 @@ export class NlaCore {
|
|
|
460
410
|
let numFailures = 0;
|
|
461
411
|
const getFactor = (factorVars: number[]): Factor | undefined => {
|
|
462
412
|
if (factorVars.length === 1) return mkFactor(factorVars[0], false);
|
|
463
|
-
const variable = this.
|
|
413
|
+
const variable = this.emons.findCanonical(factorVars)?.variable;
|
|
464
414
|
if (variable === undefined) {
|
|
465
415
|
numFailures++;
|
|
466
416
|
return undefined;
|
|
@@ -502,14 +452,10 @@ export class NlaCore {
|
|
|
502
452
|
}
|
|
503
453
|
}
|
|
504
454
|
|
|
505
|
-
// Lemma helpers.
|
|
506
|
-
|
|
507
455
|
negateRelation(lemma: LemmaBuilder, lpVar: number, value: Rational) {
|
|
508
456
|
lemma.addIneq(mkIneq(lpVar, this.val(lpVar).compare(value) < 0 ? KIND_GE : KIND_LE, value));
|
|
509
457
|
}
|
|
510
458
|
|
|
511
|
-
// Explanations of inequalities by bounds.
|
|
512
|
-
|
|
513
459
|
private explainCoeffBound(
|
|
514
460
|
column: number,
|
|
515
461
|
coeff: Rational,
|
|
@@ -541,7 +487,6 @@ export class NlaCore {
|
|
|
541
487
|
return true;
|
|
542
488
|
}
|
|
543
489
|
|
|
544
|
-
// explain_ineq: whether the bounds imply the negation of term cmp rs, added to the lemma.
|
|
545
490
|
explainIneq(lemma: LemmaBuilder, term: LarTerm, cmp: number, rs: Rational) {
|
|
546
491
|
if (term.size === 0 && rs.isZero() && (cmp === KIND_LT || cmp === KIND_GT || cmp === KIND_NE))
|
|
547
492
|
return true;
|
|
@@ -575,7 +520,6 @@ export class NlaCore {
|
|
|
575
520
|
return true;
|
|
576
521
|
}
|
|
577
522
|
|
|
578
|
-
// is_octagon_term: whether the term is +-x +-y, and whether its signs agree.
|
|
579
523
|
private getOctagonTerm(term: LarTerm) {
|
|
580
524
|
if (term.size !== 2) return undefined;
|
|
581
525
|
let isMinusSeen = false;
|
|
@@ -600,7 +544,6 @@ export class NlaCore {
|
|
|
600
544
|
return true;
|
|
601
545
|
}
|
|
602
546
|
|
|
603
|
-
// collect_equivs: the term columns fixed to zero that equate or negate two variables.
|
|
604
547
|
private collectEquivs() {
|
|
605
548
|
const lra = this.lra;
|
|
606
549
|
for (const term of lra.terms) {
|
|
@@ -618,23 +561,26 @@ export class NlaCore {
|
|
|
618
561
|
this.emons.ensureCanonized();
|
|
619
562
|
}
|
|
620
563
|
|
|
621
|
-
// The search.
|
|
622
|
-
|
|
623
564
|
random() {
|
|
624
|
-
return this.settings.getRandomNext();
|
|
565
|
+
return this.lra.settings.getRandomNext();
|
|
625
566
|
}
|
|
626
567
|
|
|
627
568
|
isCanceled() {
|
|
628
|
-
return this.settings.isCanceled();
|
|
569
|
+
return this.lra.settings.isCanceled();
|
|
570
|
+
}
|
|
571
|
+
|
|
572
|
+
checkPower(result: number, base: number, exponent: number) {
|
|
573
|
+
this.clear();
|
|
574
|
+
if (this.lra.isFeasible()) this.lra.getRidOfInfEps();
|
|
575
|
+
return checkPower(this, result, base, exponent);
|
|
629
576
|
}
|
|
630
577
|
|
|
631
|
-
// check_bounded_divisions: the lemmas of the divisions of bounded terms by numerals.
|
|
632
578
|
checkBoundedDivisions() {
|
|
633
579
|
this.clear();
|
|
634
580
|
this.divisions.checkBoundedDivisions();
|
|
635
581
|
}
|
|
636
582
|
|
|
637
|
-
clear() {
|
|
583
|
+
private clear() {
|
|
638
584
|
this.lemmas = [];
|
|
639
585
|
this.literals = [];
|
|
640
586
|
this.fixedEqualities = [];
|
|
@@ -642,15 +588,6 @@ export class NlaCore {
|
|
|
642
588
|
this.isCheckFeasible = false;
|
|
643
589
|
}
|
|
644
590
|
|
|
645
|
-
private initSearch() {
|
|
646
|
-
this.clear();
|
|
647
|
-
this.collectEquivs();
|
|
648
|
-
}
|
|
649
|
-
|
|
650
|
-
insertToRefine(lpVar: number) {
|
|
651
|
-
this.toRefine.add(lpVar);
|
|
652
|
-
}
|
|
653
|
-
|
|
654
591
|
eraseFromToRefine(lpVar: number) {
|
|
655
592
|
if (this.toRefine.has(lpVar)) this.toRefine.delete(lpVar);
|
|
656
593
|
}
|
|
@@ -662,11 +599,11 @@ export class NlaCore {
|
|
|
662
599
|
const size = this.emons.numMonics;
|
|
663
600
|
for (let index = 0; index < size; index++) {
|
|
664
601
|
const monic = this.emons.monics[(index + offset) % size];
|
|
665
|
-
if (!this.checkMonic(monic)) this.
|
|
602
|
+
if (!this.checkMonic(monic)) this.toRefine.add(monic.variable);
|
|
666
603
|
}
|
|
667
604
|
}
|
|
668
605
|
|
|
669
|
-
conflictFound() {
|
|
606
|
+
private conflictFound() {
|
|
670
607
|
return this.lemmas.some(isConflictLemma);
|
|
671
608
|
}
|
|
672
609
|
|
|
@@ -674,7 +611,7 @@ export class NlaCore {
|
|
|
674
611
|
return this.lemmas.length >= 10 || this.conflictFound() || this.isCanceled();
|
|
675
612
|
}
|
|
676
613
|
|
|
677
|
-
findBfcToRefineOnMonic(monic: Monic) {
|
|
614
|
+
private findBfcToRefineOnMonic(monic: Monic) {
|
|
678
615
|
for (const factorization of this.getFactorizations(monic)) {
|
|
679
616
|
if (factorization.factors.length !== 2) continue;
|
|
680
617
|
const product = this.valFactor(factorization.factors[0]).mul(
|
|
@@ -685,7 +622,6 @@ export class NlaCore {
|
|
|
685
622
|
return undefined;
|
|
686
623
|
}
|
|
687
624
|
|
|
688
|
-
// find_bfc_to_refine: a monic to refine, with a binary factorization of it.
|
|
689
625
|
findBfcToRefine() {
|
|
690
626
|
const offset = this.random();
|
|
691
627
|
const size = this.toRefine.size;
|
|
@@ -705,7 +641,6 @@ export class NlaCore {
|
|
|
705
641
|
return undefined;
|
|
706
642
|
}
|
|
707
643
|
|
|
708
|
-
// check_weighted: runs the checks in a random order weighted by their weights, until one yields.
|
|
709
644
|
private checkWeighted(checks: WeightedCheck[]) {
|
|
710
645
|
let bound = 0;
|
|
711
646
|
for (const check of checks) bound += check[0];
|
|
@@ -725,14 +660,13 @@ export class NlaCore {
|
|
|
725
660
|
}
|
|
726
661
|
}
|
|
727
662
|
|
|
728
|
-
// add_bounds: a split on a free variable of a monic to refine.
|
|
729
663
|
private addBounds() {
|
|
730
664
|
const offset = this.random();
|
|
731
665
|
const size = this.toRefine.size;
|
|
732
666
|
for (let index = 0; index < size; index++) {
|
|
733
667
|
const monic = this.emons.get(this.toRefine.elems[(index + offset) % size]);
|
|
734
668
|
for (const lpVar of monic.vars) {
|
|
735
|
-
if (!this.
|
|
669
|
+
if (!this.lra.isFree(lpVar) || monic.isBoundPropagated) continue;
|
|
736
670
|
this.emons.setBoundPropagated(monic);
|
|
737
671
|
this.literals.push(mkIneq(lpVar, KIND_EQ, 0));
|
|
738
672
|
this.stats.nlaAddBounds++;
|
|
@@ -743,25 +677,47 @@ export class NlaCore {
|
|
|
743
677
|
|
|
744
678
|
private onToRefineEmpty() {
|
|
745
679
|
this.squeezeSchedule.onNothingToRefine();
|
|
746
|
-
return
|
|
680
|
+
return this.checkTranscendentalsAndFinish();
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
// The applications of transcendental functions still need checking when the monomials hold. A
|
|
684
|
+
// failure of the check needs nlsat, and a model of nlsat that is not tight enough is unknown.
|
|
685
|
+
private checkTranscendentalsAndFinish() {
|
|
686
|
+
const transcendentals = this.transcendentals;
|
|
687
|
+
if (transcendentals.isEmpty) return L_TRUE;
|
|
688
|
+
const numFailures = transcendentals.numFailures;
|
|
689
|
+
transcendentals.check();
|
|
690
|
+
if (this.lemmas.length > 0 || this.literals.length > 0) return L_FALSE;
|
|
691
|
+
const isFailed = transcendentals.numFailures > numFailures;
|
|
692
|
+
let isRunningNlsat = this.shouldRunBoundedNlsat() && transcendentals.numFailures > 0;
|
|
693
|
+
if (isFailed && !isRunningNlsat) {
|
|
694
|
+
if (!NLA_PARAMS.nra) return L_UNDEF;
|
|
695
|
+
isRunningNlsat = true;
|
|
696
|
+
}
|
|
697
|
+
if (!isRunningNlsat) return L_TRUE;
|
|
698
|
+
const result = this.boundedNlsat();
|
|
699
|
+
if (result === L_FALSE) return L_FALSE;
|
|
700
|
+
if (result === L_TRUE && transcendentals.isNraModelValid()) return L_TRUE;
|
|
701
|
+
if (result === L_TRUE) this.setUseNraModel(false);
|
|
702
|
+
return L_UNDEF;
|
|
747
703
|
}
|
|
748
704
|
|
|
749
705
|
check(level: number) {
|
|
750
706
|
const stats = this.stats;
|
|
751
707
|
stats.nlaCalls++;
|
|
752
708
|
this.lra.getRidOfInfEps();
|
|
753
|
-
if (this.lra.
|
|
709
|
+
if (!this.lra.isFeasible()) return L_UNDEF;
|
|
754
710
|
this.initToRefine();
|
|
755
711
|
this.patcher.patchMonomials();
|
|
756
712
|
this.setUseNraModel(false);
|
|
757
713
|
if (this.toRefine.size === 0) return this.onToRefineEmpty();
|
|
758
|
-
this.
|
|
714
|
+
this.clear();
|
|
715
|
+
this.collectEquivs();
|
|
759
716
|
this.isNlaSatisfied = false;
|
|
760
717
|
let result = L_UNDEF;
|
|
761
718
|
const isRunningGrobner = NLA_PARAMS.grobner;
|
|
762
719
|
const isRunningHorner = NLA_PARAMS.horner && stats.nlaCalls % NLA_PARAMS.hornerFrequency === 0;
|
|
763
720
|
const isRunningBounds = NLA_PARAMS.branching;
|
|
764
|
-
// Model-based basic lemmas are effective on small systems, and branching on larger ones.
|
|
765
721
|
const isDelayingBounds = isRunningBounds && this.emons.numMonics <= 8;
|
|
766
722
|
const hasNoEffect = () =>
|
|
767
723
|
result === L_UNDEF &&
|
|
@@ -805,13 +761,16 @@ export class NlaCore {
|
|
|
805
761
|
);
|
|
806
762
|
if (this.isCanceled()) return L_UNDEF;
|
|
807
763
|
if (this.lemmas.length > 0 || this.literals.length > 0 || this.isCheckFeasible) return L_FALSE;
|
|
808
|
-
if (this.isNlaSatisfied) return
|
|
764
|
+
if (this.isNlaSatisfied) return this.checkTranscendentalsAndFinish();
|
|
765
|
+
if (hasNoEffect() && !this.transcendentals.isEmpty) this.transcendentals.check();
|
|
809
766
|
if (
|
|
810
767
|
hasNoEffect() &&
|
|
811
768
|
NLA_PARAMS.nraCheckAssignment &&
|
|
812
769
|
this.checkAssignmentFailCount < NLA_PARAMS.nraCheckAssignmentMaxFail
|
|
813
770
|
) {
|
|
771
|
+
this.limit.pushChild(this.nraLimit);
|
|
814
772
|
result = this.nra.checkAssignment();
|
|
773
|
+
this.limit.popChild(this.nraLimit);
|
|
815
774
|
if (result !== L_TRUE) this.checkAssignmentFailCount++;
|
|
816
775
|
}
|
|
817
776
|
if (hasNoEffect() && this.shouldRunBoundedNlsat()) result = this.boundedNlsat();
|
|
@@ -831,7 +790,9 @@ export class NlaCore {
|
|
|
831
790
|
result = this.boundedNlsat();
|
|
832
791
|
}
|
|
833
792
|
if (hasNoEffect() && NLA_PARAMS.nra && level >= 2) {
|
|
834
|
-
|
|
793
|
+
this.limit.pushChild(this.nraLimit);
|
|
794
|
+
result = this.nra.check(Infinity);
|
|
795
|
+
this.limit.popChild(this.nraLimit);
|
|
835
796
|
stats.nraCalls++;
|
|
836
797
|
}
|
|
837
798
|
if (result === L_UNDEF && !hasNoEffect()) result = L_FALSE;
|
|
@@ -843,18 +804,20 @@ export class NlaCore {
|
|
|
843
804
|
return NLA_PARAMS.nra && this.nlsatBackoff.shouldRun();
|
|
844
805
|
}
|
|
845
806
|
|
|
846
|
-
// bounded_nlsat: a run of nlsat capped at 100 conflicts and 100000 steps. A refutation, or a run
|
|
847
|
-
// that took less than a tenth of the steps, makes the backoff run it again sooner.
|
|
848
807
|
private boundedNlsat() {
|
|
849
|
-
const
|
|
850
|
-
|
|
808
|
+
const rlimitBudget = 100000;
|
|
809
|
+
this.limit.pushChild(this.nraLimit);
|
|
810
|
+
this.nraLimit.push(rlimitBudget);
|
|
811
|
+
const result = this.nra.check(100);
|
|
812
|
+
const rlimitConsumed = this.nraLimit.count;
|
|
813
|
+
this.nraLimit.pop();
|
|
814
|
+
this.limit.popChild(this.nraLimit);
|
|
851
815
|
this.stats.nraCalls++;
|
|
852
|
-
this.nlsatBackoff.update(result === L_FALSE ||
|
|
816
|
+
this.nlsatBackoff.update(result === L_FALSE || rlimitConsumed < rlimitBudget / 10);
|
|
853
817
|
if (result === L_TRUE) this.clear();
|
|
854
818
|
return result;
|
|
855
819
|
}
|
|
856
820
|
|
|
857
|
-
// set_use_nra_model, undone on pop.
|
|
858
821
|
setUseNraModel(isUsing: boolean) {
|
|
859
822
|
if (isUsing === this.isUsingNraModel) return;
|
|
860
823
|
this.emons.trail.push(() => {
|
|
@@ -863,8 +826,6 @@ export class NlaCore {
|
|
|
863
826
|
this.isUsingNraModel = isUsing;
|
|
864
827
|
}
|
|
865
828
|
|
|
866
|
-
// Propagation.
|
|
867
|
-
|
|
868
829
|
propagate() {
|
|
869
830
|
this.clear();
|
|
870
831
|
let isPropagated = false;
|
|
@@ -884,8 +845,6 @@ export class NlaCore {
|
|
|
884
845
|
return isPropagated;
|
|
885
846
|
}
|
|
886
847
|
|
|
887
|
-
// Pseudo-linear monomials: all but one factor are integers in a range of at most 4.
|
|
888
|
-
|
|
889
848
|
private isPseudoLinear(monic: Monic) {
|
|
890
849
|
let hasUnbounded = false;
|
|
891
850
|
for (const lpVar of monic.vars) {
|
|
@@ -943,8 +902,6 @@ export class NlaCore {
|
|
|
943
902
|
);
|
|
944
903
|
}
|
|
945
904
|
|
|
946
|
-
// Scopes.
|
|
947
|
-
|
|
948
905
|
push() {
|
|
949
906
|
this.emons.push();
|
|
950
907
|
}
|
|
@@ -954,7 +911,6 @@ export class NlaCore {
|
|
|
954
911
|
}
|
|
955
912
|
}
|
|
956
913
|
|
|
957
|
-
// vector_div: the multiset difference of sorted vectors, when the divisor is a proper factor.
|
|
958
914
|
const getVectorDiv = (product: number[], divisor: number[]) => {
|
|
959
915
|
if (divisor.length >= product.length) return undefined;
|
|
960
916
|
const quotient: number[] = [];
|