tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,324 @@
|
|
|
1
|
+
import { Rational } from "../rational";
|
|
2
|
+
import {
|
|
3
|
+
evalTranscendental,
|
|
4
|
+
getErrorBound,
|
|
5
|
+
PI_2_UPPER,
|
|
6
|
+
PI_UPPER,
|
|
7
|
+
type TranscendentalOp,
|
|
8
|
+
} from "../nlsat/transcendental-eval";
|
|
9
|
+
import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
|
|
10
|
+
import { NULL_LPVAR } from "./lar-solver";
|
|
11
|
+
import { LarTerm } from "./lar-term";
|
|
12
|
+
import type { NlaCore } from "./nla-core";
|
|
13
|
+
import { LemmaBuilder, mkIneq } from "./nla-types";
|
|
14
|
+
|
|
15
|
+
export interface TranscendentalApp {
|
|
16
|
+
readonly op: TranscendentalOp;
|
|
17
|
+
readonly arg: number;
|
|
18
|
+
readonly val: number;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
export interface Atan2App {
|
|
22
|
+
readonly y: number;
|
|
23
|
+
readonly x: number;
|
|
24
|
+
readonly val: number;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
// atan2 has a branch cut where it jumps by 2 pi, so its error bound is generous.
|
|
28
|
+
const getAtan2ErrorBound = (value: number) => 4096 * Number.EPSILON * Math.max(1, Math.abs(value));
|
|
29
|
+
|
|
30
|
+
// Z3's arith.nl.transcendental_tolerance.
|
|
31
|
+
const TOLERANCE = 0.0000001;
|
|
32
|
+
|
|
33
|
+
const mkTerm = (first: number, firstCoeff: number, second: number, secondCoeff: number) =>
|
|
34
|
+
new LarTerm([
|
|
35
|
+
[first, Rational.fromNumber(firstCoeff)],
|
|
36
|
+
[second, Rational.fromNumber(secondCoeff)],
|
|
37
|
+
]);
|
|
38
|
+
|
|
39
|
+
// A cheap check of the applications of transcendental functions against the LP assignment. It adds
|
|
40
|
+
// exact range bounds and linear lemmas, and leaves the polynomial refinement to nlsat, which a
|
|
41
|
+
// value away from the function by more than round-off sends the problem to.
|
|
42
|
+
export class NlaTranscendentals {
|
|
43
|
+
readonly apps: TranscendentalApp[] = [];
|
|
44
|
+
readonly atan2Apps: Atan2App[] = [];
|
|
45
|
+
piVar = NULL_LPVAR;
|
|
46
|
+
numFailures = 0;
|
|
47
|
+
|
|
48
|
+
constructor(private core: NlaCore) {}
|
|
49
|
+
|
|
50
|
+
get isEmpty() {
|
|
51
|
+
return this.apps.length === 0 && this.atan2Apps.length === 0;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private addVarBound(column: number, kind: ConstraintKind, bound: Rational) {
|
|
55
|
+
const lra = this.core.lra;
|
|
56
|
+
lra.activate(lra.mkVarBound(column, kind, bound));
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
add(op: TranscendentalOp, arg: number, val: number) {
|
|
60
|
+
if (arg === NULL_LPVAR || val === NULL_LPVAR) return;
|
|
61
|
+
this.apps.push({ op, arg, val });
|
|
62
|
+
this.core.emons.trail.push(() => this.apps.pop());
|
|
63
|
+
this.addRangeAxioms(op, val);
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
addPi(val: number) {
|
|
67
|
+
if (val === NULL_LPVAR || this.piVar !== NULL_LPVAR) return;
|
|
68
|
+
this.core.emons.trail.push(() => {
|
|
69
|
+
this.piVar = NULL_LPVAR;
|
|
70
|
+
});
|
|
71
|
+
this.piVar = val;
|
|
72
|
+
this.addVarBound(val, KIND_GE, Rational.of(31415n, 10000n));
|
|
73
|
+
this.addVarBound(val, KIND_LE, Rational.of(31416n, 10000n));
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
addAtan2(y: number, x: number, val: number) {
|
|
77
|
+
if (y === NULL_LPVAR || x === NULL_LPVAR || val === NULL_LPVAR) return;
|
|
78
|
+
this.atan2Apps.push({ y, x, val });
|
|
79
|
+
this.core.emons.trail.push(() => this.atan2Apps.pop());
|
|
80
|
+
this.addVarBound(val, KIND_LE, PI_UPPER);
|
|
81
|
+
this.addVarBound(val, KIND_GE, PI_UPPER.neg());
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
private addRangeAxioms(op: TranscendentalOp, val: number) {
|
|
85
|
+
const addBounds = (
|
|
86
|
+
lowerKind: ConstraintKind,
|
|
87
|
+
lower: Rational,
|
|
88
|
+
upperKind: ConstraintKind,
|
|
89
|
+
upper: Rational,
|
|
90
|
+
) => {
|
|
91
|
+
this.addVarBound(val, upperKind, upper);
|
|
92
|
+
this.addVarBound(val, lowerKind, lower);
|
|
93
|
+
};
|
|
94
|
+
if (op === "sin" || op === "cos") addBounds(KIND_GE, Rational.minusOne, KIND_LE, Rational.one);
|
|
95
|
+
else if (op === "tanh") addBounds(KIND_GT, Rational.minusOne, KIND_LT, Rational.one);
|
|
96
|
+
else if (op === "cosh") this.addVarBound(val, KIND_GE, Rational.one);
|
|
97
|
+
else if (op === "acosh") this.addVarBound(val, KIND_GE, Rational.zero);
|
|
98
|
+
else if (op === "asin") addBounds(KIND_GE, PI_2_UPPER.neg(), KIND_LE, PI_2_UPPER);
|
|
99
|
+
else if (op === "atan") addBounds(KIND_GT, PI_2_UPPER.neg(), KIND_LT, PI_2_UPPER);
|
|
100
|
+
else if (op === "acos") addBounds(KIND_GE, Rational.zero, KIND_LE, PI_UPPER);
|
|
101
|
+
else if (op === "exp") this.addVarBound(val, KIND_GT, Rational.zero);
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
// sin, tanh and atan vanish at 0 and are 1-Lipschitz, so they stay below x for x >= 0 and above
|
|
105
|
+
// it for x <= 0.
|
|
106
|
+
private checkLinearMajorant(app: TranscendentalApp) {
|
|
107
|
+
if (app.op !== "sin" && app.op !== "tanh" && app.op !== "atan") return false;
|
|
108
|
+
const arg = this.core.val(app.arg);
|
|
109
|
+
const val = this.core.val(app.val);
|
|
110
|
+
const difference = mkTerm(app.val, 1, app.arg, -1);
|
|
111
|
+
if (!arg.isNegative() && val.compare(arg) > 0) {
|
|
112
|
+
new LemmaBuilder(this.core)
|
|
113
|
+
.addIneq(mkIneq(app.arg, KIND_LT, 0))
|
|
114
|
+
.addIneq(mkIneq(difference, KIND_LE, 0));
|
|
115
|
+
return true;
|
|
116
|
+
}
|
|
117
|
+
if (!arg.isPositive() && val.compare(arg) < 0) {
|
|
118
|
+
new LemmaBuilder(this.core)
|
|
119
|
+
.addIneq(mkIneq(app.arg, KIND_GT, 0))
|
|
120
|
+
.addIneq(mkIneq(difference, KIND_GE, 0));
|
|
121
|
+
return true;
|
|
122
|
+
}
|
|
123
|
+
return false;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
// sin is positive on (0, pi) and negative on (-pi, 0), and cos is positive on (-pi/2, pi/2) and
|
|
127
|
+
// negative on (pi/2, 3pi/2), stated in terms of the pi column rather than its bounds.
|
|
128
|
+
private checkSignOnPiRange(app: TranscendentalApp) {
|
|
129
|
+
if (this.piVar === NULL_LPVAR || (app.op !== "sin" && app.op !== "cos")) return false;
|
|
130
|
+
const core = this.core;
|
|
131
|
+
const arg = core.val(app.arg);
|
|
132
|
+
const val = core.val(app.val);
|
|
133
|
+
const pi = core.val(this.piVar);
|
|
134
|
+
if (app.op === "sin") {
|
|
135
|
+
if (arg.isPositive() && arg.compare(pi) < 0 && !val.isPositive()) {
|
|
136
|
+
new LemmaBuilder(this.core)
|
|
137
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
138
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, -1), KIND_GE, 0))
|
|
139
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
140
|
+
return true;
|
|
141
|
+
}
|
|
142
|
+
if (arg.isNegative() && arg.compare(pi.neg()) > 0 && !val.isNegative()) {
|
|
143
|
+
new LemmaBuilder(this.core)
|
|
144
|
+
.addIneq(mkIneq(app.arg, KIND_GE, 0))
|
|
145
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, 1), KIND_LE, 0))
|
|
146
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
147
|
+
return true;
|
|
148
|
+
}
|
|
149
|
+
return false;
|
|
150
|
+
}
|
|
151
|
+
const twice = arg.mul(Rational.of(2n));
|
|
152
|
+
if (twice.compare(pi.neg()) > 0 && twice.compare(pi) < 0 && !val.isPositive()) {
|
|
153
|
+
new LemmaBuilder(this.core)
|
|
154
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, 1), KIND_LE, 0))
|
|
155
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_GE, 0))
|
|
156
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
157
|
+
return true;
|
|
158
|
+
}
|
|
159
|
+
if (twice.compare(pi) > 0 && twice.compare(pi.mul(Rational.of(3n))) < 0 && !val.isNegative()) {
|
|
160
|
+
new LemmaBuilder(this.core)
|
|
161
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_LE, 0))
|
|
162
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -3), KIND_GE, 0))
|
|
163
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
164
|
+
return true;
|
|
165
|
+
}
|
|
166
|
+
return false;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
// exp(x) >= 1 + x everywhere.
|
|
170
|
+
private checkExpLowerBound(app: TranscendentalApp) {
|
|
171
|
+
if (app.op !== "exp") return false;
|
|
172
|
+
const arg = this.core.val(app.arg);
|
|
173
|
+
if (this.core.val(app.val).compare(arg.add(Rational.one)) >= 0) return false;
|
|
174
|
+
new LemmaBuilder(this.core).addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_GE, 1));
|
|
175
|
+
return true;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
// log(x) <= x - 1 for x > 0.
|
|
179
|
+
private checkLogUpperBound(app: TranscendentalApp) {
|
|
180
|
+
if (app.op !== "log") return false;
|
|
181
|
+
const arg = this.core.val(app.arg);
|
|
182
|
+
if (!arg.isPositive() || this.core.val(app.val).compare(arg.sub(Rational.one)) <= 0)
|
|
183
|
+
return false;
|
|
184
|
+
new LemmaBuilder(this.core)
|
|
185
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
186
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_LE, -1));
|
|
187
|
+
return true;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
// x1 < x2 implies exp(x1) < exp(x2).
|
|
191
|
+
private checkExpMonotonicity(app: TranscendentalApp) {
|
|
192
|
+
if (app.op !== "exp") return false;
|
|
193
|
+
const core = this.core;
|
|
194
|
+
const arg = core.val(app.arg);
|
|
195
|
+
const val = core.val(app.val);
|
|
196
|
+
for (const other of this.apps) {
|
|
197
|
+
if (other.op !== "exp" || other.arg === app.arg) continue;
|
|
198
|
+
const otherArg = core.val(other.arg);
|
|
199
|
+
const otherVal = core.val(other.val);
|
|
200
|
+
if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
|
|
201
|
+
new LemmaBuilder(core)
|
|
202
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
|
|
203
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
|
|
204
|
+
return true;
|
|
205
|
+
}
|
|
206
|
+
if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
|
|
207
|
+
new LemmaBuilder(core)
|
|
208
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
|
|
209
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
|
|
210
|
+
return true;
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
return false;
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
// 0 < x1 < x2 implies log(x1) < log(x2).
|
|
217
|
+
private checkLogMonotonicity(app: TranscendentalApp) {
|
|
218
|
+
if (app.op !== "log") return false;
|
|
219
|
+
const core = this.core;
|
|
220
|
+
const arg = core.val(app.arg);
|
|
221
|
+
if (!arg.isPositive()) return false;
|
|
222
|
+
const val = core.val(app.val);
|
|
223
|
+
for (const other of this.apps) {
|
|
224
|
+
if (other.op !== "log" || other.arg === app.arg) continue;
|
|
225
|
+
const otherArg = core.val(other.arg);
|
|
226
|
+
if (!otherArg.isPositive()) continue;
|
|
227
|
+
const otherVal = core.val(other.val);
|
|
228
|
+
if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
|
|
229
|
+
new LemmaBuilder(core)
|
|
230
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
231
|
+
.addIneq(mkIneq(other.arg, KIND_LE, 0))
|
|
232
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
|
|
233
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
|
|
234
|
+
return true;
|
|
235
|
+
}
|
|
236
|
+
if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
|
|
237
|
+
new LemmaBuilder(core)
|
|
238
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
239
|
+
.addIneq(mkIneq(other.arg, KIND_LE, 0))
|
|
240
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
|
|
241
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
|
|
242
|
+
return true;
|
|
243
|
+
}
|
|
244
|
+
}
|
|
245
|
+
return false;
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// A value away from the function by more than round-off is a failure, which only nlsat can
|
|
249
|
+
// settle. A value outside the domain is left to the rest of the solver.
|
|
250
|
+
private checkApp(app: TranscendentalApp) {
|
|
251
|
+
if (
|
|
252
|
+
this.checkLinearMajorant(app) ||
|
|
253
|
+
this.checkSignOnPiRange(app) ||
|
|
254
|
+
this.checkExpLowerBound(app) ||
|
|
255
|
+
this.checkExpMonotonicity(app) ||
|
|
256
|
+
this.checkLogUpperBound(app) ||
|
|
257
|
+
this.checkLogMonotonicity(app)
|
|
258
|
+
)
|
|
259
|
+
return true;
|
|
260
|
+
const arg = this.core.val(app.arg).toDouble();
|
|
261
|
+
const result = evalTranscendental(app.op, arg);
|
|
262
|
+
if (!Number.isFinite(result)) return false;
|
|
263
|
+
const distance = Math.abs(this.core.val(app.val).toDouble() - result);
|
|
264
|
+
if (distance > getErrorBound(app.op, arg, result)) this.numFailures++;
|
|
265
|
+
return false;
|
|
266
|
+
}
|
|
267
|
+
|
|
268
|
+
// sign(atan2(y, x)) = sign(y) for y != 0. Past that, a value away from atan2 by more than the
|
|
269
|
+
// tolerance splits on x.
|
|
270
|
+
private checkAtan2(app: Atan2App) {
|
|
271
|
+
const core = this.core;
|
|
272
|
+
const y = core.val(app.y);
|
|
273
|
+
const x = core.val(app.x);
|
|
274
|
+
const val = core.val(app.val);
|
|
275
|
+
if (y.isPositive() && !val.isPositive()) {
|
|
276
|
+
new LemmaBuilder(this.core)
|
|
277
|
+
.addIneq(mkIneq(app.y, KIND_LE, 0))
|
|
278
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
279
|
+
return true;
|
|
280
|
+
}
|
|
281
|
+
if (y.isNegative() && !val.isNegative()) {
|
|
282
|
+
new LemmaBuilder(this.core)
|
|
283
|
+
.addIneq(mkIneq(app.y, KIND_GE, 0))
|
|
284
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
285
|
+
return true;
|
|
286
|
+
}
|
|
287
|
+
const result = Math.atan2(y.toDouble(), x.toDouble());
|
|
288
|
+
if (!Number.isFinite(result)) return false;
|
|
289
|
+
const distance = Math.abs(val.toDouble() - result);
|
|
290
|
+
const error = getAtan2ErrorBound(result);
|
|
291
|
+
if (distance <= error) return false;
|
|
292
|
+
this.numFailures++;
|
|
293
|
+
if (distance <= error + TOLERANCE) return false;
|
|
294
|
+
core.literals.push(mkIneq(app.x, KIND_LE, x));
|
|
295
|
+
return true;
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
check() {
|
|
299
|
+
if (this.isEmpty || this.core.isUsingNraModel) return;
|
|
300
|
+
for (const app of this.apps) if (this.checkApp(app)) return;
|
|
301
|
+
for (const app of this.atan2Apps) if (this.checkAtan2(app)) return;
|
|
302
|
+
}
|
|
303
|
+
|
|
304
|
+
isNraModelValid() {
|
|
305
|
+
const core = this.core;
|
|
306
|
+
if (!core.isUsingNraModel) return false;
|
|
307
|
+
const getMiddle = (lpVar: number) => {
|
|
308
|
+
const [low, high] = core.nra.am.getInterval(core.nra.value(lpVar), 64);
|
|
309
|
+
return low.add(high).div(Rational.of(2n)).toDouble();
|
|
310
|
+
};
|
|
311
|
+
for (const app of this.apps) {
|
|
312
|
+
const arg = getMiddle(app.arg);
|
|
313
|
+
const result = evalTranscendental(app.op, arg);
|
|
314
|
+
if (!Number.isFinite(result)) continue;
|
|
315
|
+
if (Math.abs(getMiddle(app.val) - result) > getErrorBound(app.op, arg, result)) return false;
|
|
316
|
+
}
|
|
317
|
+
for (const app of this.atan2Apps) {
|
|
318
|
+
const result = Math.atan2(getMiddle(app.y), getMiddle(app.x));
|
|
319
|
+
if (!Number.isFinite(result)) continue;
|
|
320
|
+
if (Math.abs(getMiddle(app.val) - result) > getAtan2ErrorBound(result)) return false;
|
|
321
|
+
}
|
|
322
|
+
return true;
|
|
323
|
+
}
|
|
324
|
+
}
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_types.h, src/math/lp/nla_defs.h, src/math/lp/nla_common.h, and
|
|
2
|
-
// lemma_builder of src/math/lp/nla_core.cpp), MIT license, see z3-license.txt.
|
|
3
1
|
import { Rational } from "../rational";
|
|
4
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
5
3
|
import { Explanation } from "./explanation";
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/var_eqs.h, src/math/lp/nla_defs.h), MIT license, see z3-license.txt.
|
|
2
1
|
import type { Dependency } from "./dependency";
|
|
3
2
|
import type { Explanation } from "./explanation";
|
|
4
3
|
import { TrailStack, UnionFind, type UnionFindHandler } from "./union-find";
|
|
@@ -1,9 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
// z3-license.txt.
|
|
3
|
-
// Deviations from Z3: unsupported nlsat input answers unknown where Z3 exits (levelwise.cpp,
|
|
4
|
-
// add_linear_approximations), check_assignment has no satisfied branch and no add_mul_def, the
|
|
5
|
-
// budget counts only nlsat's own steps, and transcendental functions are not supported.
|
|
6
|
-
import { NlsatUnsupportedError, SmtInvariantError } from "../../../../errors";
|
|
1
|
+
import { NlsatUnsupportedError, SmtCanceledError, SmtInvariantError } from "../../../../errors";
|
|
7
2
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
8
3
|
import { Rational, getLcm } from "../rational";
|
|
9
4
|
import { Anum } from "../nlsat/algebraic";
|
|
@@ -20,7 +15,7 @@ import {
|
|
|
20
15
|
type LarConstraint,
|
|
21
16
|
} from "./constraints";
|
|
22
17
|
import { Explanation } from "./explanation";
|
|
23
|
-
import type
|
|
18
|
+
import { type LarSolver, NULL_LPVAR } from "./lar-solver";
|
|
24
19
|
import { LarTerm } from "./lar-term";
|
|
25
20
|
import type { NlaCore } from "./nla-core";
|
|
26
21
|
import { LemmaBuilder, mkIneq } from "./nla-types";
|
|
@@ -50,7 +45,12 @@ const getConeOfInfluence = (core: NlaCore) => {
|
|
|
50
45
|
for (const lpVar of monic.vars) getOccurrences(lpVar).monics.push(monic.variable);
|
|
51
46
|
for (const term of lra.terms)
|
|
52
47
|
for (const entry of term.coeffs) getOccurrences(entry[0]).terms.push(term.column);
|
|
53
|
-
|
|
48
|
+
// The applications of transcendental functions are neither monomials nor terms.
|
|
49
|
+
const todo = [
|
|
50
|
+
...core.transcendentals.apps.flatMap((app) => [app.arg, app.val]),
|
|
51
|
+
...core.transcendentals.atan2Apps.flatMap((app) => [app.y, app.x, app.val]),
|
|
52
|
+
...core.toRefine.elems,
|
|
53
|
+
];
|
|
54
54
|
const vars = new Set<number>();
|
|
55
55
|
const constraints = new Set<number>();
|
|
56
56
|
const monics = new Set<number>();
|
|
@@ -83,6 +83,9 @@ const hasLargeDyadicDenominator = (value: Rational) => {
|
|
|
83
83
|
return den >= 1n << 24n && (den & (den - 1n)) === 0n;
|
|
84
84
|
};
|
|
85
85
|
|
|
86
|
+
const getSortedVars = (vars: readonly number[]) =>
|
|
87
|
+
[...vars].sort((first, second) => first - second);
|
|
88
|
+
|
|
86
89
|
const isDyadicArtifact = (lra: LarSolver, constraint: LarConstraint) =>
|
|
87
90
|
constraint.isAuxiliary &&
|
|
88
91
|
(hasLargeDyadicDenominator(constraint.rhs.x) ||
|
|
@@ -92,6 +95,8 @@ export class NraSolver {
|
|
|
92
95
|
private solver = new NlsatSolver();
|
|
93
96
|
private values: Anum[] = [];
|
|
94
97
|
private lp2nl = new Map<number, number>();
|
|
98
|
+
private literal2constraint = new Map<number, number>();
|
|
99
|
+
private vars2mon = new Map<string, number>();
|
|
95
100
|
|
|
96
101
|
constructor(private core: NlaCore) {}
|
|
97
102
|
|
|
@@ -99,8 +104,10 @@ export class NraSolver {
|
|
|
99
104
|
return this.solver.am;
|
|
100
105
|
}
|
|
101
106
|
|
|
102
|
-
|
|
103
|
-
|
|
107
|
+
private reset() {
|
|
108
|
+
this.solver = new NlsatSolver(this.core.nraLimit);
|
|
109
|
+
this.values = [];
|
|
110
|
+
this.lp2nl.clear();
|
|
104
111
|
}
|
|
105
112
|
|
|
106
113
|
private mkDefinitions(isIncluded: (lpVar: number) => boolean) {
|
|
@@ -187,13 +194,36 @@ export class NraSolver {
|
|
|
187
194
|
return literal;
|
|
188
195
|
}
|
|
189
196
|
|
|
190
|
-
|
|
197
|
+
private getNlVar(lpVar: number) {
|
|
198
|
+
const variable = this.lp2nl.get(lpVar) ?? this.solver.mkVar(this.core.lra.isInt(lpVar));
|
|
199
|
+
this.lp2nl.set(lpVar, variable);
|
|
200
|
+
return variable;
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
private registerTranscendentals() {
|
|
204
|
+
const transcendentals = this.core.transcendentals;
|
|
205
|
+
const solver = this.solver.transcendentals;
|
|
206
|
+
for (const app of transcendentals.apps)
|
|
207
|
+
solver.add(app.op, this.getNlVar(app.arg), this.getNlVar(app.val));
|
|
208
|
+
for (const app of transcendentals.atan2Apps)
|
|
209
|
+
solver.addAtan2(this.getNlVar(app.y), this.getNlVar(app.x), this.getNlVar(app.val));
|
|
210
|
+
if (transcendentals.piVar !== NULL_LPVAR) solver.addPi(this.getNlVar(transcendentals.piVar));
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
check(maxConflicts: number) {
|
|
214
|
+
try {
|
|
215
|
+
return this.checkCore(maxConflicts);
|
|
216
|
+
} catch (error) {
|
|
217
|
+
if (error instanceof SmtCanceledError && this.core.nraLimit.isExhausted()) return L_UNDEF;
|
|
218
|
+
throw error;
|
|
219
|
+
}
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
private checkCore(maxConflicts: number) {
|
|
191
223
|
const core = this.core;
|
|
192
224
|
const lra = core.lra;
|
|
193
|
-
this.
|
|
225
|
+
this.reset();
|
|
194
226
|
this.solver.maxConflicts = maxConflicts;
|
|
195
|
-
this.values = [];
|
|
196
|
-
this.lp2nl.clear();
|
|
197
227
|
const cone = getConeOfInfluence(core);
|
|
198
228
|
const definitions = this.mkDefinitions((lpVar) => cone.vars.has(lpVar));
|
|
199
229
|
const skipped = new Set<number>();
|
|
@@ -204,14 +234,8 @@ export class NraSolver {
|
|
|
204
234
|
}
|
|
205
235
|
this.addConstraint(constraintIndex, definitions.definitions, definitions.denominators);
|
|
206
236
|
}
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
return this.solver.check();
|
|
210
|
-
} catch (error) {
|
|
211
|
-
if (error instanceof NlsatUnsupportedError) return L_UNDEF;
|
|
212
|
-
throw error;
|
|
213
|
-
}
|
|
214
|
-
})();
|
|
237
|
+
this.registerTranscendentals();
|
|
238
|
+
const result = this.solver.check();
|
|
215
239
|
if (result === L_TRUE) {
|
|
216
240
|
this.solver.restoreOrder();
|
|
217
241
|
core.setUseNraModel(true);
|
|
@@ -299,49 +323,93 @@ export class NraSolver {
|
|
|
299
323
|
: sign === 0;
|
|
300
324
|
}
|
|
301
325
|
|
|
302
|
-
private
|
|
326
|
+
private setupAssignmentSolver() {
|
|
303
327
|
const core = this.core;
|
|
304
328
|
const lra = core.lra;
|
|
305
|
-
this.
|
|
306
|
-
this.
|
|
329
|
+
this.reset();
|
|
330
|
+
this.literal2constraint.clear();
|
|
331
|
+
this.vars2mon.clear();
|
|
307
332
|
const cone = getConeOfInfluence(core);
|
|
308
333
|
const definitions = this.mkDefinitions(() => true);
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
334
|
+
for (let lpVar = 0; lpVar < lra.columns.length; lpVar++) {
|
|
335
|
+
this.values.push(new Anum(core.val(lpVar)));
|
|
336
|
+
if (core.emons.isMonicVar(lpVar))
|
|
337
|
+
this.vars2mon.set(getSortedVars(core.emons.get(lpVar).vars).join(","), lpVar);
|
|
338
|
+
}
|
|
312
339
|
for (const constraintIndex of cone.constraints) {
|
|
313
340
|
const literal = this.addConstraint(
|
|
314
341
|
constraintIndex,
|
|
315
342
|
definitions.definitions,
|
|
316
343
|
definitions.denominators,
|
|
317
344
|
);
|
|
318
|
-
|
|
345
|
+
this.literal2constraint.set(literal, constraintIndex);
|
|
319
346
|
}
|
|
320
|
-
|
|
321
|
-
if (result.result !== L_FALSE) return null;
|
|
322
|
-
return { clause: result.clause, literalConstraints };
|
|
347
|
+
this.registerTranscendentals();
|
|
323
348
|
}
|
|
324
349
|
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
350
|
+
private processPolynomialCheckAssignment(
|
|
351
|
+
polynomial: Polynomial,
|
|
352
|
+
nl2lp: readonly number[],
|
|
353
|
+
term: LarTerm,
|
|
354
|
+
) {
|
|
355
|
+
let bound = Rational.zero;
|
|
356
|
+
for (let index = 0; index < polynomial.size; index++) {
|
|
357
|
+
const monomial = polynomial.ms[index];
|
|
358
|
+
const coeff = Rational.of(polynomial.as[index]);
|
|
359
|
+
// A linear cell leaves every new lemma polynomial linear, so like Z3 this ignores degrees.
|
|
360
|
+
if (monomial.size === 0) bound = bound.sub(coeff);
|
|
361
|
+
else if (monomial.size === 1) term.addMonomial(coeff, nl2lp[monomial.vars[0]]);
|
|
362
|
+
else {
|
|
363
|
+
const vars = getSortedVars(monomial.vars.map((variable) => nl2lp[variable]));
|
|
364
|
+
term.addMonomial(coeff, this.vars2mon.get(vars.join(",")) ?? this.core.addMulDef(vars));
|
|
332
365
|
}
|
|
333
|
-
}
|
|
334
|
-
|
|
335
|
-
return this.addLemma(clause.clause, clause.literalConstraints);
|
|
366
|
+
}
|
|
367
|
+
return bound;
|
|
336
368
|
}
|
|
337
369
|
|
|
338
|
-
private
|
|
370
|
+
private reverseLp2nl() {
|
|
371
|
+
const nl2lp: number[] = [];
|
|
372
|
+
for (const entry of this.lp2nl) nl2lp[entry[1]] = entry[0];
|
|
373
|
+
return nl2lp;
|
|
374
|
+
}
|
|
375
|
+
|
|
376
|
+
checkAssignment() {
|
|
377
|
+
try {
|
|
378
|
+
return this.checkAssignmentCore();
|
|
379
|
+
} catch (error) {
|
|
380
|
+
// Deviation from Z3: a linear cell around an irrational section answers unknown, where Z3 exits.
|
|
381
|
+
if (error instanceof NlsatUnsupportedError) return L_UNDEF;
|
|
382
|
+
if (error instanceof SmtCanceledError && this.core.nraLimit.isExhausted()) return L_UNDEF;
|
|
383
|
+
throw error;
|
|
384
|
+
}
|
|
385
|
+
}
|
|
386
|
+
|
|
387
|
+
private checkAssignmentCore() {
|
|
388
|
+
const core = this.core;
|
|
389
|
+
const lra = core.lra;
|
|
390
|
+
this.setupAssignmentSolver();
|
|
391
|
+
const result = this.solver.checkAssignment(this.values);
|
|
392
|
+
if (result.result === L_TRUE) {
|
|
393
|
+
core.setUseNraModel(true);
|
|
394
|
+
lra.initModel();
|
|
395
|
+
for (const constraint of lra.constraints.constraints)
|
|
396
|
+
if (constraint.isActive && !this.isConstraintSatisfied(constraint)) return L_UNDEF;
|
|
397
|
+
for (const monic of core.emons.monics)
|
|
398
|
+
if (!this.isMonicSatisfied(monic.variable, monic.vars)) return L_UNDEF;
|
|
399
|
+
core.setUseNraModel(true);
|
|
400
|
+
}
|
|
401
|
+
if (result.result === L_FALSE) return this.addLemma(result.clause);
|
|
402
|
+
return result.result;
|
|
403
|
+
}
|
|
404
|
+
|
|
405
|
+
private addLemma(clause: readonly number[]) {
|
|
339
406
|
const core = this.core;
|
|
340
407
|
const solver = this.solver;
|
|
341
|
-
const
|
|
408
|
+
const nl2lp = this.reverseLp2nl();
|
|
409
|
+
let result = L_FALSE;
|
|
342
410
|
const lemma = new LemmaBuilder(core);
|
|
343
411
|
for (const literal of clause) {
|
|
344
|
-
const constraintIndex =
|
|
412
|
+
const constraintIndex = this.literal2constraint.get(literal ^ 1);
|
|
345
413
|
if (constraintIndex !== undefined) {
|
|
346
414
|
const explanation = new Explanation();
|
|
347
415
|
explanation.push(constraintIndex);
|
|
@@ -350,23 +418,12 @@ export class NraSolver {
|
|
|
350
418
|
}
|
|
351
419
|
const atom = solver.getAtom(literal);
|
|
352
420
|
if (atom === null) throw new SmtInvariantError(`nlsat literal ${literal} has no atom`);
|
|
353
|
-
if (
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
pm.totalDegree(atom.polynomials[0]) > 1
|
|
357
|
-
) {
|
|
358
|
-
core.lemmas.pop();
|
|
359
|
-
return L_UNDEF;
|
|
421
|
+
if (!isIneqAtom(atom) || atom.polynomials.length !== 1) {
|
|
422
|
+
result = L_UNDEF;
|
|
423
|
+
break;
|
|
360
424
|
}
|
|
361
|
-
const polynomial = atom.polynomials[0];
|
|
362
425
|
const term = new LarTerm();
|
|
363
|
-
|
|
364
|
-
for (let index = 0; index < polynomial.size; index++) {
|
|
365
|
-
const monomial = polynomial.ms[index];
|
|
366
|
-
const coeff = Rational.of(polynomial.as[index]);
|
|
367
|
-
if (monomial.size === 0) bound = bound.sub(coeff);
|
|
368
|
-
else term.addMonomial(coeff, monomial.vars[0]);
|
|
369
|
-
}
|
|
426
|
+
const bound = this.processPolynomialCheckAssignment(atom.polynomials[0], nl2lp, term);
|
|
370
427
|
const isNegated = (literal & 1) === 1;
|
|
371
428
|
const kind =
|
|
372
429
|
atom.kind === "EQ"
|
|
@@ -382,12 +439,13 @@ export class NraSolver {
|
|
|
382
439
|
: KIND_GT;
|
|
383
440
|
const ineq = mkIneq(term, kind, bound);
|
|
384
441
|
if (core.ineqHolds(ineq)) {
|
|
385
|
-
|
|
386
|
-
|
|
442
|
+
result = L_UNDEF;
|
|
443
|
+
break;
|
|
387
444
|
}
|
|
388
445
|
lemma.addIneq(ineq);
|
|
389
446
|
}
|
|
390
|
-
core.isCheckFeasible = true;
|
|
391
|
-
|
|
447
|
+
if (result === L_FALSE) core.isCheckFeasible = true;
|
|
448
|
+
if (result === L_UNDEF) core.lemmas.pop();
|
|
449
|
+
return result;
|
|
392
450
|
}
|
|
393
451
|
}
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/dd/pdd_interval.h), MIT license, see z3-license.txt.
|
|
2
1
|
import {
|
|
3
2
|
add,
|
|
4
3
|
type DepInterval,
|
|
@@ -20,8 +19,12 @@ export const getPddInterval = (
|
|
|
20
19
|
return result;
|
|
21
20
|
}
|
|
22
21
|
const varInterval = getVarInterval(poly.var(), mode);
|
|
23
|
-
const
|
|
24
|
-
const
|
|
22
|
+
const hiPoly = poly.hi();
|
|
23
|
+
const hi = getPddInterval(hiPoly, mode, getVarInterval);
|
|
24
|
+
hiPoly.release();
|
|
25
|
+
const loPoly = poly.lo();
|
|
26
|
+
const lo = getPddInterval(loPoly, mode, getVarInterval);
|
|
27
|
+
loPoly.release();
|
|
25
28
|
const product = mkDepInterval();
|
|
26
29
|
mul(hi, varInterval, product, mode);
|
|
27
30
|
add(product, lo, result, mode);
|