tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b
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 +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/bags.ts +47 -28
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +476 -590
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +60 -708
- 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 +25 -18
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +14 -7
- 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/json.ts +4 -7
- package/src/levels.ts +42 -44
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +597 -240
- package/src/liveness.ts +94 -86
- 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 +29 -47
- package/src/parser.ts +652 -220
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +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 +93 -15
- 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 +536 -117
- 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 +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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +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 +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +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 +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -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 +410 -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 +1407 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -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 +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +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 +44 -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 +90 -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 +1704 -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 +1995 -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/resolve.ts +127 -108
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +382 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1092 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- 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 +243 -52
- package/src/simulate.ts +160 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/subexpressions.ts +3 -1
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +16 -12
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +26 -47
- 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 +63 -158
- 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,9 +1,8 @@
|
|
|
1
|
-
|
|
2
|
-
// src/util/mpbq.cpp, src/util/index_sort_with_mutations.h), MIT license, see z3-license.txt.
|
|
3
|
-
import { SmtInvariantError } from "../../../../errors";
|
|
1
|
+
import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
|
|
4
2
|
import { Rational } from "../rational";
|
|
3
|
+
import type { ResourceLimit } from "../rlimit";
|
|
5
4
|
import { getLog2, Mpbq } from "./mpbq";
|
|
6
|
-
import { PolynomialManager, type Polynomial, type ValueOps } from "./polynomial";
|
|
5
|
+
import { PolynomialManager, type Polynomial, PolynomialRef, type ValueOps } from "./polynomial";
|
|
7
6
|
import { UpolynomialManager, type Upolynomial } from "./upolynomial";
|
|
8
7
|
import { factorUpolynomial, type FactorParams } from "./upolynomial-factorization";
|
|
9
8
|
|
|
@@ -81,6 +80,14 @@ interface SignedRoots {
|
|
|
81
80
|
const getMinBq = (first: Mpbq, second: Mpbq) => (second.compare(first) < 0 ? second : first);
|
|
82
81
|
const getMaxBq = (first: Mpbq, second: Mpbq) => (second.compare(first) > 0 ? second : first);
|
|
83
82
|
|
|
83
|
+
const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
|
|
84
|
+
const lower = base.lower.power(exponent);
|
|
85
|
+
const upper = base.upper.power(exponent);
|
|
86
|
+
if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
|
|
87
|
+
if (base.upper.isNeg) return { lower: upper, upper: lower };
|
|
88
|
+
return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
|
|
89
|
+
};
|
|
90
|
+
|
|
84
91
|
const INTERVAL_OPS: ValueOps<BqInterval> = {
|
|
85
92
|
fromInteger: (value) => ({ lower: Mpbq.of(value), upper: Mpbq.of(value) }),
|
|
86
93
|
add: (first, second) => ({
|
|
@@ -96,15 +103,7 @@ const INTERVAL_OPS: ValueOps<BqInterval> = {
|
|
|
96
103
|
];
|
|
97
104
|
return { lower: products.reduce(getMinBq), upper: products.reduce(getMaxBq) };
|
|
98
105
|
},
|
|
99
|
-
power:
|
|
100
|
-
};
|
|
101
|
-
|
|
102
|
-
const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
|
|
103
|
-
const lower = base.lower.power(exponent);
|
|
104
|
-
const upper = base.upper.power(exponent);
|
|
105
|
-
if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
|
|
106
|
-
if (base.upper.isNeg) return { lower: upper, upper: lower };
|
|
107
|
-
return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
|
|
106
|
+
power: getIntervalPower,
|
|
108
107
|
};
|
|
109
108
|
|
|
110
109
|
const containsZero = (interval: BqInterval) => interval.lower.isNeg && interval.upper.isPos;
|
|
@@ -169,6 +168,37 @@ const getExtended = (values: readonly (Anum | undefined)[], variable: number, an
|
|
|
169
168
|
return extended;
|
|
170
169
|
};
|
|
171
170
|
|
|
171
|
+
const getSmt2Numeral = (value: bigint) => (value < 0n ? `(- ${-value})` : `${value}`);
|
|
172
|
+
|
|
173
|
+
const getSmt2Monomial = (coeff: bigint, degree: number) => {
|
|
174
|
+
if (degree === 0) return getSmt2Numeral(coeff);
|
|
175
|
+
const power = degree === 1 ? "x" : `(^ x ${degree})`;
|
|
176
|
+
return coeff === 1n ? power : `(* ${getSmt2Numeral(coeff)} ${power})`;
|
|
177
|
+
};
|
|
178
|
+
|
|
179
|
+
const getUpolynomialSmt2 = (p: Upolynomial) => {
|
|
180
|
+
if (p.length === 0) return "0";
|
|
181
|
+
const nonzero = p.flatMap((coeff, degree) => (coeff === 0n ? [] : [degree]));
|
|
182
|
+
if (nonzero.length === 1) return getSmt2Monomial(p[nonzero[0]], nonzero[0]);
|
|
183
|
+
return `(+ ${nonzero
|
|
184
|
+
.reverse()
|
|
185
|
+
.map((degree) => getSmt2Monomial(p[degree], degree))
|
|
186
|
+
.join(" ")})`;
|
|
187
|
+
};
|
|
188
|
+
|
|
189
|
+
const getRationalDecimal = (value: Rational, precision: number) => {
|
|
190
|
+
const magnitude = value.num < 0n ? -value.num : value.num;
|
|
191
|
+
const sign = value.num < 0n ? "-" : "";
|
|
192
|
+
let remainder = magnitude % value.den;
|
|
193
|
+
if (remainder === 0n) return `${sign}${magnitude / value.den}`;
|
|
194
|
+
const digits: string[] = [];
|
|
195
|
+
for (let index = 0; index < precision && remainder !== 0n; index++) {
|
|
196
|
+
digits.push(`${(remainder * 10n) / value.den}`);
|
|
197
|
+
remainder = (remainder * 10n) % value.den;
|
|
198
|
+
}
|
|
199
|
+
return `${sign}${magnitude / value.den}.${digits.join("")}${remainder === 0n ? "" : "?"}`;
|
|
200
|
+
};
|
|
201
|
+
|
|
172
202
|
const hasSameCoeffs = (first: Upolynomial, second: Upolynomial) =>
|
|
173
203
|
first.length === second.length && first.every((coeff, index) => coeff === second[index]);
|
|
174
204
|
|
|
@@ -195,8 +225,8 @@ export const mergeSortIndices = (
|
|
|
195
225
|
};
|
|
196
226
|
|
|
197
227
|
export class AlgebraicManager {
|
|
198
|
-
private um
|
|
199
|
-
private pm
|
|
228
|
+
private um: UpolynomialManager;
|
|
229
|
+
private pm: PolynomialManager;
|
|
200
230
|
private anumOps: ValueOps<Anum> = {
|
|
201
231
|
fromInteger: (value) => new Anum(Rational.of(value)),
|
|
202
232
|
add: (first, second) => this.add(first, second),
|
|
@@ -204,6 +234,11 @@ export class AlgebraicManager {
|
|
|
204
234
|
power: (base, exponent) => this.power(base, exponent),
|
|
205
235
|
};
|
|
206
236
|
|
|
237
|
+
constructor(private limit: ResourceLimit) {
|
|
238
|
+
this.um = new UpolynomialManager(limit);
|
|
239
|
+
this.pm = new PolynomialManager(limit);
|
|
240
|
+
}
|
|
241
|
+
|
|
207
242
|
isZero(anum: Anum) {
|
|
208
243
|
return anum.value instanceof Rational && anum.value.isZero();
|
|
209
244
|
}
|
|
@@ -213,6 +248,16 @@ export class AlgebraicManager {
|
|
|
213
248
|
return anum.value instanceof Rational ? 1 : anum.value.p.length - 1;
|
|
214
249
|
}
|
|
215
250
|
|
|
251
|
+
isNeg(anum: Anum) {
|
|
252
|
+
return anum.value instanceof Rational ? anum.value.isNegative() : !anum.value.upper.isPos;
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
toRational(anum: Anum) {
|
|
256
|
+
if (!this.isRational(anum) || !(anum.value instanceof Rational))
|
|
257
|
+
throw new SmtInvariantError("expected a rational algebraic number");
|
|
258
|
+
return anum.value;
|
|
259
|
+
}
|
|
260
|
+
|
|
216
261
|
copy(anum: Anum) {
|
|
217
262
|
return new Anum(anum.value instanceof Rational ? anum.value : anum.value.clone());
|
|
218
263
|
}
|
|
@@ -347,7 +392,7 @@ export class AlgebraicManager {
|
|
|
347
392
|
return factorUpolynomial(this.um, p, FACTOR_PARAMS);
|
|
348
393
|
}
|
|
349
394
|
|
|
350
|
-
|
|
395
|
+
isolateUnivariateRoots(coeffs: Upolynomial) {
|
|
351
396
|
const roots: Anum[] = [];
|
|
352
397
|
if (coeffs.length === 0) return roots;
|
|
353
398
|
const hasZeroRoot = this.um.hasZeroRoots(coeffs);
|
|
@@ -382,7 +427,7 @@ export class AlgebraicManager {
|
|
|
382
427
|
}
|
|
383
428
|
|
|
384
429
|
private sortRoots(roots: Anum[]) {
|
|
385
|
-
if (roots.length < 2) return;
|
|
430
|
+
if (!this.limit.inc() || roots.length < 2) return;
|
|
386
431
|
const sorted = mergeSortIndices(
|
|
387
432
|
roots.length,
|
|
388
433
|
(first, second) => this.compare(roots[first], roots[second]) < 0,
|
|
@@ -419,6 +464,7 @@ export class AlgebraicManager {
|
|
|
419
464
|
let highVariations = isNonPositive ? atZero : this.um.signVariationsAtPlusInf(sequence);
|
|
420
465
|
let target = isNonPositive ? rootIndex : rootIndex - nonPositiveCount;
|
|
421
466
|
while (lowVariations > highVariations + 1) {
|
|
467
|
+
this.limit.checkpoint();
|
|
422
468
|
const middle = low.add(high).div2();
|
|
423
469
|
const middleVariations = this.um.signVariationsAt(sequence, middle);
|
|
424
470
|
const leftCount = lowVariations - middleVariations;
|
|
@@ -489,29 +535,43 @@ export class AlgebraicManager {
|
|
|
489
535
|
): Anum[] {
|
|
490
536
|
if (pm.isConst(polynomial)) return [];
|
|
491
537
|
if (pm.isUnivariate(polynomial)) return this.isolateUnivariateRoots(pm.toCoeffs(polynomial));
|
|
492
|
-
const
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
538
|
+
const pPrime = new PolynomialRef(pm);
|
|
539
|
+
const q = new PolynomialRef(pm);
|
|
540
|
+
const pY = new PolynomialRef(pm);
|
|
541
|
+
try {
|
|
542
|
+
pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
|
|
543
|
+
const reduced = pPrime.get();
|
|
544
|
+
if (pm.isConst(reduced)) return [];
|
|
545
|
+
if (pm.isUnivariate(reduced)) {
|
|
546
|
+
if (values[pm.maxVar(reduced)] !== undefined) return [];
|
|
547
|
+
return this.isolateUnivariateRoots(pm.toCoeffs(reduced));
|
|
548
|
+
}
|
|
549
|
+
const xs = this.sortByDegree(pm.getVars(reduced), values);
|
|
550
|
+
const x = xs[xs.length - 1];
|
|
551
|
+
if (values[x] !== undefined) return [];
|
|
552
|
+
q.copy(pPrime);
|
|
553
|
+
for (let index = 0; index + 1 < xs.length; index++) {
|
|
554
|
+
this.limit.checkpoint();
|
|
555
|
+
const y = xs[index];
|
|
556
|
+
pY.set(pm.toPolynomial(getCell(values[y]).p, y));
|
|
557
|
+
pm.resultant(q.get(), pY.get(), y, q);
|
|
558
|
+
if (pm.isZero(q.get())) {
|
|
559
|
+
if (isNested)
|
|
560
|
+
throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
|
|
561
|
+
break;
|
|
562
|
+
}
|
|
563
|
+
}
|
|
564
|
+
if (pm.isZero(q.get())) return this.isolateVanishedRoots(pm, reduced, values, xs, x);
|
|
565
|
+
if (pm.isConst(q.get())) return [];
|
|
566
|
+
return this.isolateUnivariateRoots(pm.toCoeffs(q.get())).filter((root) => {
|
|
567
|
+
this.limit.checkpoint();
|
|
568
|
+
return this.evalSignAt(pm, reduced, getExtended(values, x, root)) === 0;
|
|
569
|
+
});
|
|
570
|
+
} finally {
|
|
571
|
+
pY.reset();
|
|
572
|
+
q.reset();
|
|
573
|
+
pPrime.reset();
|
|
511
574
|
}
|
|
512
|
-
if (isNested)
|
|
513
|
-
throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
|
|
514
|
-
return this.isolateVanishedRoots(pm, reduced, values, xs, x);
|
|
515
575
|
}
|
|
516
576
|
|
|
517
577
|
private isolateVanishedRoots(
|
|
@@ -525,26 +585,50 @@ export class AlgebraicManager {
|
|
|
525
585
|
pm.evaluateWith(polynomial, this.anumOps, (variable) => getAssigned(values, variable));
|
|
526
586
|
const degree = pm.degree(reduced, x);
|
|
527
587
|
if (degree === 1) {
|
|
528
|
-
const
|
|
529
|
-
const
|
|
588
|
+
const c0 = new PolynomialRef(pm);
|
|
589
|
+
const c1 = new PolynomialRef(pm);
|
|
590
|
+
c0.set(pm.coeff(reduced, x, 0));
|
|
591
|
+
c1.set(pm.coeff(reduced, x, 1));
|
|
592
|
+
const constant = evaluate(c0.get());
|
|
593
|
+
const leading = evaluate(c1.get());
|
|
594
|
+
c1.reset();
|
|
595
|
+
c0.reset();
|
|
530
596
|
if (this.isZero(leading)) return [];
|
|
531
597
|
const root = this.div(constant, leading);
|
|
532
598
|
this.neg(root);
|
|
533
599
|
return [root];
|
|
534
600
|
}
|
|
601
|
+
const c = new PolynomialRef(pm);
|
|
535
602
|
let power = degree;
|
|
536
603
|
let leading = new Anum(Rational.zero);
|
|
537
604
|
for (; power >= 1; power--) {
|
|
538
|
-
|
|
605
|
+
c.set(pm.coeff(reduced, x, power));
|
|
606
|
+
leading = evaluate(c.get());
|
|
539
607
|
if (!this.isZero(leading)) break;
|
|
540
608
|
}
|
|
541
|
-
if (power === 0)
|
|
609
|
+
if (power === 0) {
|
|
610
|
+
c.reset();
|
|
611
|
+
return [];
|
|
612
|
+
}
|
|
542
613
|
const z = Math.max(...xs) + 1;
|
|
543
|
-
const
|
|
544
|
-
|
|
545
|
-
|
|
546
|
-
);
|
|
547
|
-
|
|
614
|
+
const q2 = new PolynomialRef(this.pm);
|
|
615
|
+
const zP = new PolynomialRef(this.pm);
|
|
616
|
+
const xiP = new PolynomialRef(this.pm);
|
|
617
|
+
const product = new PolynomialRef(this.pm);
|
|
618
|
+
q2.set(this.convert(pm, reduced, x, power - 1));
|
|
619
|
+
xiP.set(this.pm.mkVar(x, power));
|
|
620
|
+
zP.set(this.pm.mkVar(z));
|
|
621
|
+
product.set(this.pm.mul(zP.get(), xiP.get()));
|
|
622
|
+
q2.set(this.pm.add(product.get(), q2.get()));
|
|
623
|
+
product.reset();
|
|
624
|
+
try {
|
|
625
|
+
return this.isolateRoots(this.pm, q2.get(), getExtended(values, z, leading), true);
|
|
626
|
+
} finally {
|
|
627
|
+
xiP.reset();
|
|
628
|
+
zP.reset();
|
|
629
|
+
q2.reset();
|
|
630
|
+
c.reset();
|
|
631
|
+
}
|
|
548
632
|
}
|
|
549
633
|
|
|
550
634
|
private convert(pm: PolynomialManager, polynomial: Polynomial, x = -1, maxDegree = Infinity) {
|
|
@@ -578,13 +662,20 @@ export class AlgebraicManager {
|
|
|
578
662
|
if (pm.isConst(polynomial)) return result;
|
|
579
663
|
if (pm.isUnivariate(polynomial))
|
|
580
664
|
return this.isolateRootsClosestUnivariate(pm, polynomial, sample);
|
|
581
|
-
const
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
665
|
+
const pPrime = new PolynomialRef(pm);
|
|
666
|
+
let all: Anum[];
|
|
667
|
+
try {
|
|
668
|
+
pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
|
|
669
|
+
const reduced = pPrime.get();
|
|
670
|
+
if (pm.isConst(reduced)) return result;
|
|
671
|
+
if (pm.isUnivariate(reduced)) {
|
|
672
|
+
if (values[pm.maxVar(reduced)] !== undefined) return result;
|
|
673
|
+
return this.isolateRootsClosestUnivariate(pm, reduced, sample);
|
|
674
|
+
}
|
|
675
|
+
all = this.isolateRoots(pm, polynomial, values);
|
|
676
|
+
} finally {
|
|
677
|
+
pPrime.reset();
|
|
586
678
|
}
|
|
587
|
-
const all = this.isolateRoots(pm, polynomial, values);
|
|
588
679
|
const sampleAnum = new Anum(sample);
|
|
589
680
|
let lower = -1;
|
|
590
681
|
let upper = -1;
|
|
@@ -632,37 +723,47 @@ export class AlgebraicManager {
|
|
|
632
723
|
evalSignAt(pm: PolynomialManager, polynomial: Polynomial, values: readonly (Anum | undefined)[]) {
|
|
633
724
|
while (true) {
|
|
634
725
|
const rationalValues = getRationalValues(values);
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
const
|
|
638
|
-
|
|
639
|
-
|
|
640
|
-
|
|
641
|
-
|
|
642
|
-
|
|
643
|
-
|
|
644
|
-
|
|
645
|
-
|
|
646
|
-
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
let
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
if (!
|
|
655
|
-
|
|
656
|
-
|
|
726
|
+
const rationalSign = pm.getRationalSign(polynomial, rationalValues);
|
|
727
|
+
if (rationalSign !== null) return rationalSign;
|
|
728
|
+
const pPrime = new PolynomialRef(pm);
|
|
729
|
+
try {
|
|
730
|
+
pPrime.set(pm.substituteRational(polynomial, rationalValues));
|
|
731
|
+
const reduced = pPrime.get();
|
|
732
|
+
if (reduced.size === 0) return 0;
|
|
733
|
+
if (pm.isConst(reduced)) return reduced.as[0] > 0n ? 1 : -1;
|
|
734
|
+
const xs = pm.getVars(reduced);
|
|
735
|
+
const getInterval = (variable: number) => {
|
|
736
|
+
const cell = getCell(values[variable]);
|
|
737
|
+
return { lower: cell.lower, upper: cell.upper };
|
|
738
|
+
};
|
|
739
|
+
const evaluate = () => pm.evaluateWith(reduced, INTERVAL_OPS, getInterval);
|
|
740
|
+
let interval: BqInterval;
|
|
741
|
+
let isRestarted = false;
|
|
742
|
+
while (true) {
|
|
743
|
+
this.limit.checkpoint();
|
|
744
|
+
interval = evaluate();
|
|
745
|
+
if (!containsZero(interval)) return interval.lower.isNeg ? -1 : 1;
|
|
746
|
+
let isRefined = false;
|
|
747
|
+
for (const variable of xs) {
|
|
748
|
+
const value = getAssigned(values, variable);
|
|
749
|
+
if (this.getCellMagnitude(getCell(value)) <= MIN_MAGNITUDE) continue;
|
|
750
|
+
if (!this.refine(value)) {
|
|
751
|
+
isRestarted = true;
|
|
752
|
+
break;
|
|
753
|
+
}
|
|
754
|
+
isRefined = true;
|
|
657
755
|
}
|
|
658
|
-
isRefined
|
|
756
|
+
if (!isRefined || isRestarted) break;
|
|
659
757
|
}
|
|
660
|
-
if (
|
|
661
|
-
|
|
758
|
+
if (isRestarted) {
|
|
759
|
+
this.limit.checkpoint();
|
|
760
|
+
continue;
|
|
761
|
+
}
|
|
762
|
+
const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
|
|
763
|
+
if (sign !== null) return sign;
|
|
764
|
+
} finally {
|
|
765
|
+
pPrime.reset();
|
|
662
766
|
}
|
|
663
|
-
if (isRestarted) continue;
|
|
664
|
-
const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
|
|
665
|
-
if (sign !== null) return sign;
|
|
666
767
|
}
|
|
667
768
|
}
|
|
668
769
|
|
|
@@ -675,14 +776,23 @@ export class AlgebraicManager {
|
|
|
675
776
|
evaluate: () => BqInterval,
|
|
676
777
|
) {
|
|
677
778
|
const sorted = this.sortByDegree(xs, values);
|
|
678
|
-
|
|
679
|
-
|
|
680
|
-
|
|
681
|
-
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
685
|
-
const
|
|
779
|
+
const yp = new PolynomialRef(this.pm);
|
|
780
|
+
const pPrimeAux = new PolynomialRef(this.pm);
|
|
781
|
+
const r = new PolynomialRef(this.pm);
|
|
782
|
+
const qi = new PolynomialRef(this.pm);
|
|
783
|
+
yp.set(this.pm.mkVar(Math.max(...xs) + 1));
|
|
784
|
+
pPrimeAux.set(this.convert(pm, reduced));
|
|
785
|
+
r.set(this.pm.sub(yp.get(), pPrimeAux.get()));
|
|
786
|
+
for (const variable of sorted) {
|
|
787
|
+
this.limit.checkpoint();
|
|
788
|
+
qi.set(this.pm.toPolynomial(getCell(values[variable]).p, variable));
|
|
789
|
+
this.pm.resultant(r.get(), qi.get(), variable, r);
|
|
790
|
+
}
|
|
791
|
+
const k = this.um.nonzeroRootLowerBound(this.pm.toCoeffs(r.get()));
|
|
792
|
+
qi.reset();
|
|
793
|
+
r.reset();
|
|
794
|
+
pPrimeAux.reset();
|
|
795
|
+
yp.reset();
|
|
686
796
|
const bound = Mpbq.of(1n, k);
|
|
687
797
|
const isInsideBound = (interval: BqInterval) =>
|
|
688
798
|
bound.neg().compare(interval.lower) < 0 && interval.upper.compare(bound) < 0;
|
|
@@ -690,6 +800,7 @@ export class AlgebraicManager {
|
|
|
690
800
|
const saved = sorted.map((variable) => this.saveInterval(getAssigned(values, variable)));
|
|
691
801
|
let sign: number | null = null;
|
|
692
802
|
while (sign === null) {
|
|
803
|
+
this.limit.checkpoint();
|
|
693
804
|
const interval = evaluate();
|
|
694
805
|
if (!containsZero(interval)) sign = interval.lower.isNeg ? -1 : 1;
|
|
695
806
|
else if (isInsideBound(interval)) sign = 0;
|
|
@@ -827,14 +938,119 @@ export class AlgebraicManager {
|
|
|
827
938
|
return this.mkPower(anum, exponent);
|
|
828
939
|
}
|
|
829
940
|
|
|
941
|
+
root(anum: Anum, k: number): Anum {
|
|
942
|
+
if (k === 0) throw new SmtInvariantError("0-th root is indeterminate");
|
|
943
|
+
if (k === 1 || this.isZero(anum)) return this.copy(anum);
|
|
944
|
+
if (this.isNeg(anum) && k % 2 === 0)
|
|
945
|
+
throw new SmtInvariantError("even root of negative number is not real");
|
|
946
|
+
if (anum.value instanceof Rational) return this.rootRational(anum.value, k);
|
|
947
|
+
return this.mkRoot(anum, k);
|
|
948
|
+
}
|
|
949
|
+
|
|
950
|
+
private rootRational(value: Rational, k: number) {
|
|
951
|
+
const exact = value.root(k);
|
|
952
|
+
if (exact !== undefined) return new Anum(exact);
|
|
953
|
+
const p = [-value.num, ...Array.from({ length: k - 1 }, () => 0n), value.den];
|
|
954
|
+
const converted = Mpbq.fromRational(value);
|
|
955
|
+
const bound = converted.isExact ? converted.value : converted.value.mul2k(1);
|
|
956
|
+
return value.isNegative()
|
|
957
|
+
? this.mkAnum(p, bound.sub(Mpbq.one), Mpbq.zero, false)
|
|
958
|
+
: this.mkAnum(p, Mpbq.zero, bound.add(Mpbq.one), false);
|
|
959
|
+
}
|
|
960
|
+
|
|
961
|
+
// Res_y(x^k - y, p(y)) has a^(1/k) as a root.
|
|
962
|
+
private mkRoot(anum: Anum, k: number): Anum {
|
|
963
|
+
const cell = getCell(anum);
|
|
964
|
+
const factored = this.factor(this.getResultantCoeffs(this.getVarDifference(k, 1), cell.p));
|
|
965
|
+
const factors = factored.factors.factors;
|
|
966
|
+
const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
|
|
967
|
+
const saved = this.saveInterval(anum);
|
|
968
|
+
while (true) {
|
|
969
|
+
this.limit.checkpoint();
|
|
970
|
+
const interval = { lower: cell.lower.rootLower(k), upper: cell.upper.rootUpper(k) };
|
|
971
|
+
const found = this.findIsolatingFactor(factors, sequences, interval);
|
|
972
|
+
if (found !== null) {
|
|
973
|
+
this.restoreIfTooSmall(saved);
|
|
974
|
+
return this.setCore(found, interval, factored.isComplete);
|
|
975
|
+
}
|
|
976
|
+
if (!this.refine(anum)) {
|
|
977
|
+
this.restoreIfTooSmall(saved);
|
|
978
|
+
return this.root(anum, k);
|
|
979
|
+
}
|
|
980
|
+
}
|
|
981
|
+
}
|
|
982
|
+
|
|
983
|
+
getPolynomial(anum: Anum) {
|
|
984
|
+
return anum.value instanceof Rational ? [-anum.value.num, anum.value.den] : [...anum.value.p];
|
|
985
|
+
}
|
|
986
|
+
|
|
987
|
+
getIsolatingInterval(anum: Anum): [Rational, Rational] {
|
|
988
|
+
if (anum.value instanceof Rational) return [anum.value, anum.value];
|
|
989
|
+
return [anum.value.lower.toRational(), anum.value.upper.toRational()];
|
|
990
|
+
}
|
|
991
|
+
|
|
992
|
+
getInterval(anum: Anum, precision: number): [Rational, Rational] {
|
|
993
|
+
if (anum.value instanceof Rational) return [anum.value, anum.value];
|
|
994
|
+
const cell = anum.value;
|
|
995
|
+
const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
|
|
996
|
+
return [refined.lower.toRational(), refined.upper.toRational()];
|
|
997
|
+
}
|
|
998
|
+
|
|
999
|
+
displayRootSmt2(anum: Anum) {
|
|
1000
|
+
if (this.isZero(anum)) return "(root-obj x 1)";
|
|
1001
|
+
if (anum.value instanceof Rational)
|
|
1002
|
+
return `(root-obj ${getUpolynomialSmt2([-anum.value.num, anum.value.den])} 1)`;
|
|
1003
|
+
return `(root-obj ${getUpolynomialSmt2(anum.value.p)} ${this.getRootIndex(anum)})`;
|
|
1004
|
+
}
|
|
1005
|
+
|
|
1006
|
+
displayDecimal(anum: Anum, precision: number) {
|
|
1007
|
+
if (anum.value instanceof Rational) return getRationalDecimal(anum.value, precision);
|
|
1008
|
+
const cell = anum.value;
|
|
1009
|
+
const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
|
|
1010
|
+
return (refined.isInterval ? refined.upper : refined.lower).toDecimal(precision);
|
|
1011
|
+
}
|
|
1012
|
+
|
|
1013
|
+
// Releases first.
|
|
1014
|
+
private getResultantCoeffs(first: PolynomialRef, p: Upolynomial) {
|
|
1015
|
+
const q = new PolynomialRef(this.pm);
|
|
1016
|
+
const r = new PolynomialRef(this.pm);
|
|
1017
|
+
q.set(this.pm.toPolynomial(p, Y));
|
|
1018
|
+
this.pm.resultant(first.get(), q.get(), Y, r);
|
|
1019
|
+
const coeffs = this.pm.toCoeffs(r.get());
|
|
1020
|
+
r.reset();
|
|
1021
|
+
q.reset();
|
|
1022
|
+
first.reset();
|
|
1023
|
+
return coeffs;
|
|
1024
|
+
}
|
|
1025
|
+
|
|
1026
|
+
private getVarDifference(xDegree: number, yDegree: number) {
|
|
1027
|
+
const x = new PolynomialRef(this.pm);
|
|
1028
|
+
const y = new PolynomialRef(this.pm);
|
|
1029
|
+
const difference = new PolynomialRef(this.pm);
|
|
1030
|
+
x.set(this.pm.mkVar(X, xDegree));
|
|
1031
|
+
y.set(this.pm.mkVar(Y, yDegree));
|
|
1032
|
+
difference.set(this.pm.sub(x.get(), y.get()));
|
|
1033
|
+
y.reset();
|
|
1034
|
+
x.reset();
|
|
1035
|
+
return difference;
|
|
1036
|
+
}
|
|
1037
|
+
|
|
830
1038
|
private getSumPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
|
|
831
|
-
const
|
|
832
|
-
|
|
1039
|
+
const p = new PolynomialRef(this.pm);
|
|
1040
|
+
const composed = new PolynomialRef(this.pm);
|
|
1041
|
+
p.set(this.pm.toPolynomial(first.p, X));
|
|
1042
|
+
this.pm.composeXMinusY(p.get(), Y, composed);
|
|
1043
|
+
p.reset();
|
|
1044
|
+
return this.getResultantCoeffs(composed, second.p);
|
|
833
1045
|
}
|
|
834
1046
|
|
|
835
1047
|
private getProductPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
|
|
836
|
-
const
|
|
837
|
-
|
|
1048
|
+
const p = new PolynomialRef(this.pm);
|
|
1049
|
+
const composed = new PolynomialRef(this.pm);
|
|
1050
|
+
p.set(this.pm.toPolynomial(first.p, X));
|
|
1051
|
+
composed.set(this.pm.composeXDivY(p.get(), Y));
|
|
1052
|
+
p.reset();
|
|
1053
|
+
return this.getResultantCoeffs(composed, second.p);
|
|
838
1054
|
}
|
|
839
1055
|
|
|
840
1056
|
private findIsolatingFactor(
|
|
@@ -877,6 +1093,7 @@ export class AlgebraicManager {
|
|
|
877
1093
|
const savedA = this.saveInterval(first);
|
|
878
1094
|
const savedB = this.saveInterval(second);
|
|
879
1095
|
while (true) {
|
|
1096
|
+
this.limit.checkpoint();
|
|
880
1097
|
const interval = isAdd ? INTERVAL_OPS.add(cellA, cellB) : INTERVAL_OPS.mul(cellA, cellB);
|
|
881
1098
|
const found = this.findIsolatingFactor(factors, sequences, interval);
|
|
882
1099
|
if (found !== null) {
|
|
@@ -896,8 +1113,7 @@ export class AlgebraicManager {
|
|
|
896
1113
|
}
|
|
897
1114
|
|
|
898
1115
|
private getPowerPolynomial(cell: AlgebraicCell, exponent: number) {
|
|
899
|
-
|
|
900
|
-
return this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y));
|
|
1116
|
+
return this.getResultantCoeffs(this.getVarDifference(1, exponent), cell.p);
|
|
901
1117
|
}
|
|
902
1118
|
|
|
903
1119
|
private mkPower(anum: Anum, exponent: number): Anum {
|
|
@@ -907,6 +1123,7 @@ export class AlgebraicManager {
|
|
|
907
1123
|
const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
|
|
908
1124
|
const saved = this.saveInterval(anum);
|
|
909
1125
|
while (true) {
|
|
1126
|
+
this.limit.checkpoint();
|
|
910
1127
|
const interval = getIntervalPower(cell, exponent);
|
|
911
1128
|
const found = this.findIsolatingFactor(factors, sequences, interval);
|
|
912
1129
|
if (found !== null) {
|
|
@@ -961,12 +1178,13 @@ export class AlgebraicManager {
|
|
|
961
1178
|
if (sign !== 0) return sign;
|
|
962
1179
|
if (hasSameCoeffs(cellA.p, cellB.p)) return 0;
|
|
963
1180
|
if (cellA.isMinimal && cellB.isMinimal)
|
|
964
|
-
while (
|
|
1181
|
+
while (this.limit.inc()) {
|
|
965
1182
|
this.refine(first);
|
|
966
1183
|
this.refine(second);
|
|
967
1184
|
sign = compareIntervals();
|
|
968
1185
|
if (sign !== 0) return sign;
|
|
969
1186
|
}
|
|
1187
|
+
if (!this.limit.inc()) throw new SmtCanceledError();
|
|
970
1188
|
const magnitudeA = this.getCellMagnitude(cellA);
|
|
971
1189
|
const magnitudeB = this.getCellMagnitude(cellB);
|
|
972
1190
|
const target = Math.max(MIN_MAGNITUDE, Math.min(magnitudeA, magnitudeB));
|