tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79
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 +47 -44
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +44 -41
- 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 +474 -718
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +8 -7
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +244 -238
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +49 -702
- 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 +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +31 -106
- package/src/exit-codes.ts +2 -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 +616 -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 +10 -30
- package/src/parallel.ts +50 -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 +9 -5
- 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 +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- 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 +15 -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 +206 -44
- 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 +22 -47
- 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 +54 -26
- 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,653 @@
|
|
|
1
|
+
import {
|
|
2
|
+
FAMILY_ARITH,
|
|
3
|
+
OP_ABS,
|
|
4
|
+
OP_ADD,
|
|
5
|
+
OP_DIV,
|
|
6
|
+
OP_DIV0,
|
|
7
|
+
OP_GE,
|
|
8
|
+
OP_GT,
|
|
9
|
+
OP_IDIV,
|
|
10
|
+
OP_IDIV0,
|
|
11
|
+
OP_IS_INT,
|
|
12
|
+
OP_LE,
|
|
13
|
+
OP_LT,
|
|
14
|
+
OP_MOD,
|
|
15
|
+
OP_MOD0,
|
|
16
|
+
OP_MUL,
|
|
17
|
+
OP_NUM,
|
|
18
|
+
OP_POWER,
|
|
19
|
+
OP_POWER0,
|
|
20
|
+
OP_REM,
|
|
21
|
+
OP_SUB,
|
|
22
|
+
OP_TO_INT,
|
|
23
|
+
OP_TO_REAL,
|
|
24
|
+
OP_UMINUS,
|
|
25
|
+
SORT_INT,
|
|
26
|
+
} from "../ast";
|
|
27
|
+
import { getExtendedNumeral } from "../ast-util";
|
|
28
|
+
import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "../lp/constraints";
|
|
29
|
+
import { LarSolver, NULL_LPVAR } from "../lp/lar-solver";
|
|
30
|
+
import { NlaCore } from "../lp/nla-core";
|
|
31
|
+
import { Rational } from "../rational";
|
|
32
|
+
import { type Enode, NULL_THEORY_VAR } from "./egraph";
|
|
33
|
+
import type { EufSolver } from "./euf-solver";
|
|
34
|
+
import { ThSolver } from "./th-solver";
|
|
35
|
+
|
|
36
|
+
// lp_api::bound<sat::literal>: lit means that the variable is at least, or at most, the value.
|
|
37
|
+
export interface ArithBound {
|
|
38
|
+
readonly lit: number;
|
|
39
|
+
readonly thVar: number;
|
|
40
|
+
readonly column: number;
|
|
41
|
+
readonly isInt: boolean;
|
|
42
|
+
readonly value: Rational;
|
|
43
|
+
readonly isLower: boolean;
|
|
44
|
+
readonly constraintTrue: number;
|
|
45
|
+
readonly constraintFalse: number;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
export const SOURCE_INEQUALITY = 0;
|
|
49
|
+
export const SOURCE_EQUALITY = 1;
|
|
50
|
+
const SOURCE_DEFINITION = 2;
|
|
51
|
+
|
|
52
|
+
interface InternalizeState {
|
|
53
|
+
terms: number[];
|
|
54
|
+
coeffs: Rational[];
|
|
55
|
+
vars: number[];
|
|
56
|
+
toEnsureEnode: number[];
|
|
57
|
+
toEnsureVar: number[];
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
const mkInternalizeState = (): InternalizeState => ({
|
|
61
|
+
terms: [],
|
|
62
|
+
coeffs: [],
|
|
63
|
+
vars: [],
|
|
64
|
+
toEnsureEnode: [],
|
|
65
|
+
toEnsureVar: [],
|
|
66
|
+
});
|
|
67
|
+
|
|
68
|
+
const MAX_POWER_DEGREE = 10;
|
|
69
|
+
|
|
70
|
+
export const isUnderspecified = (op: number) =>
|
|
71
|
+
op === OP_DIV ||
|
|
72
|
+
op === OP_IDIV ||
|
|
73
|
+
op === OP_REM ||
|
|
74
|
+
op === OP_MOD ||
|
|
75
|
+
op === OP_DIV0 ||
|
|
76
|
+
op === OP_IDIV0 ||
|
|
77
|
+
op === OP_MOD0;
|
|
78
|
+
|
|
79
|
+
export abstract class ArithInternalize extends ThSolver {
|
|
80
|
+
protected abstract mkToIntAxiom(expr: number): void;
|
|
81
|
+
protected abstract mkAbsAxiom(expr: number): void;
|
|
82
|
+
protected abstract mkIdivModAxioms(dividend: number, divisor: number): void;
|
|
83
|
+
protected abstract mkRemAxiom(dividend: number, divisor: number): void;
|
|
84
|
+
protected abstract mkDivAxiom(dividend: number, divisor: number): void;
|
|
85
|
+
protected abstract mkPowerAxiom(power: number, base: number, exponent: number): void;
|
|
86
|
+
protected abstract mkPower0Axioms(power: number, base: number): void;
|
|
87
|
+
protected abstract mkIsIntAxiom(expr: number): void;
|
|
88
|
+
protected abstract reportEqualityOfFixedVars(first: number, second: number): void;
|
|
89
|
+
|
|
90
|
+
protected readonly solver: LarSolver;
|
|
91
|
+
protected nla: NlaCore | undefined;
|
|
92
|
+
private isInternalizeInitialized = false;
|
|
93
|
+
protected oneVar = NULL_LPVAR;
|
|
94
|
+
protected zeroVar = NULL_LPVAR;
|
|
95
|
+
protected realOneVar = NULL_LPVAR;
|
|
96
|
+
protected realZeroVar = NULL_LPVAR;
|
|
97
|
+
protected constraintSources: number[] = [];
|
|
98
|
+
protected inequalities: number[] = [];
|
|
99
|
+
protected equalities: ([Enode, Enode] | undefined)[] = [];
|
|
100
|
+
protected notHandled: number | null = null;
|
|
101
|
+
protected underspecified: number[] = [];
|
|
102
|
+
protected idivTerms: number[] = [];
|
|
103
|
+
protected boolVar2bound = new Map<number, ArithBound>();
|
|
104
|
+
protected bounds: ArithBound[][] = [];
|
|
105
|
+
protected unassignedBounds: number[] = [];
|
|
106
|
+
protected boundsTrail: number[] = [];
|
|
107
|
+
protected newBounds: ArithBound[] = [];
|
|
108
|
+
protected isNewEq = false;
|
|
109
|
+
protected value2var = new Map<string, number>();
|
|
110
|
+
protected scopes: { boundsLim: number; assertedQhead: number; assertedLim: number }[] = [];
|
|
111
|
+
|
|
112
|
+
constructor(ctx: EufSolver, id: number) {
|
|
113
|
+
super(ctx, "arith", id);
|
|
114
|
+
this.solver = new LarSolver(() => !ctx.manager.limit.inc());
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
protected isIntVar(thVar: number) {
|
|
118
|
+
return this.manager.isInt(this.var2expr(thVar));
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
protected isBoolVar(thVar: number) {
|
|
122
|
+
return this.manager.isBool(this.var2expr(thVar));
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
internalize(expr: number, isSign: boolean, _isRoot: boolean) {
|
|
126
|
+
this.initInternalize();
|
|
127
|
+
this.internalizeAtom(expr);
|
|
128
|
+
const lit = this.expr2literal(expr);
|
|
129
|
+
return isSign ? lit ^ 1 : lit;
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
internalizeTerm(expr: number) {
|
|
133
|
+
this.initInternalize();
|
|
134
|
+
if (this.manager.isBool(expr)) this.internalizeAtom(expr);
|
|
135
|
+
else this.internalizeArithTerm(expr);
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
private initInternalize() {
|
|
139
|
+
this.forcePush();
|
|
140
|
+
if (this.isInternalizeInitialized) return;
|
|
141
|
+
this.getOne(true);
|
|
142
|
+
this.getOne(false);
|
|
143
|
+
this.getZero(true);
|
|
144
|
+
this.getZero(false);
|
|
145
|
+
this.ctx.trail.push(() => {
|
|
146
|
+
this.isInternalizeInitialized = false;
|
|
147
|
+
});
|
|
148
|
+
this.isInternalizeInitialized = true;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
protected getOne(isInt: boolean) {
|
|
152
|
+
if (isInt)
|
|
153
|
+
return this.oneVar !== NULL_LPVAR ? this.oneVar : (this.oneVar = this.addConst(1n, true));
|
|
154
|
+
return this.realOneVar !== NULL_LPVAR
|
|
155
|
+
? this.realOneVar
|
|
156
|
+
: (this.realOneVar = this.addConst(1n, false));
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
protected getZero(isInt: boolean) {
|
|
160
|
+
if (isInt)
|
|
161
|
+
return this.zeroVar !== NULL_LPVAR ? this.zeroVar : (this.zeroVar = this.addConst(0n, true));
|
|
162
|
+
return this.realZeroVar !== NULL_LPVAR
|
|
163
|
+
? this.realZeroVar
|
|
164
|
+
: (this.realZeroVar = this.addConst(0n, false));
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
private addConst(value: bigint, isInt: boolean) {
|
|
168
|
+
const manager = this.manager;
|
|
169
|
+
const constant = isInt ? manager.mkNumeral(value) : manager.mkRealNumeral(Rational.of(value));
|
|
170
|
+
const restore = () => {
|
|
171
|
+
if (isInt) {
|
|
172
|
+
if (value === 1n) this.oneVar = NULL_LPVAR;
|
|
173
|
+
else this.zeroVar = NULL_LPVAR;
|
|
174
|
+
} else if (value === 1n) this.realOneVar = NULL_LPVAR;
|
|
175
|
+
else this.realZeroVar = NULL_LPVAR;
|
|
176
|
+
};
|
|
177
|
+
this.ctx.trail.push(restore);
|
|
178
|
+
this.mkArithEnode(constant);
|
|
179
|
+
const thVar = this.mkEvar(constant);
|
|
180
|
+
const column = this.solver.addVar(thVar, isInt);
|
|
181
|
+
this.addDefConstraintAndEquality(column, KIND_GE, Rational.of(value));
|
|
182
|
+
this.addDefConstraintAndEquality(column, KIND_LE, Rational.of(value));
|
|
183
|
+
return column;
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
protected ensureNla() {
|
|
187
|
+
if (this.nla !== undefined) return this.nla;
|
|
188
|
+
const nla = new NlaCore(this.solver, this.manager.limit);
|
|
189
|
+
for (let index = 0; index < this.scopes.length; index++) nla.push();
|
|
190
|
+
this.nla = nla;
|
|
191
|
+
return nla;
|
|
192
|
+
}
|
|
193
|
+
|
|
194
|
+
protected foundUnsupported(expr: number) {
|
|
195
|
+
const saved = this.notHandled;
|
|
196
|
+
this.ctx.trail.push(() => {
|
|
197
|
+
this.notHandled = saved;
|
|
198
|
+
});
|
|
199
|
+
this.notHandled = expr;
|
|
200
|
+
}
|
|
201
|
+
|
|
202
|
+
private foundUnderspecified(expr: number) {
|
|
203
|
+
const manager = this.manager;
|
|
204
|
+
const op = manager.getOp(expr);
|
|
205
|
+
if (isUnderspecified(op)) {
|
|
206
|
+
this.ctx.trail.push(() => this.underspecified.pop());
|
|
207
|
+
this.underspecified.push(expr);
|
|
208
|
+
}
|
|
209
|
+
const dividend = manager.getArg(expr, 0);
|
|
210
|
+
const zero = manager.mkNumeral(0n);
|
|
211
|
+
const sort = manager.sorts[expr];
|
|
212
|
+
const pair =
|
|
213
|
+
op === OP_DIV
|
|
214
|
+
? [expr, manager.mkApp(OP_DIV0, manager.getArgs(expr), sort)]
|
|
215
|
+
: op === OP_IDIV
|
|
216
|
+
? [expr, manager.mkApp(OP_IDIV0, manager.getArgs(expr), sort)]
|
|
217
|
+
: op === OP_REM
|
|
218
|
+
? [
|
|
219
|
+
manager.mkApp(OP_REM, [dividend, zero], sort),
|
|
220
|
+
manager.mkApp(OP_MOD0, [dividend, zero], sort),
|
|
221
|
+
]
|
|
222
|
+
: op === OP_MOD
|
|
223
|
+
? [
|
|
224
|
+
manager.mkApp(OP_MOD, [dividend, zero], sort),
|
|
225
|
+
manager.mkApp(OP_MOD0, [dividend, zero], sort),
|
|
226
|
+
]
|
|
227
|
+
: op === OP_POWER
|
|
228
|
+
? [expr, manager.mkApp(OP_POWER0, manager.getArgs(expr), sort)]
|
|
229
|
+
: null;
|
|
230
|
+
if (pair !== null) this.addUnit(this.eqInternalize(pair[0], pair[1]));
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
protected registerVar(thVar: number) {
|
|
234
|
+
const column = this.solver.externalToLocalColumn(thVar);
|
|
235
|
+
return column !== NULL_LPVAR ? column : this.solver.addVar(thVar, this.isIntVar(thVar));
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private linearize(state: InternalizeState) {
|
|
239
|
+
const manager = this.manager;
|
|
240
|
+
const terms = state.terms;
|
|
241
|
+
const coeffs = state.coeffs;
|
|
242
|
+
const vars = state.vars;
|
|
243
|
+
const push = (term: number, coeff: Rational) => {
|
|
244
|
+
terms.push(term);
|
|
245
|
+
coeffs.push(coeff);
|
|
246
|
+
};
|
|
247
|
+
const addVar = (index: number, thVar: number) => {
|
|
248
|
+
coeffs[vars.length] = coeffs[index];
|
|
249
|
+
vars.push(thVar);
|
|
250
|
+
};
|
|
251
|
+
let index = 0;
|
|
252
|
+
while (index < terms.length) {
|
|
253
|
+
const term = terms[index];
|
|
254
|
+
state.toEnsureEnode.push(term);
|
|
255
|
+
const op = manager.getFamily(term) === FAMILY_ARITH ? manager.getOp(term) : -1;
|
|
256
|
+
const numArgs = op === -1 ? 0 : manager.getNumArgs(term);
|
|
257
|
+
const firstFactor =
|
|
258
|
+
op === OP_MUL && numArgs === 2
|
|
259
|
+
? getExtendedNumeral(manager, manager.getArg(term, 0))
|
|
260
|
+
: undefined;
|
|
261
|
+
const secondFactor =
|
|
262
|
+
op === OP_MUL && numArgs === 2 && firstFactor === undefined
|
|
263
|
+
? getExtendedNumeral(manager, manager.getArg(term, 1))
|
|
264
|
+
: undefined;
|
|
265
|
+
const degree =
|
|
266
|
+
op === OP_POWER && manager.isApp(manager.getArg(term, 0))
|
|
267
|
+
? getExtendedNumeral(manager, manager.getArg(term, 1))
|
|
268
|
+
: undefined;
|
|
269
|
+
if (op === OP_ADD) {
|
|
270
|
+
for (const arg of manager.getArgs(term)) push(arg, coeffs[index]);
|
|
271
|
+
if (terms.length !== index + 1) {
|
|
272
|
+
terms[index] = terms[terms.length - 1];
|
|
273
|
+
coeffs[index] = coeffs[coeffs.length - 1];
|
|
274
|
+
terms.pop();
|
|
275
|
+
coeffs.pop();
|
|
276
|
+
}
|
|
277
|
+
} else if (op === OP_SUB) {
|
|
278
|
+
terms[index] = manager.getArg(term, 0);
|
|
279
|
+
for (let position = 1; position < numArgs; position++)
|
|
280
|
+
push(manager.getArg(term, position), coeffs[index].neg());
|
|
281
|
+
} else if (firstFactor !== undefined) {
|
|
282
|
+
coeffs[index] = coeffs[index].mul(firstFactor);
|
|
283
|
+
terms[index] = manager.getArg(term, 1);
|
|
284
|
+
state.toEnsureEnode.push(manager.getArg(term, 0));
|
|
285
|
+
} else if (secondFactor !== undefined) {
|
|
286
|
+
coeffs[index] = coeffs[index].mul(secondFactor);
|
|
287
|
+
terms[index] = manager.getArg(term, 0);
|
|
288
|
+
state.toEnsureEnode.push(manager.getArg(term, 1));
|
|
289
|
+
} else if (op === OP_MUL) {
|
|
290
|
+
addVar(index, this.internalizeMul(term));
|
|
291
|
+
index++;
|
|
292
|
+
} else if (
|
|
293
|
+
degree !== undefined &&
|
|
294
|
+
degree.isInt() &&
|
|
295
|
+
!degree.isNegative() &&
|
|
296
|
+
degree.compare(Rational.of(BigInt(MAX_POWER_DEGREE))) <= 0
|
|
297
|
+
) {
|
|
298
|
+
addVar(index, this.internalizePower(term, manager.getArg(term, 0), Number(degree.num)));
|
|
299
|
+
index++;
|
|
300
|
+
} else if (op === OP_NUM) {
|
|
301
|
+
addVar(index, this.internalizeNumeral(term, manager.getRationalValue(term)));
|
|
302
|
+
index++;
|
|
303
|
+
} else if (op === OP_UMINUS) {
|
|
304
|
+
coeffs[index] = coeffs[index].neg();
|
|
305
|
+
terms[index] = manager.getArg(term, 0);
|
|
306
|
+
} else if (op === OP_TO_REAL) {
|
|
307
|
+
const arg = manager.getArg(term, 0);
|
|
308
|
+
terms[index] = arg;
|
|
309
|
+
if (this.expr2enode(term) === undefined) {
|
|
310
|
+
this.internalizeArithTerm(arg);
|
|
311
|
+
this.mkArithEnode(term);
|
|
312
|
+
const column = this.registerVar(this.mkEvar(term));
|
|
313
|
+
const argColumn = this.registerVar(this.mkEvar(arg));
|
|
314
|
+
for (const constraint of this.solver.addEquality(column, argColumn))
|
|
315
|
+
this.addDefConstraint(constraint);
|
|
316
|
+
}
|
|
317
|
+
} else if (op !== -1) {
|
|
318
|
+
const isFirst = this.expr2enode(term) === undefined;
|
|
319
|
+
this.internalizeArgs(term);
|
|
320
|
+
this.mkArithEnode(term);
|
|
321
|
+
addVar(index, this.mkEvar(term));
|
|
322
|
+
index++;
|
|
323
|
+
if (isFirst) this.internalizeArithApp(term, op, state);
|
|
324
|
+
} else {
|
|
325
|
+
if (manager.isApp(term)) {
|
|
326
|
+
this.internalizeArgs(term);
|
|
327
|
+
this.ensureArgVars(term);
|
|
328
|
+
}
|
|
329
|
+
addVar(index, this.mkEvar(term));
|
|
330
|
+
index++;
|
|
331
|
+
}
|
|
332
|
+
}
|
|
333
|
+
for (let position = state.toEnsureEnode.length; position-- > 0;) {
|
|
334
|
+
const expr = state.toEnsureEnode[position];
|
|
335
|
+
if (manager.isApp(expr)) this.mkArithEnode(expr);
|
|
336
|
+
}
|
|
337
|
+
state.toEnsureEnode = [];
|
|
338
|
+
for (let position = state.toEnsureVar.length; position-- > 0;) {
|
|
339
|
+
const expr = state.toEnsureVar[position];
|
|
340
|
+
if (manager.isApp(expr)) this.internalizeArithTerm(expr);
|
|
341
|
+
}
|
|
342
|
+
state.toEnsureVar = [];
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
private internalizeArithApp(term: number, op: number, state: InternalizeState) {
|
|
346
|
+
const manager = this.manager;
|
|
347
|
+
const isNonzeroNumeral = (expr: number) =>
|
|
348
|
+
manager.isNumeral(expr) && !manager.getRationalValue(expr).isZero();
|
|
349
|
+
const pushArgs = () => manager.pushArgs(term, state.toEnsureVar);
|
|
350
|
+
if (op === OP_TO_INT) this.mkToIntAxiom(term);
|
|
351
|
+
else if (op === OP_ABS) this.mkAbsAxiom(term);
|
|
352
|
+
else if (op === OP_IDIV) {
|
|
353
|
+
if (!isNonzeroNumeral(manager.getArg(term, 1))) this.foundUnderspecified(term);
|
|
354
|
+
this.ctx.trail.push(() => this.idivTerms.pop());
|
|
355
|
+
this.idivTerms.push(term);
|
|
356
|
+
this.internalizeTerm(manager.mkApp(OP_MOD, manager.getArgs(term), SORT_INT));
|
|
357
|
+
pushArgs();
|
|
358
|
+
} else if (op === OP_MOD) {
|
|
359
|
+
if (!isNonzeroNumeral(manager.getArg(term, 1))) this.foundUnderspecified(term);
|
|
360
|
+
this.mkIdivModAxioms(manager.getArg(term, 0), manager.getArg(term, 1));
|
|
361
|
+
pushArgs();
|
|
362
|
+
} else if (op === OP_REM) {
|
|
363
|
+
if (!isNonzeroNumeral(manager.getArg(term, 1))) this.foundUnderspecified(term);
|
|
364
|
+
this.mkRemAxiom(manager.getArg(term, 0), manager.getArg(term, 1));
|
|
365
|
+
pushArgs();
|
|
366
|
+
} else if (op === OP_DIV) {
|
|
367
|
+
if (!isNonzeroNumeral(this.rewrite(manager.getArg(term, 1)))) this.foundUnderspecified(term);
|
|
368
|
+
this.mkDivAxiom(manager.getArg(term, 0), manager.getArg(term, 1));
|
|
369
|
+
pushArgs();
|
|
370
|
+
} else if (op === OP_POWER) {
|
|
371
|
+
this.foundUnsupported(term);
|
|
372
|
+
this.mkPowerAxiom(term, manager.getArg(term, 0), manager.getArg(term, 1));
|
|
373
|
+
pushArgs();
|
|
374
|
+
} else if (op !== OP_DIV0 && op !== OP_MOD0 && op !== OP_IDIV0 && op !== OP_POWER0) {
|
|
375
|
+
this.foundUnsupported(term);
|
|
376
|
+
this.ensureArgVars(term);
|
|
377
|
+
} else this.ensureArgVars(term);
|
|
378
|
+
}
|
|
379
|
+
|
|
380
|
+
eqInternalized(node: Enode) {
|
|
381
|
+
this.internalizeArithTerm(node.getArg(0).owner);
|
|
382
|
+
this.internalizeArithTerm(node.getArg(1).owner);
|
|
383
|
+
}
|
|
384
|
+
|
|
385
|
+
private mkSub(first: number, second: number) {
|
|
386
|
+
const manager = this.manager;
|
|
387
|
+
if (manager.isNumeral(second) && manager.getRationalValue(second).isZero()) return first;
|
|
388
|
+
return manager.mkApp(OP_SUB, [first, second], manager.sorts[first]);
|
|
389
|
+
}
|
|
390
|
+
|
|
391
|
+
protected internalizeAtom(atom: number) {
|
|
392
|
+
const manager = this.manager;
|
|
393
|
+
const boolVar = this.ctx.si.addBoolVar(atom);
|
|
394
|
+
this.boolVar2bound.delete(boolVar);
|
|
395
|
+
let lit = 2 * boolVar;
|
|
396
|
+
this.ctx.attachLit(lit, atom);
|
|
397
|
+
const op = manager.getFamily(atom) === FAMILY_ARITH ? manager.getOp(atom) : -1;
|
|
398
|
+
if (op === OP_IS_INT) {
|
|
399
|
+
this.mkIsIntAxiom(atom);
|
|
400
|
+
return;
|
|
401
|
+
}
|
|
402
|
+
if (op !== OP_LE && op !== OP_GE && op !== OP_LT && op !== OP_GT) {
|
|
403
|
+
this.foundUnsupported(atom);
|
|
404
|
+
return;
|
|
405
|
+
}
|
|
406
|
+
const left = manager.getArg(atom, 0);
|
|
407
|
+
const right = manager.getArg(atom, 1);
|
|
408
|
+
const rightValue =
|
|
409
|
+
op === OP_LE || op === OP_GE ? getExtendedNumeral(manager, right) : undefined;
|
|
410
|
+
const leftValue =
|
|
411
|
+
rightValue === undefined && (op === OP_LE || op === OP_GE)
|
|
412
|
+
? getExtendedNumeral(manager, left)
|
|
413
|
+
: undefined;
|
|
414
|
+
let thVar: number;
|
|
415
|
+
let isLower: boolean;
|
|
416
|
+
let value: Rational;
|
|
417
|
+
if (rightValue !== undefined) {
|
|
418
|
+
thVar = this.internalizeDef(left);
|
|
419
|
+
isLower = op === OP_GE;
|
|
420
|
+
value = rightValue;
|
|
421
|
+
} else if (leftValue !== undefined) {
|
|
422
|
+
thVar = this.internalizeDef(right);
|
|
423
|
+
isLower = op === OP_LE;
|
|
424
|
+
value = leftValue;
|
|
425
|
+
} else {
|
|
426
|
+
thVar = this.internalizeDef(this.mkSub(left, right));
|
|
427
|
+
isLower = op === OP_GE || op === OP_LT;
|
|
428
|
+
value = Rational.zero;
|
|
429
|
+
if (op === OP_LT || op === OP_GT) lit ^= 1;
|
|
430
|
+
}
|
|
431
|
+
const node = this.expr2enode(atom) as Enode;
|
|
432
|
+
const atomVar = this.mkVar(node);
|
|
433
|
+
this.ctx.egraph.addThVar(node, atomVar, this.id);
|
|
434
|
+
this.ctx.egraph.setCgcEnabled(node, false);
|
|
435
|
+
if (this.isIntVar(thVar) && !value.isInt()) value = isLower ? value.ceil() : value.floor();
|
|
436
|
+
const bound = this.mkVarBound(lit, thVar, isLower, value);
|
|
437
|
+
this.bounds[thVar].push(bound);
|
|
438
|
+
this.updateUnassignedBounds(thVar, 1);
|
|
439
|
+
this.boundsTrail.push(thVar);
|
|
440
|
+
this.boolVar2bound.set(boolVar, bound);
|
|
441
|
+
this.newBounds.push(bound);
|
|
442
|
+
}
|
|
443
|
+
|
|
444
|
+
protected updateUnassignedBounds(thVar: number, increment: number) {
|
|
445
|
+
const saved = this.unassignedBounds[thVar];
|
|
446
|
+
this.ctx.trail.push(() => {
|
|
447
|
+
this.unassignedBounds[thVar] = saved;
|
|
448
|
+
});
|
|
449
|
+
this.unassignedBounds[thVar] = saved + increment;
|
|
450
|
+
}
|
|
451
|
+
|
|
452
|
+
protected boundToConstraintKind(
|
|
453
|
+
isInt: boolean,
|
|
454
|
+
isLower: boolean,
|
|
455
|
+
isTrue: boolean,
|
|
456
|
+
): ConstraintKind {
|
|
457
|
+
if (isLower) return isTrue ? KIND_GE : isInt ? KIND_LE : KIND_LT;
|
|
458
|
+
return isTrue ? KIND_LE : isInt ? KIND_GE : KIND_GT;
|
|
459
|
+
}
|
|
460
|
+
|
|
461
|
+
private mkVarBound(lit: number, thVar: number, isLower: boolean, value: Rational): ArithBound {
|
|
462
|
+
const solver = this.solver;
|
|
463
|
+
const isInt = this.isIntVar(thVar);
|
|
464
|
+
const column = this.registerVar(thVar);
|
|
465
|
+
const constraintTrue = solver.mkVarBound(
|
|
466
|
+
column,
|
|
467
|
+
this.boundToConstraintKind(isInt, isLower, true),
|
|
468
|
+
value,
|
|
469
|
+
);
|
|
470
|
+
const constraintFalse = solver.mkVarBound(
|
|
471
|
+
column,
|
|
472
|
+
this.boundToConstraintKind(isInt, isLower, false),
|
|
473
|
+
isInt ? (isLower ? value.sub(Rational.one) : value.add(Rational.one)) : value,
|
|
474
|
+
);
|
|
475
|
+
this.addIneqConstraint(constraintTrue, lit);
|
|
476
|
+
this.addIneqConstraint(constraintFalse, lit ^ 1);
|
|
477
|
+
return { lit, thVar, column, isInt, value, isLower, constraintTrue, constraintFalse };
|
|
478
|
+
}
|
|
479
|
+
|
|
480
|
+
protected internalizeArithTerm(term: number) {
|
|
481
|
+
if (!this.hasVar(term)) this.registerVar(this.internalizeDef(term));
|
|
482
|
+
}
|
|
483
|
+
|
|
484
|
+
protected internalizeDef(term: number) {
|
|
485
|
+
const state = mkInternalizeState();
|
|
486
|
+
state.terms.push(term);
|
|
487
|
+
state.coeffs.push(Rational.one);
|
|
488
|
+
this.linearize(state);
|
|
489
|
+
return this.internalizeLinearizedDef(term, state);
|
|
490
|
+
}
|
|
491
|
+
|
|
492
|
+
private internalizeArgs(term: number) {
|
|
493
|
+
for (const arg of this.manager.getArgs(term)) this.eInternalize(arg);
|
|
494
|
+
}
|
|
495
|
+
|
|
496
|
+
private ensureArgVars(term: number) {
|
|
497
|
+
const manager = this.manager;
|
|
498
|
+
for (const arg of manager.getArgs(term))
|
|
499
|
+
if (manager.isReal(arg) || manager.isInt(arg)) this.internalizeArithTerm(arg);
|
|
500
|
+
}
|
|
501
|
+
|
|
502
|
+
private internalizePower(term: number, base: number, degree: number) {
|
|
503
|
+
this.internalizeArgs(term);
|
|
504
|
+
const hasVar = this.hasVar(term);
|
|
505
|
+
this.mkArithEnode(term);
|
|
506
|
+
const thVar = this.mkEvar(term);
|
|
507
|
+
if (hasVar) return thVar;
|
|
508
|
+
this.internalizeArithTerm(base);
|
|
509
|
+
const baseVar = this.mkEvar(base);
|
|
510
|
+
if (degree === 0) {
|
|
511
|
+
this.mkPower0Axioms(term, base);
|
|
512
|
+
return thVar;
|
|
513
|
+
}
|
|
514
|
+
const vars = Array.from({ length: degree }, () => this.registerVar(baseVar));
|
|
515
|
+
const nla = this.ensureNla();
|
|
516
|
+
this.solver.registerExistingTerms();
|
|
517
|
+
nla.addMonic(this.registerVar(thVar), vars);
|
|
518
|
+
return thVar;
|
|
519
|
+
}
|
|
520
|
+
|
|
521
|
+
private internalizeNumeral(term: number, value: Rational) {
|
|
522
|
+
const thVar = this.mkEvar(term);
|
|
523
|
+
if (this.solver.externalToLocalColumn(thVar) === NULL_LPVAR) {
|
|
524
|
+
const column = this.solver.addVar(thVar, this.manager.isInt(term));
|
|
525
|
+
this.addDefConstraintAndEquality(column, KIND_GE, value);
|
|
526
|
+
this.addDefConstraintAndEquality(column, KIND_LE, value);
|
|
527
|
+
this.registerFixedVar(thVar, value);
|
|
528
|
+
}
|
|
529
|
+
return thVar;
|
|
530
|
+
}
|
|
531
|
+
|
|
532
|
+
private internalizeMul(term: number) {
|
|
533
|
+
this.internalizeArgs(term);
|
|
534
|
+
const hasVar = this.hasVar(term);
|
|
535
|
+
this.mkArithEnode(term);
|
|
536
|
+
const thVar = this.mkEvar(term);
|
|
537
|
+
if (!hasVar) {
|
|
538
|
+
const vars = this.manager.mapArgs(term, (arg) => {
|
|
539
|
+
if (this.manager.isApp(arg)) this.internalizeArithTerm(arg);
|
|
540
|
+
return this.registerVar(this.mkEvar(arg));
|
|
541
|
+
});
|
|
542
|
+
this.solver.registerExistingTerms();
|
|
543
|
+
this.ensureNla().addMonic(this.registerVar(thVar), vars);
|
|
544
|
+
}
|
|
545
|
+
return thVar;
|
|
546
|
+
}
|
|
547
|
+
|
|
548
|
+
private internalizeLinearizedDef(term: number, state: InternalizeState) {
|
|
549
|
+
const thVar = this.mkEvar(term);
|
|
550
|
+
if (state.vars.length === 1 && state.coeffs[0].equals(Rational.one) && thVar === state.vars[0])
|
|
551
|
+
return thVar;
|
|
552
|
+
const leftSide = this.initLeftSide(state);
|
|
553
|
+
if (this.solver.externalToLocalColumn(thVar) !== NULL_LPVAR) return thVar;
|
|
554
|
+
if (leftSide.length === 0) {
|
|
555
|
+
const column = this.solver.addVar(thVar, this.manager.isInt(term));
|
|
556
|
+
this.addDefConstraintAndEquality(column, KIND_GE, Rational.zero);
|
|
557
|
+
this.addDefConstraintAndEquality(column, KIND_LE, Rational.zero);
|
|
558
|
+
} else this.solver.addTerm(leftSide, thVar);
|
|
559
|
+
return thVar;
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
private initLeftSide(state: InternalizeState) {
|
|
563
|
+
const sums = new Map<number, Rational>();
|
|
564
|
+
state.vars.forEach((thVar, index) =>
|
|
565
|
+
sums.set(thVar, (sums.get(thVar) ?? Rational.zero).add(state.coeffs[index])),
|
|
566
|
+
);
|
|
567
|
+
const leftSide: [number, Rational][] = [];
|
|
568
|
+
for (const thVar of state.vars) {
|
|
569
|
+
const sum = sums.get(thVar);
|
|
570
|
+
if (sum === undefined || sum.isZero()) continue;
|
|
571
|
+
leftSide.push([this.registerVar(thVar), sum]);
|
|
572
|
+
sums.delete(thVar);
|
|
573
|
+
}
|
|
574
|
+
return leftSide;
|
|
575
|
+
}
|
|
576
|
+
|
|
577
|
+
protected mkArithEnode(expr: number) {
|
|
578
|
+
const existing = this.expr2enode(expr);
|
|
579
|
+
if (existing !== undefined) return existing;
|
|
580
|
+
if (this.manager.getFamily(expr) !== FAMILY_ARITH) return this.eInternalize(expr);
|
|
581
|
+
const args = this.manager.getArgs(expr).map((arg) => this.eInternalize(arg));
|
|
582
|
+
const node = this.ctx.mkEnode(expr, args);
|
|
583
|
+
this.ctx.attachNode(node);
|
|
584
|
+
return node;
|
|
585
|
+
}
|
|
586
|
+
|
|
587
|
+
protected mkEvar(expr: number) {
|
|
588
|
+
const node = this.mkArithEnode(expr);
|
|
589
|
+
const existing = node.getThVar(this.id);
|
|
590
|
+
if (existing !== NULL_THEORY_VAR) return existing;
|
|
591
|
+
const thVar = this.mkVar(node);
|
|
592
|
+
this.reserveBounds(thVar);
|
|
593
|
+
this.ctx.egraph.addThVar(node, thVar, this.id);
|
|
594
|
+
return thVar;
|
|
595
|
+
}
|
|
596
|
+
|
|
597
|
+
protected hasVar(expr: number) {
|
|
598
|
+
const node = this.expr2enode(expr);
|
|
599
|
+
return node !== undefined && node.getThVar(this.id) !== NULL_THEORY_VAR;
|
|
600
|
+
}
|
|
601
|
+
|
|
602
|
+
protected reserveBounds(thVar: number) {
|
|
603
|
+
while (this.bounds.length <= thVar) {
|
|
604
|
+
this.bounds.push([]);
|
|
605
|
+
this.unassignedBounds.push(0);
|
|
606
|
+
}
|
|
607
|
+
}
|
|
608
|
+
|
|
609
|
+
protected addEqConstraint(index: number, first: Enode, second: Enode) {
|
|
610
|
+
this.constraintSources[index] = SOURCE_EQUALITY;
|
|
611
|
+
this.equalities[index] = [first, second];
|
|
612
|
+
}
|
|
613
|
+
|
|
614
|
+
private addIneqConstraint(index: number, lit: number) {
|
|
615
|
+
this.constraintSources[index] = SOURCE_INEQUALITY;
|
|
616
|
+
this.inequalities[index] = lit;
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
protected addDefConstraint(index: number) {
|
|
620
|
+
this.constraintSources[index] = SOURCE_DEFINITION;
|
|
621
|
+
}
|
|
622
|
+
|
|
623
|
+
protected addDefConstraintAndEquality(column: number, kind: ConstraintKind, bound: Rational) {
|
|
624
|
+
const index = this.solver.mkVarBound(column, kind, bound);
|
|
625
|
+
const equal = this.solver.activateCheckOnEqual(index);
|
|
626
|
+
this.addDefConstraint(index);
|
|
627
|
+
if (equal !== NULL_LPVAR) this.reportEqualityOfFixedVars(column, equal);
|
|
628
|
+
this.isNewEq = true;
|
|
629
|
+
}
|
|
630
|
+
|
|
631
|
+
override isShared(thVar: number) {
|
|
632
|
+
const count = this.underspecified.length;
|
|
633
|
+
if (count === 0) return false;
|
|
634
|
+
const root = this.var2enodeOf(thVar).root;
|
|
635
|
+
const manager = this.manager;
|
|
636
|
+
if (root.parents.length > 2 * count)
|
|
637
|
+
return this.underspecified.some((term) =>
|
|
638
|
+
manager.someArg(term, (arg) => this.expr2enode(arg)?.root === root),
|
|
639
|
+
);
|
|
640
|
+
return root.parents.some(
|
|
641
|
+
(parent) =>
|
|
642
|
+
manager.getFamily(parent.owner) === FAMILY_ARITH &&
|
|
643
|
+
isUnderspecified(manager.getOp(parent.owner)),
|
|
644
|
+
);
|
|
645
|
+
}
|
|
646
|
+
|
|
647
|
+
private registerFixedVar(thVar: number, value: Rational) {
|
|
648
|
+
const key = value.toString();
|
|
649
|
+
if (this.value2var.has(key)) return;
|
|
650
|
+
this.value2var.set(key, thVar);
|
|
651
|
+
this.ctx.trail.push(() => this.value2var.delete(key));
|
|
652
|
+
}
|
|
653
|
+
}
|