tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.3a85c3a9e
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 +3 -0
- package/dist/index.d.ts +3 -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 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- 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 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +34 -701
- 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 +45 -333
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +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 +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- 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 +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- 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 -4
- 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 +25 -4
- 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 +234 -36
- 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 +25 -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 +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +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 +86 -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 +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -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 +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +55 -72
- 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 +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +196 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +2 -9
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/trace-spec.ts +25 -45
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +63 -158
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,934 @@
|
|
|
1
|
+
import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import { FAMILY_PB, OP_AT_LEAST_K, OP_AT_MOST_K, OP_PB_EQ, OP_PB_GE, OP_PB_LE } from "./ast";
|
|
3
|
+
import { mkNot } from "./ast-util";
|
|
4
|
+
import { BinJustification, CLS_TH_LEMMA } from "./clause";
|
|
5
|
+
import type { Context } from "./context";
|
|
6
|
+
import {
|
|
7
|
+
type Antecedents,
|
|
8
|
+
Justification,
|
|
9
|
+
TheoryJustification,
|
|
10
|
+
UnitResolutionJustification,
|
|
11
|
+
} from "./enode";
|
|
12
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
13
|
+
import {
|
|
14
|
+
type BoolVar,
|
|
15
|
+
FALSE_LITERAL,
|
|
16
|
+
getVar,
|
|
17
|
+
isNegated,
|
|
18
|
+
type Literal,
|
|
19
|
+
mkLiteral,
|
|
20
|
+
negate,
|
|
21
|
+
TRUE_BOOL_VAR,
|
|
22
|
+
TRUE_LITERAL,
|
|
23
|
+
} from "./literal";
|
|
24
|
+
import { getPbCoeff, getPbK, hasUnitCoefficients, mkPbGe } from "./pb-rewriter";
|
|
25
|
+
import { getGcd, Rational } from "./rational";
|
|
26
|
+
import { Theory } from "./theory";
|
|
27
|
+
|
|
28
|
+
interface PbArg {
|
|
29
|
+
lit: Literal;
|
|
30
|
+
coeff: Rational;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
interface PbArgs {
|
|
34
|
+
items: PbArg[];
|
|
35
|
+
k: Rational;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
// pb_rewriter_util over literals. Only inequalities reach it: equalities split into two at internalization.
|
|
39
|
+
const unique = (args: PbArgs) => {
|
|
40
|
+
for (const arg of args.items)
|
|
41
|
+
if (isNegated(arg.lit)) {
|
|
42
|
+
arg.lit = negate(arg.lit);
|
|
43
|
+
args.k = args.k.sub(arg.coeff);
|
|
44
|
+
arg.coeff = arg.coeff.neg();
|
|
45
|
+
}
|
|
46
|
+
const kept: PbArg[] = [];
|
|
47
|
+
for (const arg of args.items) {
|
|
48
|
+
if (arg.lit === TRUE_LITERAL) args.k = args.k.sub(arg.coeff);
|
|
49
|
+
else if (arg.lit !== FALSE_LITERAL) kept.push(arg);
|
|
50
|
+
}
|
|
51
|
+
kept.sort((first, second) => first.lit - second.lit);
|
|
52
|
+
const merged: PbArg[] = [];
|
|
53
|
+
for (const arg of kept) {
|
|
54
|
+
const last = merged[merged.length - 1];
|
|
55
|
+
if (last !== undefined && last.lit === arg.lit) last.coeff = last.coeff.add(arg.coeff);
|
|
56
|
+
else merged.push(arg);
|
|
57
|
+
}
|
|
58
|
+
args.items = merged.filter((arg) => !arg.coeff.isZero());
|
|
59
|
+
};
|
|
60
|
+
|
|
61
|
+
const normalize = (args: PbArgs) => {
|
|
62
|
+
let sum = Rational.zero;
|
|
63
|
+
for (const arg of args.items) {
|
|
64
|
+
const coeff = arg.coeff;
|
|
65
|
+
if (coeff.isNegative()) {
|
|
66
|
+
arg.coeff = coeff.neg();
|
|
67
|
+
arg.lit = negate(arg.lit);
|
|
68
|
+
args.k = args.k.sub(coeff);
|
|
69
|
+
}
|
|
70
|
+
sum = sum.add(arg.coeff);
|
|
71
|
+
}
|
|
72
|
+
if (args.k.compare(Rational.zero) <= 0) {
|
|
73
|
+
args.items = [];
|
|
74
|
+
args.k = Rational.zero;
|
|
75
|
+
return L_TRUE;
|
|
76
|
+
}
|
|
77
|
+
if (sum.compare(args.k) < 0) {
|
|
78
|
+
args.items = [];
|
|
79
|
+
args.k = Rational.one;
|
|
80
|
+
return L_FALSE;
|
|
81
|
+
}
|
|
82
|
+
if (!args.items.every((arg) => arg.coeff.isInt())) {
|
|
83
|
+
let lcm = args.k.den;
|
|
84
|
+
for (const arg of args.items) lcm = (lcm * arg.coeff.den) / getGcd(lcm, arg.coeff.den);
|
|
85
|
+
const scale = Rational.of(lcm);
|
|
86
|
+
args.k = args.k.mul(scale);
|
|
87
|
+
for (const arg of args.items) arg.coeff = arg.coeff.mul(scale);
|
|
88
|
+
}
|
|
89
|
+
const k = args.k;
|
|
90
|
+
sum = Rational.zero;
|
|
91
|
+
for (const arg of args.items) {
|
|
92
|
+
if (arg.coeff.compare(k) > 0) arg.coeff = k;
|
|
93
|
+
sum = sum.add(arg.coeff);
|
|
94
|
+
}
|
|
95
|
+
if (sum.equals(k)) {
|
|
96
|
+
for (const arg of args.items) arg.coeff = Rational.one;
|
|
97
|
+
args.k = Rational.of(BigInt(args.items.length));
|
|
98
|
+
}
|
|
99
|
+
let gcd = 0n;
|
|
100
|
+
for (let index = 0; gcd !== 1n && index < args.items.length; index++) {
|
|
101
|
+
const coeff = args.items[index].coeff;
|
|
102
|
+
if (!coeff.equals(args.k)) gcd = gcd === 0n ? coeff.num : getGcd(gcd, coeff.num);
|
|
103
|
+
}
|
|
104
|
+
if (gcd === 0n) {
|
|
105
|
+
for (const arg of args.items) arg.coeff = Rational.one;
|
|
106
|
+
args.k = Rational.one;
|
|
107
|
+
} else if (gcd > 1n) {
|
|
108
|
+
const bound = args.k.num;
|
|
109
|
+
const newK = bound / gcd + (bound % gcd === 0n ? 0n : 1n);
|
|
110
|
+
for (const arg of args.items)
|
|
111
|
+
arg.coeff = Rational.of(arg.coeff.equals(args.k) ? newK : arg.coeff.num / gcd);
|
|
112
|
+
args.k = Rational.of(newK);
|
|
113
|
+
}
|
|
114
|
+
if (!args.k.equals(Rational.one)) {
|
|
115
|
+
let min = args.items[0].coeff;
|
|
116
|
+
let max = min;
|
|
117
|
+
for (const arg of args.items) {
|
|
118
|
+
if (arg.coeff.compare(min) < 0) min = arg.coeff;
|
|
119
|
+
if (arg.coeff.compare(max) > 0) max = arg.coeff;
|
|
120
|
+
}
|
|
121
|
+
const n0 = args.k.div(max);
|
|
122
|
+
const n1 = n0.floor();
|
|
123
|
+
const n2 = args.k.div(min).ceil().sub(Rational.one);
|
|
124
|
+
if (n1.equals(n2) && !n0.isInt()) {
|
|
125
|
+
for (const arg of args.items) arg.coeff = Rational.one;
|
|
126
|
+
args.k = n1.add(Rational.one);
|
|
127
|
+
}
|
|
128
|
+
}
|
|
129
|
+
return L_UNDEF;
|
|
130
|
+
};
|
|
131
|
+
|
|
132
|
+
const prune = (args: PbArgs) => {
|
|
133
|
+
let nlt = Rational.zero;
|
|
134
|
+
let occ = 0;
|
|
135
|
+
for (let index = 0; nlt.compare(args.k) < 0 && index < args.items.length; index++) {
|
|
136
|
+
const coeff = args.items[index].coeff;
|
|
137
|
+
if (coeff.compare(args.k) < 0) {
|
|
138
|
+
nlt = nlt.add(coeff);
|
|
139
|
+
occ++;
|
|
140
|
+
}
|
|
141
|
+
}
|
|
142
|
+
if (occ === 0 || nlt.compare(args.k) >= 0) return;
|
|
143
|
+
const items = args.items;
|
|
144
|
+
for (let index = 0; index < items.length; index++)
|
|
145
|
+
if (items[index].coeff.compare(args.k) < 0) {
|
|
146
|
+
items[index] = items[items.length - 1];
|
|
147
|
+
items.pop();
|
|
148
|
+
index--;
|
|
149
|
+
}
|
|
150
|
+
unique(args);
|
|
151
|
+
normalize(args);
|
|
152
|
+
};
|
|
153
|
+
|
|
154
|
+
const negateArgs = (args: PbArgs) => {
|
|
155
|
+
let sum = Rational.zero;
|
|
156
|
+
for (const arg of args.items) {
|
|
157
|
+
arg.lit = negate(arg.lit);
|
|
158
|
+
sum = sum.add(arg.coeff);
|
|
159
|
+
}
|
|
160
|
+
args.k = sum.sub(args.k).add(Rational.one);
|
|
161
|
+
if (normalize(args) !== L_UNDEF) throw new SmtInvariantError("a negated inequality is trivial");
|
|
162
|
+
};
|
|
163
|
+
|
|
164
|
+
class Ineq {
|
|
165
|
+
args: [PbArgs, PbArgs] = [
|
|
166
|
+
{ items: [], k: Rational.zero },
|
|
167
|
+
{ items: [], k: Rational.zero },
|
|
168
|
+
];
|
|
169
|
+
maxWatch = 0n;
|
|
170
|
+
watchSize = 0;
|
|
171
|
+
watchSum = 0n;
|
|
172
|
+
|
|
173
|
+
constructor(public lit: Literal) {}
|
|
174
|
+
|
|
175
|
+
getArgs() {
|
|
176
|
+
return this.args[isNegated(this.lit) ? 1 : 0];
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
getK() {
|
|
180
|
+
return this.getArgs().k.num;
|
|
181
|
+
}
|
|
182
|
+
|
|
183
|
+
getLit(index: number) {
|
|
184
|
+
return this.getArgs().items[index].lit;
|
|
185
|
+
}
|
|
186
|
+
|
|
187
|
+
getCoeff(index: number) {
|
|
188
|
+
return this.getArgs().items[index].coeff.num;
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
get size() {
|
|
192
|
+
return this.getArgs().items.length;
|
|
193
|
+
}
|
|
194
|
+
|
|
195
|
+
swap(first: number, second: number) {
|
|
196
|
+
const items = this.getArgs().items;
|
|
197
|
+
const arg = items[first];
|
|
198
|
+
items[first] = items[second];
|
|
199
|
+
items[second] = arg;
|
|
200
|
+
}
|
|
201
|
+
|
|
202
|
+
findLit(boolVar: BoolVar, begin: number) {
|
|
203
|
+
let index = begin;
|
|
204
|
+
while (getVar(this.getLit(index)) !== boolVar) index++;
|
|
205
|
+
return index;
|
|
206
|
+
}
|
|
207
|
+
|
|
208
|
+
postPrune() {
|
|
209
|
+
const first = this.args[0];
|
|
210
|
+
if (first.items.length === 0) return;
|
|
211
|
+
negateArgs(first);
|
|
212
|
+
negateArgs(first);
|
|
213
|
+
this.args[1] = { items: first.items.map((arg) => ({ ...arg })), k: first.k };
|
|
214
|
+
negateArgs(this.args[1]);
|
|
215
|
+
}
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
class Card {
|
|
219
|
+
args: Literal[] = [];
|
|
220
|
+
|
|
221
|
+
constructor(
|
|
222
|
+
public lit: Literal,
|
|
223
|
+
public k: number,
|
|
224
|
+
readonly isAux: boolean,
|
|
225
|
+
) {}
|
|
226
|
+
|
|
227
|
+
get size() {
|
|
228
|
+
return this.args.length;
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
swap(first: number, second: number) {
|
|
232
|
+
const lit = this.args[first];
|
|
233
|
+
this.args[first] = this.args[second];
|
|
234
|
+
this.args[second] = lit;
|
|
235
|
+
}
|
|
236
|
+
|
|
237
|
+
negate() {
|
|
238
|
+
this.lit = negate(this.lit);
|
|
239
|
+
for (let index = 0; index < this.args.length; index++)
|
|
240
|
+
this.args[index] = negate(this.args[index]);
|
|
241
|
+
this.k = this.args.length - this.k + 1;
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
addArg(lit: Literal) {
|
|
245
|
+
if (lit === FALSE_LITERAL) return;
|
|
246
|
+
if (lit === TRUE_LITERAL) {
|
|
247
|
+
if (this.k > 0) this.k--;
|
|
248
|
+
} else this.args.push(lit);
|
|
249
|
+
}
|
|
250
|
+
}
|
|
251
|
+
|
|
252
|
+
class CardJustification extends Justification {
|
|
253
|
+
constructor(
|
|
254
|
+
readonly fromTheory: number,
|
|
255
|
+
readonly card: Card,
|
|
256
|
+
) {
|
|
257
|
+
super();
|
|
258
|
+
}
|
|
259
|
+
|
|
260
|
+
getAntecedents(antecedents: Antecedents) {
|
|
261
|
+
const card = this.card;
|
|
262
|
+
antecedents.markLiteral(card.lit);
|
|
263
|
+
for (let index = card.k; index < card.size; index++)
|
|
264
|
+
antecedents.markLiteral(negate(card.args[index]));
|
|
265
|
+
}
|
|
266
|
+
}
|
|
267
|
+
|
|
268
|
+
export class TheoryPb extends Theory {
|
|
269
|
+
readonly name = "pb";
|
|
270
|
+
private ineqs: (Ineq | undefined)[] = [];
|
|
271
|
+
private cards: (Card | undefined)[] = [];
|
|
272
|
+
private ineqWatches: Ineq[][] = [];
|
|
273
|
+
private cardWatches: Card[][] = [];
|
|
274
|
+
private ineqsTrail: BoolVar[] = [];
|
|
275
|
+
private ineqsLim: number[] = [];
|
|
276
|
+
private cardTrail: BoolVar[] = [];
|
|
277
|
+
private cardLim: number[] = [];
|
|
278
|
+
private numMarks = 0;
|
|
279
|
+
private conflictLvl = 0;
|
|
280
|
+
private coeffs: number[] = [];
|
|
281
|
+
private activeVars: BoolVar[] = [];
|
|
282
|
+
private readonly activeVarSet = new Set<BoolVar>();
|
|
283
|
+
private bound = 0;
|
|
284
|
+
private antecedents: Literal[] = [];
|
|
285
|
+
|
|
286
|
+
constructor(context: Context) {
|
|
287
|
+
super(context, FAMILY_PB);
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
internalizeTerm(): boolean {
|
|
291
|
+
throw new SmtInvariantError("theory_pb has no terms");
|
|
292
|
+
}
|
|
293
|
+
|
|
294
|
+
newEqEh() {
|
|
295
|
+
throw new SmtInvariantError("theory_pb has no equalities");
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
newDiseqEh() {}
|
|
299
|
+
|
|
300
|
+
override useDiseqs() {
|
|
301
|
+
return false;
|
|
302
|
+
}
|
|
303
|
+
|
|
304
|
+
override buildModels() {
|
|
305
|
+
return false;
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
internalizeAtom(atom: number) {
|
|
309
|
+
const context = this.context;
|
|
310
|
+
const manager = this.manager;
|
|
311
|
+
if (context.isBInternalized(atom)) return true;
|
|
312
|
+
if (this.internalizeCard(atom)) return true;
|
|
313
|
+
const boolVar = context.mkBoolVar(atom);
|
|
314
|
+
context.setVarTheory(boolVar, this.id);
|
|
315
|
+
const lit = mkLiteral(boolVar);
|
|
316
|
+
const decl = manager.decls[atom];
|
|
317
|
+
const args = manager.getArgs(atom);
|
|
318
|
+
const op = manager.getOp(atom);
|
|
319
|
+
if (op === OP_PB_EQ) {
|
|
320
|
+
const coeffs = args.map((_, index) => getPbCoeff(manager, decl, index));
|
|
321
|
+
const sum = coeffs.reduce((total, coeff) => total.add(coeff), Rational.zero);
|
|
322
|
+
const k = getPbK(manager, decl);
|
|
323
|
+
const le = mkPbGe(
|
|
324
|
+
manager,
|
|
325
|
+
coeffs,
|
|
326
|
+
args.map((arg) => mkNot(manager, arg)),
|
|
327
|
+
sum.sub(k),
|
|
328
|
+
);
|
|
329
|
+
const ge = mkPbGe(manager, coeffs, [...args], k);
|
|
330
|
+
context.internalize(le, false);
|
|
331
|
+
context.internalize(ge, false);
|
|
332
|
+
const leLit = context.getLiteral(le);
|
|
333
|
+
const geLit = context.getLiteral(ge);
|
|
334
|
+
context.markLiteralAsRelevant(leLit);
|
|
335
|
+
context.markLiteralAsRelevant(geLit);
|
|
336
|
+
context.mkThAxiom([negate(lit), leLit]);
|
|
337
|
+
context.mkThAxiom([negate(lit), geLit]);
|
|
338
|
+
context.mkThAxiom([negate(leLit), negate(geLit), lit]);
|
|
339
|
+
return true;
|
|
340
|
+
}
|
|
341
|
+
const ineq = new Ineq(lit);
|
|
342
|
+
const first = ineq.args[0];
|
|
343
|
+
first.k = getPbK(manager, decl);
|
|
344
|
+
for (const [index, arg] of args.entries()) {
|
|
345
|
+
const argLit = this.compileArg(arg);
|
|
346
|
+
const coeff = getPbCoeff(manager, decl, index);
|
|
347
|
+
const value = context.getAssignment(argLit);
|
|
348
|
+
if (value === L_TRUE) first.k = first.k.sub(coeff);
|
|
349
|
+
else if (value === L_UNDEF) first.items.push({ lit: argLit, coeff });
|
|
350
|
+
}
|
|
351
|
+
if (op === OP_AT_MOST_K || op === OP_PB_LE) {
|
|
352
|
+
first.k = first.k.neg();
|
|
353
|
+
for (const arg of first.items) {
|
|
354
|
+
arg.lit = negate(arg.lit);
|
|
355
|
+
first.k = first.k.add(arg.coeff);
|
|
356
|
+
}
|
|
357
|
+
}
|
|
358
|
+
unique(first);
|
|
359
|
+
const isTrue = normalize(first);
|
|
360
|
+
prune(first);
|
|
361
|
+
ineq.postPrune();
|
|
362
|
+
if (isTrue !== L_UNDEF) {
|
|
363
|
+
context.mkThAxiom([isTrue === L_FALSE ? negate(lit) : lit]);
|
|
364
|
+
return true;
|
|
365
|
+
}
|
|
366
|
+
if (ineq.getK() === 1n) {
|
|
367
|
+
const lits = [negate(lit)];
|
|
368
|
+
for (let index = 0; index < ineq.size; index++) {
|
|
369
|
+
lits.push(ineq.getLit(index));
|
|
370
|
+
context.mkThAxiom([lit, negate(ineq.getLit(index))]);
|
|
371
|
+
}
|
|
372
|
+
context.mkThAxiom(lits);
|
|
373
|
+
return true;
|
|
374
|
+
}
|
|
375
|
+
this.ineqs[boolVar] = ineq;
|
|
376
|
+
this.ineqsTrail.push(boolVar);
|
|
377
|
+
return true;
|
|
378
|
+
}
|
|
379
|
+
|
|
380
|
+
private compileArg(input: number) {
|
|
381
|
+
const context = this.context;
|
|
382
|
+
const manager = this.manager;
|
|
383
|
+
let isNot = manager.isNot(input);
|
|
384
|
+
const arg = isNot ? manager.getArg(input, 0) : input;
|
|
385
|
+
if (!context.isBInternalized(arg)) context.internalize(arg, false);
|
|
386
|
+
let boolVar = TRUE_BOOL_VAR;
|
|
387
|
+
let hasBoolVar = false;
|
|
388
|
+
if (context.isBInternalized(arg)) {
|
|
389
|
+
boolVar = context.getBoolVar(arg);
|
|
390
|
+
if (manager.isUninterpreted(arg) && context.getBoolVarTheory(boolVar) === -1)
|
|
391
|
+
context.setVarTheory(boolVar, this.id);
|
|
392
|
+
hasBoolVar = context.getBoolVarTheory(boolVar) === this.id;
|
|
393
|
+
} else if (manager.isTrue(arg)) hasBoolVar = true;
|
|
394
|
+
else if (manager.isFalse(arg)) {
|
|
395
|
+
hasBoolVar = true;
|
|
396
|
+
isNot = !isNot;
|
|
397
|
+
}
|
|
398
|
+
if (!hasBoolVar)
|
|
399
|
+
throw new SmtUnsupportedError("pseudo-Boolean arguments that another theory owns");
|
|
400
|
+
return mkLiteral(boolVar, isNot);
|
|
401
|
+
}
|
|
402
|
+
|
|
403
|
+
private delWatch(watch: Ineq[], index: number, ineq: Ineq, ineqIndex: number) {
|
|
404
|
+
watch[index] = watch[watch.length - 1];
|
|
405
|
+
watch.pop();
|
|
406
|
+
let coeff = ineq.getCoeff(ineqIndex);
|
|
407
|
+
if (ineqIndex + 1 < ineq.watchSize) ineq.swap(ineqIndex, ineq.watchSize - 1);
|
|
408
|
+
ineq.watchSize--;
|
|
409
|
+
ineq.watchSum -= coeff;
|
|
410
|
+
if (coeff === ineq.maxWatch) {
|
|
411
|
+
coeff = ineq.getCoeff(0);
|
|
412
|
+
for (let position = 1; coeff !== ineq.maxWatch && position < ineq.watchSize; position++)
|
|
413
|
+
if (coeff < ineq.getCoeff(position)) coeff = ineq.getCoeff(position);
|
|
414
|
+
ineq.maxWatch = coeff;
|
|
415
|
+
}
|
|
416
|
+
}
|
|
417
|
+
|
|
418
|
+
private addWatch(ineq: Ineq, index: number) {
|
|
419
|
+
const lit = ineq.getLit(index);
|
|
420
|
+
const coeff = ineq.getCoeff(index);
|
|
421
|
+
ineq.watchSum += coeff;
|
|
422
|
+
if (index > ineq.watchSize) ineq.swap(index, ineq.watchSize);
|
|
423
|
+
ineq.watchSize++;
|
|
424
|
+
if (coeff > ineq.maxWatch) ineq.maxWatch = coeff;
|
|
425
|
+
(this.ineqWatches[lit] ??= []).push(ineq);
|
|
426
|
+
}
|
|
427
|
+
|
|
428
|
+
private unwatchIneq(lit: Literal, ineq: Ineq) {
|
|
429
|
+
const watch = this.ineqWatches[lit];
|
|
430
|
+
if (watch === undefined) return;
|
|
431
|
+
const position = watch.indexOf(ineq);
|
|
432
|
+
if (position === -1) return;
|
|
433
|
+
watch[position] = watch[watch.length - 1];
|
|
434
|
+
watch.pop();
|
|
435
|
+
}
|
|
436
|
+
|
|
437
|
+
private watchCard(lit: Literal, card: Card) {
|
|
438
|
+
(this.cardWatches[lit] ??= []).push(card);
|
|
439
|
+
}
|
|
440
|
+
|
|
441
|
+
private unwatchCard(lit: Literal, card: Card) {
|
|
442
|
+
const watch = this.cardWatches[lit];
|
|
443
|
+
if (watch === undefined) return;
|
|
444
|
+
const position = watch.indexOf(card);
|
|
445
|
+
if (position === -1) return;
|
|
446
|
+
watch[position] = watch[watch.length - 1];
|
|
447
|
+
watch.pop();
|
|
448
|
+
}
|
|
449
|
+
|
|
450
|
+
private isCardinalityConstraint(atom: number) {
|
|
451
|
+
const manager = this.manager;
|
|
452
|
+
const op = manager.getOp(atom);
|
|
453
|
+
return (
|
|
454
|
+
(op === OP_PB_GE && hasUnitCoefficients(manager, manager.decls[atom])) || op === OP_AT_LEAST_K
|
|
455
|
+
);
|
|
456
|
+
}
|
|
457
|
+
|
|
458
|
+
private internalizeCard(atom: number) {
|
|
459
|
+
const context = this.context;
|
|
460
|
+
const manager = this.manager;
|
|
461
|
+
if (context.isBInternalized(atom)) return true;
|
|
462
|
+
if (!this.isCardinalityConstraint(atom)) return false;
|
|
463
|
+
const args = manager.getArgs(atom);
|
|
464
|
+
const boolVar = context.mkBoolVar(atom);
|
|
465
|
+
context.setVarTheory(boolVar, this.id);
|
|
466
|
+
const bound = Number(getPbK(manager, manager.decls[atom]).num);
|
|
467
|
+
const lit = mkLiteral(boolVar);
|
|
468
|
+
if (bound === 0) {
|
|
469
|
+
context.mkThAxiom([lit]);
|
|
470
|
+
return true;
|
|
471
|
+
}
|
|
472
|
+
if (bound > args.length) {
|
|
473
|
+
context.mkThAxiom([negate(lit)]);
|
|
474
|
+
return true;
|
|
475
|
+
}
|
|
476
|
+
const card = new Card(lit, bound, manager.getOp(atom) === OP_AT_LEAST_K);
|
|
477
|
+
for (const arg of args) card.addArg(this.compileArg(arg));
|
|
478
|
+
if (bound === card.size) this.card2conjunction(card);
|
|
479
|
+
else if (card.size === 1) this.card2disjunction(card);
|
|
480
|
+
else {
|
|
481
|
+
this.cards[boolVar] = card;
|
|
482
|
+
this.cardTrail.push(boolVar);
|
|
483
|
+
}
|
|
484
|
+
return true;
|
|
485
|
+
}
|
|
486
|
+
|
|
487
|
+
private card2conjunction(card: Card) {
|
|
488
|
+
const context = this.context;
|
|
489
|
+
const lits = card.args.map((arg) => negate(arg));
|
|
490
|
+
lits.push(card.lit);
|
|
491
|
+
context.mkThAxiom(lits);
|
|
492
|
+
for (const arg of card.args) context.mkThAxiom([negate(card.lit), arg]);
|
|
493
|
+
}
|
|
494
|
+
|
|
495
|
+
private card2disjunction(card: Card) {
|
|
496
|
+
const context = this.context;
|
|
497
|
+
const lits = [...card.args, negate(card.lit)];
|
|
498
|
+
context.mkThAxiom(lits);
|
|
499
|
+
for (const arg of card.args) context.mkThAxiom([card.lit, negate(arg)]);
|
|
500
|
+
}
|
|
501
|
+
|
|
502
|
+
private addCardClause(card: Card, lits: Literal[]) {
|
|
503
|
+
if (!this.resolveConflict(card, lits)) this.context.mkClause(lits, null, CLS_TH_LEMMA);
|
|
504
|
+
}
|
|
505
|
+
|
|
506
|
+
private addCardAssign(card: Card, lit: Literal) {
|
|
507
|
+
const context = this.context;
|
|
508
|
+
if (context.getAssignment(lit) === L_TRUE) return;
|
|
509
|
+
context.assign(lit, new CardJustification(this.id, card));
|
|
510
|
+
}
|
|
511
|
+
|
|
512
|
+
private clearCardWatch(card: Card) {
|
|
513
|
+
const size = Math.min(card.k + 1, card.size);
|
|
514
|
+
for (let index = 0; index < size; index++) this.unwatchCard(card.args[index], card);
|
|
515
|
+
}
|
|
516
|
+
|
|
517
|
+
private setCardConflict(card: Card, lit: Literal) {
|
|
518
|
+
const lits = [negate(card.lit), lit];
|
|
519
|
+
for (let index = card.k; index < card.size; index++) lits.push(card.args[index]);
|
|
520
|
+
this.addCardClause(card, lits);
|
|
521
|
+
}
|
|
522
|
+
|
|
523
|
+
private assignCard(card: Card, alit: Literal) {
|
|
524
|
+
const context = this.context;
|
|
525
|
+
const size = card.size;
|
|
526
|
+
const bound = card.k;
|
|
527
|
+
let index = 0;
|
|
528
|
+
for (; index <= bound; index++) if (card.args[index] === alit) break;
|
|
529
|
+
if (index === bound + 1) return L_UNDEF;
|
|
530
|
+
for (let position = bound + 1; position < size; position++) {
|
|
531
|
+
const lit2 = card.args[position];
|
|
532
|
+
if (context.getAssignment(lit2) !== L_FALSE) {
|
|
533
|
+
card.swap(index, position);
|
|
534
|
+
this.watchCard(lit2, card);
|
|
535
|
+
return L_UNDEF;
|
|
536
|
+
}
|
|
537
|
+
}
|
|
538
|
+
if (bound !== index && context.getAssignment(card.args[bound]) === L_FALSE) {
|
|
539
|
+
this.setCardConflict(card, alit);
|
|
540
|
+
return L_FALSE;
|
|
541
|
+
}
|
|
542
|
+
if (index !== bound) card.swap(index, bound);
|
|
543
|
+
for (let position = 0; position < bound && !context.isInconsistent(); position++)
|
|
544
|
+
this.addCardAssign(card, card.args[position]);
|
|
545
|
+
return context.isInconsistent() ? L_FALSE : L_TRUE;
|
|
546
|
+
}
|
|
547
|
+
|
|
548
|
+
private initCardWatch(card: Card, isTrue: boolean) {
|
|
549
|
+
const context = this.context;
|
|
550
|
+
this.clearCardWatch(card);
|
|
551
|
+
if (isNegated(card.lit) === isTrue) card.negate();
|
|
552
|
+
const size = card.size;
|
|
553
|
+
const bound = card.k;
|
|
554
|
+
if (bound === size) {
|
|
555
|
+
for (let index = 0; index < size && !context.isInconsistent(); index++)
|
|
556
|
+
this.addCardAssign(card, card.args[index]);
|
|
557
|
+
return;
|
|
558
|
+
}
|
|
559
|
+
let next = 0;
|
|
560
|
+
for (let index = 0; index < size; index++)
|
|
561
|
+
if (context.getAssignment(card.args[index]) !== L_FALSE) {
|
|
562
|
+
if (next !== index) card.swap(index, next);
|
|
563
|
+
next++;
|
|
564
|
+
}
|
|
565
|
+
if (next < bound) {
|
|
566
|
+
let alit = card.args[next];
|
|
567
|
+
// The asserting literal has the highest level, so conflict resolution can start from it.
|
|
568
|
+
for (let index = bound; index < size; index++)
|
|
569
|
+
if (context.getAssignLevel(alit) < context.getAssignLevel(card.args[index])) {
|
|
570
|
+
card.swap(next, index);
|
|
571
|
+
alit = card.args[next];
|
|
572
|
+
}
|
|
573
|
+
this.setCardConflict(card, alit);
|
|
574
|
+
} else if (next === bound) {
|
|
575
|
+
for (let index = 0; index < bound && !context.isInconsistent(); index++)
|
|
576
|
+
this.addCardAssign(card, card.args[index]);
|
|
577
|
+
} else for (let index = 0; index <= bound; index++) this.watchCard(card.args[index], card);
|
|
578
|
+
}
|
|
579
|
+
|
|
580
|
+
override assignEh(boolVar: BoolVar, isTrue: boolean) {
|
|
581
|
+
const context = this.context;
|
|
582
|
+
const falseLit = mkLiteral(boolVar, isTrue);
|
|
583
|
+
const ineqs = this.ineqWatches[falseLit];
|
|
584
|
+
if (ineqs !== undefined)
|
|
585
|
+
for (let index = 0; index < ineqs.length; index++)
|
|
586
|
+
if (this.assignWatchGe(boolVar, ineqs, index)) index--;
|
|
587
|
+
const ineq = this.ineqs[boolVar];
|
|
588
|
+
if (ineq !== undefined) this.assignIneq(ineq, isTrue);
|
|
589
|
+
const cards = this.cardWatches[falseLit];
|
|
590
|
+
if (cards !== undefined && cards.length > 0 && !context.isInconsistent()) {
|
|
591
|
+
let next = 0;
|
|
592
|
+
for (let index = 0; index < cards.length; index++) {
|
|
593
|
+
const card = cards[index];
|
|
594
|
+
if (context.getAssignment(card.lit) !== L_TRUE) continue;
|
|
595
|
+
const result = this.assignCard(card, falseLit);
|
|
596
|
+
if (result === L_FALSE) {
|
|
597
|
+
for (; index < cards.length; index++, next++) cards[next] = cards[index];
|
|
598
|
+
cards.length = next;
|
|
599
|
+
return;
|
|
600
|
+
}
|
|
601
|
+
if (result === L_TRUE) cards[next++] = card;
|
|
602
|
+
}
|
|
603
|
+
cards.length = next;
|
|
604
|
+
}
|
|
605
|
+
const card = this.cards[boolVar];
|
|
606
|
+
if (card !== undefined && !context.isInconsistent()) this.initCardWatch(card, isTrue);
|
|
607
|
+
}
|
|
608
|
+
|
|
609
|
+
private getUnhelpfulLiterals(ineq: Ineq, isNegating: boolean) {
|
|
610
|
+
const context = this.context;
|
|
611
|
+
const lits: Literal[] = [];
|
|
612
|
+
for (let index = 0; index < ineq.size; index++) {
|
|
613
|
+
const lit = ineq.getLit(index);
|
|
614
|
+
if (context.getAssignment(lit) === L_FALSE) lits.push(isNegating ? negate(lit) : lit);
|
|
615
|
+
}
|
|
616
|
+
return lits;
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
private assignIneq(ineq: Ineq, isTrue: boolean) {
|
|
620
|
+
const context = this.context;
|
|
621
|
+
if (isNegated(ineq.lit) === isTrue) {
|
|
622
|
+
ineq.lit = negate(ineq.lit);
|
|
623
|
+
context.pushTrail(() => {
|
|
624
|
+
ineq.lit = negate(ineq.lit);
|
|
625
|
+
});
|
|
626
|
+
}
|
|
627
|
+
const size = ineq.size;
|
|
628
|
+
let maxSum = 0n;
|
|
629
|
+
let minInc = 0n;
|
|
630
|
+
for (let index = 0; index < size; index++) {
|
|
631
|
+
const value = context.getAssignment(ineq.getLit(index));
|
|
632
|
+
if (value !== L_FALSE) maxSum += ineq.getCoeff(index);
|
|
633
|
+
if (value === L_UNDEF && (minInc === 0n || minInc > ineq.getCoeff(index)))
|
|
634
|
+
minInc = ineq.getCoeff(index);
|
|
635
|
+
}
|
|
636
|
+
const k = ineq.getK();
|
|
637
|
+
if (maxSum < k) {
|
|
638
|
+
const lits = this.getUnhelpfulLiterals(ineq, false);
|
|
639
|
+
lits.push(negate(ineq.lit));
|
|
640
|
+
context.mkClause(lits, null, CLS_TH_LEMMA);
|
|
641
|
+
} else this.initWatchLiteral(ineq);
|
|
642
|
+
if (maxSum >= k && maxSum - minInc < k) {
|
|
643
|
+
const lits = this.getUnhelpfulLiterals(ineq, true);
|
|
644
|
+
lits.push(ineq.lit);
|
|
645
|
+
for (let index = 0; index < size; index++) {
|
|
646
|
+
const lit = ineq.getLit(index);
|
|
647
|
+
if (context.getAssignment(lit) === L_UNDEF) this.addIneqAssign(lits, lit);
|
|
648
|
+
}
|
|
649
|
+
}
|
|
650
|
+
}
|
|
651
|
+
|
|
652
|
+
private assignWatchGe(boolVar: BoolVar, watch: Ineq[], watchIndex: number) {
|
|
653
|
+
const context = this.context;
|
|
654
|
+
const ineq = watch[watchIndex];
|
|
655
|
+
const position = ineq.findLit(boolVar, 0);
|
|
656
|
+
const k = ineq.getK();
|
|
657
|
+
const kCoeff = k + ineq.getCoeff(position);
|
|
658
|
+
let isAddingMore = ineq.watchSum < kCoeff + ineq.maxWatch;
|
|
659
|
+
for (let index = ineq.watchSize; isAddingMore && index < ineq.size; index++)
|
|
660
|
+
if (context.getAssignment(ineq.getLit(index)) !== L_FALSE) {
|
|
661
|
+
this.addWatch(ineq, index);
|
|
662
|
+
isAddingMore = ineq.watchSum < kCoeff + ineq.maxWatch;
|
|
663
|
+
}
|
|
664
|
+
if (ineq.watchSum < kCoeff) {
|
|
665
|
+
const lits = this.getUnhelpfulLiterals(ineq, false);
|
|
666
|
+
lits.push(negate(ineq.lit));
|
|
667
|
+
context.mkClause(lits, null, CLS_TH_LEMMA);
|
|
668
|
+
return false;
|
|
669
|
+
}
|
|
670
|
+
this.delWatch(watch, watchIndex, ineq, position);
|
|
671
|
+
if (ineq.watchSum < k + ineq.maxWatch) {
|
|
672
|
+
const lits = this.getUnhelpfulLiterals(ineq, true);
|
|
673
|
+
lits.push(ineq.lit);
|
|
674
|
+
const deficit = ineq.watchSum - k;
|
|
675
|
+
for (let index = 0; index < ineq.size; index++)
|
|
676
|
+
if (context.getAssignment(ineq.getLit(index)) === L_UNDEF && deficit < ineq.getCoeff(index))
|
|
677
|
+
this.addIneqAssign(lits, ineq.getLit(index));
|
|
678
|
+
}
|
|
679
|
+
return true;
|
|
680
|
+
}
|
|
681
|
+
|
|
682
|
+
private addIneqAssign(lits: Literal[], lit: Literal) {
|
|
683
|
+
this.context.assign(lit, new TheoryJustification(this.id, [...lits], []));
|
|
684
|
+
}
|
|
685
|
+
|
|
686
|
+
override pushScopeEh() {
|
|
687
|
+
super.pushScopeEh();
|
|
688
|
+
this.ineqsLim.push(this.ineqsTrail.length);
|
|
689
|
+
this.cardLim.push(this.cardTrail.length);
|
|
690
|
+
}
|
|
691
|
+
|
|
692
|
+
override popScopeEh(numScopes: number) {
|
|
693
|
+
let newLim = this.ineqsLim.length - numScopes;
|
|
694
|
+
let size = this.ineqsLim[newLim];
|
|
695
|
+
for (let index = this.ineqsTrail.length - 1; index >= size; index--) {
|
|
696
|
+
const boolVar = this.ineqsTrail[index];
|
|
697
|
+
const ineq = this.ineqs[boolVar];
|
|
698
|
+
if (ineq !== undefined) this.clearIneqWatch(ineq);
|
|
699
|
+
this.ineqs[boolVar] = undefined;
|
|
700
|
+
}
|
|
701
|
+
this.ineqsTrail.length = size;
|
|
702
|
+
this.ineqsLim.length = newLim;
|
|
703
|
+
newLim = this.cardLim.length - numScopes;
|
|
704
|
+
size = this.cardLim[newLim];
|
|
705
|
+
for (let index = this.cardTrail.length - 1; index >= size; index--) {
|
|
706
|
+
const boolVar = this.cardTrail[index];
|
|
707
|
+
const card = this.cards[boolVar];
|
|
708
|
+
if (card !== undefined) this.clearCardWatch(card);
|
|
709
|
+
this.cards[boolVar] = undefined;
|
|
710
|
+
}
|
|
711
|
+
this.cardTrail.length = size;
|
|
712
|
+
this.cardLim.length = newLim;
|
|
713
|
+
super.popScopeEh(numScopes);
|
|
714
|
+
}
|
|
715
|
+
|
|
716
|
+
private clearIneqWatch(ineq: Ineq) {
|
|
717
|
+
for (let index = 0; index < ineq.size; index++) this.unwatchIneq(ineq.getLit(index), ineq);
|
|
718
|
+
ineq.watchSum = 0n;
|
|
719
|
+
ineq.watchSize = 0;
|
|
720
|
+
ineq.maxWatch = 0n;
|
|
721
|
+
}
|
|
722
|
+
|
|
723
|
+
private initWatchLiteral(ineq: Ineq) {
|
|
724
|
+
ineq.watchSum = 0n;
|
|
725
|
+
ineq.watchSize = 0;
|
|
726
|
+
ineq.maxWatch = 0n;
|
|
727
|
+
let isWatchingMore = true;
|
|
728
|
+
for (let index = 0; isWatchingMore && index < ineq.size; index++)
|
|
729
|
+
if (this.context.getAssignment(ineq.getLit(index)) !== L_FALSE) {
|
|
730
|
+
this.addWatch(ineq, index);
|
|
731
|
+
isWatchingMore = ineq.watchSum < ineq.getK() + ineq.maxWatch;
|
|
732
|
+
}
|
|
733
|
+
this.context.pushTrail(() => {
|
|
734
|
+
for (let index = 0; index < ineq.watchSize; index++)
|
|
735
|
+
this.unwatchIneq(ineq.getLit(index), ineq);
|
|
736
|
+
ineq.watchSize = 0;
|
|
737
|
+
ineq.watchSum = 0n;
|
|
738
|
+
ineq.maxWatch = 0n;
|
|
739
|
+
});
|
|
740
|
+
}
|
|
741
|
+
|
|
742
|
+
private getCoeffOf(boolVar: BoolVar) {
|
|
743
|
+
return this.coeffs[boolVar] ?? 0;
|
|
744
|
+
}
|
|
745
|
+
|
|
746
|
+
private getAbsCoeff(boolVar: BoolVar) {
|
|
747
|
+
return Math.abs(this.getCoeffOf(boolVar));
|
|
748
|
+
}
|
|
749
|
+
|
|
750
|
+
private resetCoeffs() {
|
|
751
|
+
for (const boolVar of this.activeVars) this.coeffs[boolVar] = 0;
|
|
752
|
+
this.activeVars = [];
|
|
753
|
+
}
|
|
754
|
+
|
|
755
|
+
private processAntecedent(lit: Literal, offset: number) {
|
|
756
|
+
const context = this.context;
|
|
757
|
+
const boolVar = getVar(lit);
|
|
758
|
+
const level = context.getAssignLevel(lit);
|
|
759
|
+
if (level > context.baseLevel && !context.isMarked(boolVar) && level === this.conflictLvl) {
|
|
760
|
+
context.setMark(boolVar, true);
|
|
761
|
+
this.numMarks++;
|
|
762
|
+
}
|
|
763
|
+
this.incCoeff(lit, offset);
|
|
764
|
+
}
|
|
765
|
+
|
|
766
|
+
private processCard(card: Card, offset: number) {
|
|
767
|
+
for (let index = card.k; index < card.size; index++)
|
|
768
|
+
this.processAntecedent(card.args[index], offset);
|
|
769
|
+
for (let index = 0; index < card.k; index++) this.incCoeff(card.args[index], offset);
|
|
770
|
+
if (this.context.getAssignLevel(card.lit) > this.context.baseLevel)
|
|
771
|
+
this.antecedents.push(card.lit);
|
|
772
|
+
}
|
|
773
|
+
|
|
774
|
+
// Z3 never raises the level it compares against from 0, so this picks the last false active
|
|
775
|
+
// literal, not the one with the highest level.
|
|
776
|
+
private getAssertingLiteral(input: Literal) {
|
|
777
|
+
const context = this.context;
|
|
778
|
+
const boolVar = getVar(input);
|
|
779
|
+
if (
|
|
780
|
+
context.getAssignment(input) === L_FALSE &&
|
|
781
|
+
this.getAbsCoeff(boolVar) !== 0 &&
|
|
782
|
+
input === mkLiteral(boolVar, this.getCoeffOf(boolVar) < 0)
|
|
783
|
+
)
|
|
784
|
+
return input;
|
|
785
|
+
let lit = input;
|
|
786
|
+
for (const active of this.activeVars) {
|
|
787
|
+
const candidate = mkLiteral(active, this.getCoeffOf(active) < 0);
|
|
788
|
+
if (context.getAssignment(candidate) === L_FALSE && context.getAssignLevel(candidate) > 0)
|
|
789
|
+
lit = candidate;
|
|
790
|
+
}
|
|
791
|
+
return lit;
|
|
792
|
+
}
|
|
793
|
+
|
|
794
|
+
private normalizeActiveCoeffs() {
|
|
795
|
+
this.activeVarSet.clear();
|
|
796
|
+
let next = 0;
|
|
797
|
+
for (const boolVar of this.activeVars)
|
|
798
|
+
if (!this.activeVarSet.has(boolVar) && this.getCoeffOf(boolVar) !== 0) {
|
|
799
|
+
this.activeVarSet.add(boolVar);
|
|
800
|
+
this.activeVars[next++] = boolVar;
|
|
801
|
+
}
|
|
802
|
+
this.activeVars.length = next;
|
|
803
|
+
}
|
|
804
|
+
|
|
805
|
+
private incCoeff(lit: Literal, offset: number) {
|
|
806
|
+
const boolVar = getVar(lit);
|
|
807
|
+
const coeff0 = this.getCoeffOf(boolVar);
|
|
808
|
+
if (coeff0 === 0) this.activeVars.push(boolVar);
|
|
809
|
+
const inc = isNegated(lit) ? -offset : offset;
|
|
810
|
+
const coeff1 = inc + coeff0;
|
|
811
|
+
this.coeffs[boolVar] = coeff1;
|
|
812
|
+
if (coeff0 > 0 && inc < 0) this.bound -= coeff0 - Math.max(0, coeff1);
|
|
813
|
+
else if (coeff0 < 0 && inc > 0) this.bound -= Math.min(0, coeff1) - coeff0;
|
|
814
|
+
}
|
|
815
|
+
|
|
816
|
+
private cut() {
|
|
817
|
+
let gcd = 0;
|
|
818
|
+
for (let index = 0; gcd !== 1 && index < this.activeVars.length; index++) {
|
|
819
|
+
const boolVar = this.activeVars[index];
|
|
820
|
+
let coeff = this.getAbsCoeff(boolVar);
|
|
821
|
+
if (coeff === 0) continue;
|
|
822
|
+
if (this.bound < coeff) {
|
|
823
|
+
this.coeffs[boolVar] = this.getCoeffOf(boolVar) > 0 ? this.bound : -this.bound;
|
|
824
|
+
coeff = this.bound;
|
|
825
|
+
}
|
|
826
|
+
gcd = gcd === 0 ? coeff : Number(getGcd(BigInt(gcd), BigInt(coeff)));
|
|
827
|
+
}
|
|
828
|
+
if (gcd < 2) return;
|
|
829
|
+
this.normalizeActiveCoeffs();
|
|
830
|
+
for (const boolVar of this.activeVars)
|
|
831
|
+
this.coeffs[boolVar] = Math.trunc(this.coeffs[boolVar] / gcd);
|
|
832
|
+
// The bound is added to the unsigned divisor as an unsigned number.
|
|
833
|
+
this.bound = Math.floor(((this.bound + gcd - 1) >>> 0) / gcd) | 0;
|
|
834
|
+
}
|
|
835
|
+
|
|
836
|
+
private resolveConflict(card: Card, conflict: Literal[]) {
|
|
837
|
+
const context = this.context;
|
|
838
|
+
this.conflictLvl = 0;
|
|
839
|
+
for (const lit of conflict)
|
|
840
|
+
this.conflictLvl = Math.max(this.conflictLvl, context.getAssignLevel(lit));
|
|
841
|
+
if (
|
|
842
|
+
this.conflictLvl < context.getAssignLevel(card.lit) ||
|
|
843
|
+
this.conflictLvl === context.baseLevel
|
|
844
|
+
)
|
|
845
|
+
return false;
|
|
846
|
+
this.resetCoeffs();
|
|
847
|
+
this.numMarks = 0;
|
|
848
|
+
this.bound = card.k;
|
|
849
|
+
this.antecedents = [];
|
|
850
|
+
this.processCard(card, 1);
|
|
851
|
+
const lits = context.assignedLiterals;
|
|
852
|
+
let index = lits.length - 1;
|
|
853
|
+
let consequent = negate(conflict[2]);
|
|
854
|
+
const clearMarks = () => {
|
|
855
|
+
while (this.numMarks > 0 && index > 0) {
|
|
856
|
+
const boolVar = getVar(lits[index]);
|
|
857
|
+
if (context.isMarked(boolVar)) context.setMark(boolVar, false);
|
|
858
|
+
index--;
|
|
859
|
+
}
|
|
860
|
+
};
|
|
861
|
+
while (this.numMarks > 0) {
|
|
862
|
+
const offset = this.getAbsCoeff(getVar(consequent));
|
|
863
|
+
if (offset > 1000) {
|
|
864
|
+
clearMarks();
|
|
865
|
+
return false;
|
|
866
|
+
}
|
|
867
|
+
if (offset !== 0) {
|
|
868
|
+
const justification = context.justifications[getVar(consequent)];
|
|
869
|
+
let bound = 1;
|
|
870
|
+
if (justification instanceof Justification) {
|
|
871
|
+
if (justification.fromTheory === this.id && justification instanceof CardJustification) {
|
|
872
|
+
this.processCard(justification.card, offset);
|
|
873
|
+
bound = justification.card.k;
|
|
874
|
+
} else bound = 0;
|
|
875
|
+
} else if (justification instanceof BinJustification) {
|
|
876
|
+
this.incCoeff(consequent, offset);
|
|
877
|
+
this.processAntecedent(negate(justification.literal), offset);
|
|
878
|
+
} else if (justification === null || justification === "axiom") bound = 0;
|
|
879
|
+
else {
|
|
880
|
+
this.incCoeff(consequent, offset);
|
|
881
|
+
const clauses = context.clauses;
|
|
882
|
+
const clauseJustification = clauses.getJustification(justification);
|
|
883
|
+
if (clauseJustification instanceof UnitResolutionJustification) {
|
|
884
|
+
clearMarks();
|
|
885
|
+
return false;
|
|
886
|
+
}
|
|
887
|
+
if (clauseJustification === null) {
|
|
888
|
+
const numLiterals = clauses.getNumLiterals(justification);
|
|
889
|
+
this.processAntecedent(
|
|
890
|
+
clauses.getLiteral(
|
|
891
|
+
justification,
|
|
892
|
+
clauses.getLiteral(justification, 0) === consequent ? 1 : 0,
|
|
893
|
+
),
|
|
894
|
+
offset,
|
|
895
|
+
);
|
|
896
|
+
for (let position = 2; position < numLiterals; position++)
|
|
897
|
+
this.processAntecedent(clauses.getLiteral(justification, position), offset);
|
|
898
|
+
}
|
|
899
|
+
}
|
|
900
|
+
this.bound += offset * bound;
|
|
901
|
+
this.cut();
|
|
902
|
+
}
|
|
903
|
+
for (;;) {
|
|
904
|
+
consequent = lits[index];
|
|
905
|
+
if (context.isMarked(getVar(consequent))) break;
|
|
906
|
+
index--;
|
|
907
|
+
}
|
|
908
|
+
context.setMark(getVar(consequent), false);
|
|
909
|
+
index--;
|
|
910
|
+
this.numMarks--;
|
|
911
|
+
}
|
|
912
|
+
this.normalizeActiveCoeffs();
|
|
913
|
+
if (this.bound > 0 && this.activeVars.length === 0) return false;
|
|
914
|
+
let slack = -this.bound;
|
|
915
|
+
for (const boolVar of this.activeVars) slack += this.getAbsCoeff(boolVar);
|
|
916
|
+
const alit = this.getAssertingLiteral(negate(consequent));
|
|
917
|
+
slack -= this.getAbsCoeff(getVar(alit));
|
|
918
|
+
for (let position = lits.length; 0 <= slack && position-- > 0;) {
|
|
919
|
+
const lit = lits[position];
|
|
920
|
+
const boolVar = getVar(lit);
|
|
921
|
+
if (!this.activeVarSet.has(boolVar) || boolVar === getVar(alit)) continue;
|
|
922
|
+
const coeff = this.getCoeffOf(boolVar);
|
|
923
|
+
if (coeff < 0 && !isNegated(lit)) {
|
|
924
|
+
slack += coeff;
|
|
925
|
+
this.antecedents.push(lit);
|
|
926
|
+
} else if (coeff > 0 && isNegated(lit)) {
|
|
927
|
+
slack -= coeff;
|
|
928
|
+
this.antecedents.push(lit);
|
|
929
|
+
}
|
|
930
|
+
}
|
|
931
|
+
context.assign(alit, new TheoryJustification(this.id, [...this.antecedents], []));
|
|
932
|
+
return true;
|
|
933
|
+
}
|
|
934
|
+
}
|