tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,296 @@
|
|
|
1
|
+
import { SmtInvariantError } from "../../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
OP_ITE,
|
|
5
|
+
OP_LT,
|
|
6
|
+
OP_NOT,
|
|
7
|
+
OP_ULEQ,
|
|
8
|
+
SORT_BOOL,
|
|
9
|
+
SORT_INT,
|
|
10
|
+
SORT_REAL,
|
|
11
|
+
} from "../ast";
|
|
12
|
+
import { mkBvApp } from "../bv-decl-plugin";
|
|
13
|
+
import { ObjHashtable } from "../hashtable";
|
|
14
|
+
import {
|
|
15
|
+
type CondMacro,
|
|
16
|
+
collectMacroCandidates,
|
|
17
|
+
releaseCondMacros,
|
|
18
|
+
solveMacros,
|
|
19
|
+
} from "../model-macro-solver";
|
|
20
|
+
import { FuncInterp, type ProtoModel } from "../proto-model";
|
|
21
|
+
import { RefVector } from "../ref-vector";
|
|
22
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
|
|
23
|
+
import type { EufSolver } from "./euf-solver";
|
|
24
|
+
import type { QSolver } from "./q-solver";
|
|
25
|
+
|
|
26
|
+
// subterms::ground: the subterms of an expression, outside quantifier bodies.
|
|
27
|
+
export const getSubterms = (manager: AstManager, expr: number) => {
|
|
28
|
+
const subterms: number[] = [];
|
|
29
|
+
const stack = [expr];
|
|
30
|
+
const visited = new Set<number>();
|
|
31
|
+
while (stack.length > 0) {
|
|
32
|
+
const current = stack[stack.length - 1];
|
|
33
|
+
subterms.push(current);
|
|
34
|
+
visited.add(current);
|
|
35
|
+
if (manager.isApp(current)) stack.push(...manager.getArgs(current));
|
|
36
|
+
while (stack.length > 0 && visited.has(stack[stack.length - 1])) stack.pop();
|
|
37
|
+
}
|
|
38
|
+
return subterms;
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
export const isUninterpretedApp = (manager: AstManager, expr: number) =>
|
|
42
|
+
manager.isApp(expr) && manager.isUninterpreted(expr);
|
|
43
|
+
|
|
44
|
+
// The quantifier_macro_info of a flattened quantifier, with the macro candidates of its body.
|
|
45
|
+
interface MacroInfo {
|
|
46
|
+
readonly condMacros: CondMacro[];
|
|
47
|
+
readonly ngDecls: Set<number>;
|
|
48
|
+
readonly isAuf: boolean;
|
|
49
|
+
readonly flatQ: number;
|
|
50
|
+
theOne: number | null;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
// projection_function: the order of the values of a sort, and its strict comparison.
|
|
54
|
+
interface ProjectionFunction {
|
|
55
|
+
readonly isLess: (first: number, second: number) => boolean;
|
|
56
|
+
readonly mkLt: (first: number, second: number) => number;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
// projection_meta_data: the sorted values an argument of a function has, and a term of each.
|
|
60
|
+
interface ProjectionData {
|
|
61
|
+
readonly values: RefVector;
|
|
62
|
+
readonly value2Term: Map<number, number>;
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
const getProjectionTerm = (data: ProjectionData, value: number) => {
|
|
66
|
+
const term = data.value2Term.get(value);
|
|
67
|
+
if (term === undefined) throw new SmtInvariantError("a projection value has a term");
|
|
68
|
+
return term;
|
|
69
|
+
};
|
|
70
|
+
|
|
71
|
+
const isArithValueSupported = (manager: AstManager, expr: number) =>
|
|
72
|
+
manager.isNumeral(expr) || manager.isAlgebraicNumeral(expr);
|
|
73
|
+
|
|
74
|
+
const isArithValueLess = (manager: AstManager, first: number, second: number) =>
|
|
75
|
+
first !== second && manager.compareArithValues(first, second) < 0;
|
|
76
|
+
|
|
77
|
+
export class ModelFixer {
|
|
78
|
+
private readonly manager: AstManager;
|
|
79
|
+
private q2info = new Map<number, MacroInfo>();
|
|
80
|
+
private readonly macroRewriter: Rewriter;
|
|
81
|
+
private projectionData = new Map<string, ProjectionData>();
|
|
82
|
+
|
|
83
|
+
constructor(
|
|
84
|
+
private readonly ctx: EufSolver,
|
|
85
|
+
private readonly qs: QSolver,
|
|
86
|
+
) {
|
|
87
|
+
this.manager = ctx.manager;
|
|
88
|
+
this.macroRewriter = new Rewriter(ctx.manager, TACTIC_REWRITER_OPTIONS);
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
// operator(): macros for the universal quantifiers, then an else for every partial function.
|
|
92
|
+
fix(model: ProtoModel) {
|
|
93
|
+
const manager = this.manager;
|
|
94
|
+
const univ = this.qs.universal.map((lit) => this.ctx.boolVar2expr(lit >> 1) as number);
|
|
95
|
+
if (univ.length === 0) return;
|
|
96
|
+
this.resetProjectionData();
|
|
97
|
+
const qs = solveMacros(manager, model, univ, (quantifier) => this.getInfo(quantifier));
|
|
98
|
+
this.addProjectionFunctions(model, qs);
|
|
99
|
+
const decls = model.getFuncDecls();
|
|
100
|
+
for (let index = decls.length; index-- > 0;) {
|
|
101
|
+
const decl = decls[index];
|
|
102
|
+
const interp = model.funcInterps.get(decl);
|
|
103
|
+
if (interp === undefined) continue;
|
|
104
|
+
const maxOcc = interp.isPartial() ? interp.getMaxOccResult() : null;
|
|
105
|
+
if (maxOcc !== null) interp.setElse(maxOcc);
|
|
106
|
+
if (interp.isPartial()) interp.setElse(model.getSomeValue(manager.funcDecls[decl].range));
|
|
107
|
+
}
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
private resetProjectionData() {
|
|
111
|
+
for (const data of this.projectionData.values()) data.values.reset();
|
|
112
|
+
this.projectionData.clear();
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
private getInfo(quantifier: number) {
|
|
116
|
+
const existing = this.q2info.get(quantifier);
|
|
117
|
+
if (existing !== undefined) return existing;
|
|
118
|
+
const manager = this.manager;
|
|
119
|
+
const flatQ = this.qs.flatten(quantifier);
|
|
120
|
+
const info: MacroInfo = {
|
|
121
|
+
condMacros: collectMacroCandidates(manager, this.macroRewriter, flatQ),
|
|
122
|
+
ngDecls: new Set(),
|
|
123
|
+
isAuf: true,
|
|
124
|
+
flatQ,
|
|
125
|
+
theOne: null,
|
|
126
|
+
};
|
|
127
|
+
this.q2info.set(quantifier, info);
|
|
128
|
+
this.ctx.trail.push(() => {
|
|
129
|
+
this.q2info.delete(quantifier);
|
|
130
|
+
releaseCondMacros(manager, info.condMacros);
|
|
131
|
+
});
|
|
132
|
+
return info;
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
private addProjectionFunctions(model: ProtoModel, qs: readonly number[]) {
|
|
136
|
+
const manager = this.manager;
|
|
137
|
+
const decls = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
138
|
+
for (const quantifier of qs) {
|
|
139
|
+
const body = manager.getQuantifier(this.getInfo(quantifier).flatQ).body;
|
|
140
|
+
for (const subterm of getSubterms(manager, body))
|
|
141
|
+
if (isUninterpretedApp(manager, subterm) && !manager.isGroundApp(subterm))
|
|
142
|
+
decls.add(manager.decls[subterm]);
|
|
143
|
+
}
|
|
144
|
+
for (const decl of decls) this.addProjectionFunctionsOf(model, decl);
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
// f becomes f_aux(p_1(x_1), ..., p_n(x_n)), for f_aux the old interpretation of f and p_i the
|
|
148
|
+
// projection of its i'th argument onto the values that argument has in the e-graph.
|
|
149
|
+
private addProjectionFunctionsOf(model: ProtoModel, decl: number) {
|
|
150
|
+
const manager = this.manager;
|
|
151
|
+
const interp = model.funcInterps.get(decl);
|
|
152
|
+
if (interp === undefined || interp.isConstant()) return;
|
|
153
|
+
const info = manager.funcDecls[decl];
|
|
154
|
+
const args = new RefVector(manager);
|
|
155
|
+
info.domain.forEach((_sort, index) =>
|
|
156
|
+
args.push(this.addProjectionFunction(model, decl, index)),
|
|
157
|
+
);
|
|
158
|
+
if (interp.isPartial() && interp.entries.length > 0) {
|
|
159
|
+
const index = this.ctx.s.rand.next() % interp.entries.length;
|
|
160
|
+
interp.setElse(interp.entries[index].result);
|
|
161
|
+
interp.delEntry(index);
|
|
162
|
+
}
|
|
163
|
+
if (args.items.every((arg) => manager.isVar(arg))) {
|
|
164
|
+
args.reset();
|
|
165
|
+
return;
|
|
166
|
+
}
|
|
167
|
+
const auxDecl = manager.mkFreshFuncDecl(info.name, info.domain, info.range, true, "aux");
|
|
168
|
+
const projected = new FuncInterp(manager, info.domain.length);
|
|
169
|
+
projected.setElse(manager.mkApp(auxDecl, args.items, info.range));
|
|
170
|
+
args.reset();
|
|
171
|
+
model.updateFuncInterp(decl, projected);
|
|
172
|
+
model.registerFunc(auxDecl, interp);
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
// p(x) := if x < v_2 then v_1 else if x < v_3 then v_2 ... else v_n, for the sorted values v_i
|
|
176
|
+
// of the idx'th arguments of the applications of f.
|
|
177
|
+
private addProjectionFunction(model: ProtoModel, decl: number, index: number) {
|
|
178
|
+
const manager = this.manager;
|
|
179
|
+
const sort = manager.funcDecls[decl].domain[index];
|
|
180
|
+
const variable = manager.mkVar(index, sort);
|
|
181
|
+
const projection = this.getProjection(sort);
|
|
182
|
+
if (projection === undefined) return variable;
|
|
183
|
+
const values = new RefVector(manager);
|
|
184
|
+
const value2Term = new Map<number, number>();
|
|
185
|
+
for (const node of this.ctx.egraph.enodesOf(decl)) {
|
|
186
|
+
const term = node.getArg(index).owner;
|
|
187
|
+
values.pushOwned(model.eval(term, false));
|
|
188
|
+
const value = values.items[values.size - 1];
|
|
189
|
+
if (!manager.isValue(value)) {
|
|
190
|
+
values.reset();
|
|
191
|
+
return variable;
|
|
192
|
+
}
|
|
193
|
+
value2Term.set(value, term);
|
|
194
|
+
}
|
|
195
|
+
if (values.size === 0) return variable;
|
|
196
|
+
const isArith = sort === SORT_INT || sort === SORT_REAL;
|
|
197
|
+
if (isArith && !values.items.every((value) => isArithValueSupported(manager, value))) {
|
|
198
|
+
values.reset();
|
|
199
|
+
return variable;
|
|
200
|
+
}
|
|
201
|
+
const sorted = values.items.toSorted((first, second) =>
|
|
202
|
+
projection.isLess(first, second) ? -1 : projection.isLess(second, first) ? 1 : 0,
|
|
203
|
+
);
|
|
204
|
+
const unique = new RefVector(manager);
|
|
205
|
+
sorted.forEach((value, position) => {
|
|
206
|
+
if (position === 0 || sorted[position - 1] !== value) unique.push(value);
|
|
207
|
+
});
|
|
208
|
+
values.reset();
|
|
209
|
+
this.projectionData.set(`${decl}:${index}`, { values: unique, value2Term });
|
|
210
|
+
const bound = manager.mkVar(0, sort);
|
|
211
|
+
let projected = unique.items[unique.size - 1];
|
|
212
|
+
for (let position = unique.size - 1; position >= 1; position--)
|
|
213
|
+
projected = manager.mkApp(
|
|
214
|
+
OP_ITE,
|
|
215
|
+
[projection.mkLt(bound, unique.items[position]), unique.items[position - 1], projected],
|
|
216
|
+
sort,
|
|
217
|
+
);
|
|
218
|
+
const interp = new FuncInterp(manager, 1);
|
|
219
|
+
interp.setElse(projected);
|
|
220
|
+
const projectionDecl = manager.mkFreshFuncDecl(null, [sort], sort);
|
|
221
|
+
model.registerFunc(projectionDecl, interp);
|
|
222
|
+
return manager.mkApp(projectionDecl, [variable], sort);
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
private getProjection(sort: number): ProjectionFunction | undefined {
|
|
226
|
+
const manager = this.manager;
|
|
227
|
+
if (sort === SORT_INT || sort === SORT_REAL)
|
|
228
|
+
return {
|
|
229
|
+
isLess: (first, second) => isArithValueLess(manager, first, second),
|
|
230
|
+
mkLt: (first, second) => manager.mkApp(OP_LT, [first, second], SORT_BOOL),
|
|
231
|
+
};
|
|
232
|
+
if (!manager.isBvSort(sort)) return undefined;
|
|
233
|
+
return {
|
|
234
|
+
isLess: (first, second) =>
|
|
235
|
+
manager.isBvNumeral(first) && manager.isBvNumeral(second)
|
|
236
|
+
? manager.getBvNumeralValue(first) < manager.getBvNumeralValue(second)
|
|
237
|
+
: manager.ids[first] < manager.ids[second],
|
|
238
|
+
mkLt: (first, second) =>
|
|
239
|
+
manager.mkApp(OP_NOT, [mkBvApp(manager, OP_ULEQ, [second, first])], SORT_BOOL),
|
|
240
|
+
};
|
|
241
|
+
}
|
|
242
|
+
|
|
243
|
+
// invert_app: the root of the class whose value t has.
|
|
244
|
+
invertApp(value: number) {
|
|
245
|
+
return this.ctx.values2root().get(value)?.owner ?? value;
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// invert_arg: bounds t_j <= arg < t_{j+1} on the i'th argument of t, for the terms whose values
|
|
249
|
+
// v_j <= value < v_{j+1} surround the argument's value.
|
|
250
|
+
invertArg(term: number, index: number, value: number, lits: RefVector) {
|
|
251
|
+
const manager = this.manager;
|
|
252
|
+
const decl = manager.decls[term];
|
|
253
|
+
const data = this.projectionData.get(`${decl}:${index}`);
|
|
254
|
+
if (data === undefined) return;
|
|
255
|
+
const sort = manager.funcDecls[decl].domain[index];
|
|
256
|
+
const projection = this.getProjection(sort);
|
|
257
|
+
if (projection === undefined) return;
|
|
258
|
+
const values = data.values.items;
|
|
259
|
+
if (values.length <= 1) return;
|
|
260
|
+
const arg = manager.getArg(term, index);
|
|
261
|
+
const valueSort = manager.sorts[value];
|
|
262
|
+
if (
|
|
263
|
+
(valueSort === SORT_INT || valueSort === SORT_REAL) &&
|
|
264
|
+
!isArithValueSupported(manager, value)
|
|
265
|
+
) {
|
|
266
|
+
lits.push(manager.mkEq(arg, value));
|
|
267
|
+
return;
|
|
268
|
+
}
|
|
269
|
+
const getTerm = (position: number) => getProjectionTerm(data, values[position]);
|
|
270
|
+
const mkLe = (first: number, second: number) =>
|
|
271
|
+
manager.mkApp(OP_NOT, [projection.mkLt(second, first)], SORT_BOOL);
|
|
272
|
+
if (projection.isLess(value, values[1])) {
|
|
273
|
+
lits.push(projection.mkLt(arg, getTerm(1)));
|
|
274
|
+
return;
|
|
275
|
+
}
|
|
276
|
+
for (let position = 2; position < values.length; position++)
|
|
277
|
+
if (projection.isLess(value, values[position])) {
|
|
278
|
+
lits.push(mkLe(getTerm(position - 1), arg));
|
|
279
|
+
lits.push(projection.mkLt(arg, getTerm(position)));
|
|
280
|
+
return;
|
|
281
|
+
}
|
|
282
|
+
lits.push(mkLe(getTerm(values.length - 1), arg));
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
// restrict_arg: the i'th argument of t is one of the terms of the ground applications of its
|
|
286
|
+
// function.
|
|
287
|
+
restrictArg(term: number, index: number) {
|
|
288
|
+
const manager = this.manager;
|
|
289
|
+
const data = this.projectionData.get(`${manager.decls[term]}:${index}`);
|
|
290
|
+
if (data === undefined) return manager.trueExpr;
|
|
291
|
+
const arg = manager.getArg(term, index);
|
|
292
|
+
return manager.mkOr(
|
|
293
|
+
data.values.items.map((value) => manager.mkEq(arg, getProjectionTerm(data, value))),
|
|
294
|
+
);
|
|
295
|
+
}
|
|
296
|
+
}
|
|
@@ -0,0 +1,361 @@
|
|
|
1
|
+
import {
|
|
2
|
+
KIND_QUANTIFIER,
|
|
3
|
+
OP_AND,
|
|
4
|
+
OP_EQ,
|
|
5
|
+
OP_IMPLIES,
|
|
6
|
+
OP_OR,
|
|
7
|
+
QUANTIFIER_EXISTS,
|
|
8
|
+
QUANTIFIER_FORALL,
|
|
9
|
+
QUANTIFIER_LAMBDA,
|
|
10
|
+
SORT_BOOL,
|
|
11
|
+
} from "../ast";
|
|
12
|
+
import { flattenAndVector, flattenOrVector, mkNot } from "../ast-util";
|
|
13
|
+
import { DerRewriter } from "../der";
|
|
14
|
+
import { simplifyInjAxiom } from "../inj-axiom";
|
|
15
|
+
import { L_FALSE, L_TRUE } from "../lbool";
|
|
16
|
+
import type { ProtoModel } from "../proto-model";
|
|
17
|
+
import { pullQuant } from "../pull-quant";
|
|
18
|
+
import { containsDef } from "../recfun-decl-plugin";
|
|
19
|
+
import { RefVector } from "../ref-vector";
|
|
20
|
+
import { CR_CONTINUE, CR_DONE, CR_GIVEUP } from "../sat/solver";
|
|
21
|
+
import { VarSubst } from "../var-subst";
|
|
22
|
+
import type { Enode } from "./egraph";
|
|
23
|
+
import type { EufSolver } from "./euf-solver";
|
|
24
|
+
import { Ematch } from "./q-ematch";
|
|
25
|
+
import { Mbqi } from "./q-mbi";
|
|
26
|
+
import { ThSolver } from "./th-solver";
|
|
27
|
+
|
|
28
|
+
// The family id Z3 gives "quant" when the q solver registers it.
|
|
29
|
+
const FAMILY_QUANT = 15;
|
|
30
|
+
|
|
31
|
+
export class QSolver extends ThSolver {
|
|
32
|
+
private flats = new Map<number, number>();
|
|
33
|
+
readonly universal: number[] = [];
|
|
34
|
+
readonly ematch: Ematch;
|
|
35
|
+
readonly mbqi: Mbqi;
|
|
36
|
+
private expanded: RefVector;
|
|
37
|
+
private der: DerRewriter;
|
|
38
|
+
|
|
39
|
+
constructor(ctx: EufSolver) {
|
|
40
|
+
super(ctx, "quant", FAMILY_QUANT);
|
|
41
|
+
this.mbqi = new Mbqi(ctx, this);
|
|
42
|
+
this.ematch = new Ematch(ctx, this);
|
|
43
|
+
this.expanded = new RefVector(ctx.manager);
|
|
44
|
+
this.der = new DerRewriter(ctx.manager);
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
private isQuantifier(expr: number) {
|
|
48
|
+
const manager = this.manager;
|
|
49
|
+
return (
|
|
50
|
+
manager.kinds[expr] === KIND_QUANTIFIER &&
|
|
51
|
+
manager.getQuantifier(expr).kind !== QUANTIFIER_LAMBDA
|
|
52
|
+
);
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
private isForall(expr: number) {
|
|
56
|
+
const manager = this.manager;
|
|
57
|
+
return (
|
|
58
|
+
manager.kinds[expr] === KIND_QUANTIFIER &&
|
|
59
|
+
manager.getQuantifier(expr).kind === QUANTIFIER_FORALL
|
|
60
|
+
);
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
asserted(lit: number) {
|
|
64
|
+
const ctx = this.ctx;
|
|
65
|
+
const manager = this.manager;
|
|
66
|
+
const expr = this.boolVar2expr(lit >> 1) as number;
|
|
67
|
+
if (!this.isQuantifier(expr)) return;
|
|
68
|
+
const isSign = (lit & 1) === 1;
|
|
69
|
+
if (isSign === this.isForall(expr)) {
|
|
70
|
+
this.addClause([lit ^ 1, this.skolemize(expr)]);
|
|
71
|
+
return;
|
|
72
|
+
}
|
|
73
|
+
let flat = this.flats.get(expr);
|
|
74
|
+
if (flat === undefined) {
|
|
75
|
+
if (this.expand(expr)) {
|
|
76
|
+
for (const expanded of this.expanded.items)
|
|
77
|
+
this.addClause([lit ^ 1, ctx.internalize(expanded, isSign, false)]);
|
|
78
|
+
return;
|
|
79
|
+
}
|
|
80
|
+
flat = this.flatten(expr);
|
|
81
|
+
}
|
|
82
|
+
const body = manager.getQuantifier(flat).body;
|
|
83
|
+
if (manager.isGroundApp(body)) {
|
|
84
|
+
this.addClause([lit ^ 1, ctx.internalize(body, isSign, false)]);
|
|
85
|
+
return;
|
|
86
|
+
}
|
|
87
|
+
this.universal.push(lit);
|
|
88
|
+
ctx.trail.push(() => this.universal.pop());
|
|
89
|
+
this.ematch.add(expr);
|
|
90
|
+
}
|
|
91
|
+
|
|
92
|
+
check() {
|
|
93
|
+
if (this.ematch.run()) return CR_CONTINUE;
|
|
94
|
+
const result = this.mbqi.run();
|
|
95
|
+
if (result === L_TRUE) return CR_DONE;
|
|
96
|
+
if (result === L_FALSE) return CR_CONTINUE;
|
|
97
|
+
return CR_GIVEUP;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
unitPropagate() {
|
|
101
|
+
return this.ematch.unitPropagate();
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
mkVar(node: Enode) {
|
|
105
|
+
const thVar = super.mkVar(node);
|
|
106
|
+
this.ctx.egraph.addThVar(node, thVar, this.id);
|
|
107
|
+
return thVar;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
// instantiate: the literal of the body of q, or of its negation, with each bound variable
|
|
111
|
+
// replaced by mkVar.
|
|
112
|
+
private instantiate(
|
|
113
|
+
quantifier: number,
|
|
114
|
+
isNegated: boolean,
|
|
115
|
+
mkVar: (flat: number, index: number) => number,
|
|
116
|
+
) {
|
|
117
|
+
const manager = this.manager;
|
|
118
|
+
const data = manager.getQuantifier(quantifier);
|
|
119
|
+
const q = isNegated
|
|
120
|
+
? manager.withTemporaries(() =>
|
|
121
|
+
manager.mkQuantifier({
|
|
122
|
+
...data,
|
|
123
|
+
kind: data.kind === QUANTIFIER_FORALL ? QUANTIFIER_EXISTS : QUANTIFIER_FORALL,
|
|
124
|
+
body: manager.mkNot(data.body),
|
|
125
|
+
patterns: [],
|
|
126
|
+
noPatterns: [],
|
|
127
|
+
}),
|
|
128
|
+
)
|
|
129
|
+
: quantifier;
|
|
130
|
+
const flat = this.flatten(q);
|
|
131
|
+
const flatData = manager.getQuantifier(flat);
|
|
132
|
+
const vars = flatData.sorts.map((_sort, index) => mkVar(flat, index));
|
|
133
|
+
const subst = new VarSubst(manager, true);
|
|
134
|
+
const substituted = subst.apply(flatData.body, vars);
|
|
135
|
+
subst.release();
|
|
136
|
+
const body = this.rewrite(substituted);
|
|
137
|
+
manager.decRef(substituted);
|
|
138
|
+
const lit = this.mkLiteral(body);
|
|
139
|
+
manager.decRef(body);
|
|
140
|
+
if (isNegated) manager.decRef(q);
|
|
141
|
+
return lit;
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
private skolemize(quantifier: number) {
|
|
145
|
+
const manager = this.manager;
|
|
146
|
+
return this.instantiate(quantifier, this.isForall(quantifier), (flat, index) => {
|
|
147
|
+
const data = manager.getQuantifier(flat);
|
|
148
|
+
return manager.mkFreshConst(data.names[index], data.sorts[index]);
|
|
149
|
+
});
|
|
150
|
+
}
|
|
151
|
+
|
|
152
|
+
initSearch() {
|
|
153
|
+
this.mbqi.initSearch();
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
internalize(expr: number, isSign: boolean) {
|
|
157
|
+
const ctx = this.ctx;
|
|
158
|
+
const lit = ctx.attachLit(2 * ctx.si.addBoolVar(expr), expr);
|
|
159
|
+
this.mkVar(ctx.egraph.find(expr) as Enode);
|
|
160
|
+
return isSign ? lit ^ 1 : lit;
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
internalizeTerm(expr: number) {
|
|
164
|
+
this.internalize(expr, false);
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
finalizeModel(model: ProtoModel) {
|
|
168
|
+
this.mbqi.finalizeModel(model);
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
getAntecedents(_lit: number, data: unknown, antecedents: number[]) {
|
|
172
|
+
this.ematch.getAntecedents(data, antecedents);
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
// flatten: q with its nested quantifiers pulled out, or its injectivity axiom refined.
|
|
176
|
+
flatten(quantifier: number) {
|
|
177
|
+
const manager = this.manager;
|
|
178
|
+
const existing = this.flats.get(quantifier);
|
|
179
|
+
if (existing !== undefined) return existing;
|
|
180
|
+
const data = manager.getQuantifier(quantifier);
|
|
181
|
+
const flat = (() => {
|
|
182
|
+
if (!manager.hasQuantifierFlags[data.body]) return simplifyInjAxiom(manager, quantifier);
|
|
183
|
+
if (data.kind === QUANTIFIER_FORALL) return pullQuant(manager, quantifier);
|
|
184
|
+
return undefined;
|
|
185
|
+
})();
|
|
186
|
+
if (flat === undefined && !manager.hasQuantifierFlags[data.body]) return quantifier;
|
|
187
|
+
const result = flat ?? quantifier;
|
|
188
|
+
if (flat === undefined) manager.incRef(result);
|
|
189
|
+
manager.incRef(quantifier);
|
|
190
|
+
this.flats.set(quantifier, result);
|
|
191
|
+
this.ctx.trail.push(() => {
|
|
192
|
+
this.flats.delete(quantifier);
|
|
193
|
+
manager.decRef(result);
|
|
194
|
+
manager.decRef(quantifier);
|
|
195
|
+
});
|
|
196
|
+
return result;
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
// expand: whether rewriting q gives formulas to assert in place of q, left in this.expanded.
|
|
200
|
+
// smt.q.lite is off by default, so qe-lite does not run.
|
|
201
|
+
private expand(quantifier: number) {
|
|
202
|
+
const manager = this.manager;
|
|
203
|
+
const expanded = this.expanded;
|
|
204
|
+
const simplified = this.rewrite(quantifier);
|
|
205
|
+
let rewritten = this.der.rewrite(simplified);
|
|
206
|
+
manager.decRef(simplified);
|
|
207
|
+
expanded.reset();
|
|
208
|
+
const isUpdated = quantifier !== rewritten;
|
|
209
|
+
let q = quantifier;
|
|
210
|
+
const finish = (result: boolean) => {
|
|
211
|
+
manager.decRef(rewritten);
|
|
212
|
+
return result;
|
|
213
|
+
};
|
|
214
|
+
if (isUpdated) {
|
|
215
|
+
const again = this.rewrite(rewritten);
|
|
216
|
+
manager.decRef(rewritten);
|
|
217
|
+
rewritten = again;
|
|
218
|
+
if (
|
|
219
|
+
manager.kinds[rewritten] !== KIND_QUANTIFIER ||
|
|
220
|
+
this.isForall(q) !== this.isForall(rewritten)
|
|
221
|
+
) {
|
|
222
|
+
expanded.push(rewritten);
|
|
223
|
+
return finish(true);
|
|
224
|
+
}
|
|
225
|
+
if (rewritten === q) return finish(false);
|
|
226
|
+
q = rewritten;
|
|
227
|
+
}
|
|
228
|
+
const body = manager.getQuantifier(q).body;
|
|
229
|
+
expanded.push(body);
|
|
230
|
+
if (this.isForall(q)) flattenAndVector(manager, expanded);
|
|
231
|
+
else flattenOrVector(manager, expanded);
|
|
232
|
+
if (expanded.size === 1 && this.isForall(q) && !containsDef(manager, body)) {
|
|
233
|
+
expanded.reset();
|
|
234
|
+
expanded.push(body);
|
|
235
|
+
flattenOrVector(manager, expanded);
|
|
236
|
+
let first = -1;
|
|
237
|
+
let second = -1;
|
|
238
|
+
let splitIndex = 0;
|
|
239
|
+
for (let index = expanded.size; index-- > 0;) {
|
|
240
|
+
const split = this.split(expanded.items[index]);
|
|
241
|
+
if (split === null) continue;
|
|
242
|
+
if (first !== -1) {
|
|
243
|
+
for (const part of split) manager.decRef(part);
|
|
244
|
+
manager.decRef(first);
|
|
245
|
+
manager.decRef(second);
|
|
246
|
+
return finish(false);
|
|
247
|
+
}
|
|
248
|
+
first = split[0];
|
|
249
|
+
second = split[1];
|
|
250
|
+
splitIndex = index;
|
|
251
|
+
}
|
|
252
|
+
if (first === -1 && isUpdated) {
|
|
253
|
+
expanded.reset();
|
|
254
|
+
expanded.push(rewritten);
|
|
255
|
+
return finish(true);
|
|
256
|
+
}
|
|
257
|
+
if (first === -1) return finish(false);
|
|
258
|
+
expanded.set(splitIndex, first);
|
|
259
|
+
manager.decRef(first);
|
|
260
|
+
const firstOr = manager.mkOr([...expanded.items]);
|
|
261
|
+
manager.incRef(firstOr);
|
|
262
|
+
expanded.set(splitIndex, second);
|
|
263
|
+
manager.decRef(second);
|
|
264
|
+
const secondOr = manager.mkOr([...expanded.items]);
|
|
265
|
+
manager.incRef(secondOr);
|
|
266
|
+
expanded.reset();
|
|
267
|
+
expanded.pushOwned(firstOr);
|
|
268
|
+
expanded.pushOwned(secondOr);
|
|
269
|
+
}
|
|
270
|
+
if (expanded.size > 1) {
|
|
271
|
+
const data = manager.getQuantifier(q);
|
|
272
|
+
for (let index = expanded.size; index-- > 0;) {
|
|
273
|
+
const updated = manager.withTemporaries(() =>
|
|
274
|
+
manager.mkQuantifier({ ...data, body: expanded.items[index] }),
|
|
275
|
+
);
|
|
276
|
+
expanded.setOwned(index, this.rewrite(updated));
|
|
277
|
+
manager.decRef(updated);
|
|
278
|
+
}
|
|
279
|
+
return finish(true);
|
|
280
|
+
}
|
|
281
|
+
if (expanded.size === 1 && isUpdated) {
|
|
282
|
+
expanded.set(0, rewritten);
|
|
283
|
+
this.flatten(rewritten);
|
|
284
|
+
return finish(true);
|
|
285
|
+
}
|
|
286
|
+
return finish(false);
|
|
287
|
+
}
|
|
288
|
+
|
|
289
|
+
// split: the two halves of a disjunct over literals, owned by the caller.
|
|
290
|
+
private split(arg: number): [number, number] | null {
|
|
291
|
+
const manager = this.manager;
|
|
292
|
+
const isNot = manager.isNot(arg);
|
|
293
|
+
const inner = isNot ? manager.getArg(arg, 0) : -1;
|
|
294
|
+
const isBinary = (expr: number, op: number) =>
|
|
295
|
+
manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
|
|
296
|
+
const isIff = (expr: number) =>
|
|
297
|
+
isBinary(expr, OP_EQ) && manager.isBool(manager.getArg(expr, 0));
|
|
298
|
+
const own = (expr: number) => {
|
|
299
|
+
manager.incRef(expr);
|
|
300
|
+
return expr;
|
|
301
|
+
};
|
|
302
|
+
if (
|
|
303
|
+
isNot &&
|
|
304
|
+
isBinary(inner, OP_OR) &&
|
|
305
|
+
this.isLiteral(manager.getArg(inner, 0)) &&
|
|
306
|
+
this.isLiteral(manager.getArg(inner, 1))
|
|
307
|
+
)
|
|
308
|
+
return [
|
|
309
|
+
own(mkNot(manager, manager.getArg(inner, 0))),
|
|
310
|
+
own(mkNot(manager, manager.getArg(inner, 1))),
|
|
311
|
+
];
|
|
312
|
+
if (
|
|
313
|
+
isIff(arg) &&
|
|
314
|
+
this.isLiteral(manager.getArg(arg, 0)) &&
|
|
315
|
+
this.isLiteral(manager.getArg(arg, 1))
|
|
316
|
+
) {
|
|
317
|
+
const lhs = manager.getArg(arg, 0);
|
|
318
|
+
const rhs = manager.getArg(arg, 1);
|
|
319
|
+
return [
|
|
320
|
+
own(manager.mkApp(OP_IMPLIES, [lhs, rhs], SORT_BOOL)),
|
|
321
|
+
own(manager.mkApp(OP_IMPLIES, [rhs, lhs], SORT_BOOL)),
|
|
322
|
+
];
|
|
323
|
+
}
|
|
324
|
+
if (
|
|
325
|
+
isBinary(arg, OP_AND) &&
|
|
326
|
+
this.isLiteral(manager.getArg(arg, 0)) &&
|
|
327
|
+
this.isLiteral(manager.getArg(arg, 1))
|
|
328
|
+
)
|
|
329
|
+
return [own(manager.getArg(arg, 0)), own(manager.getArg(arg, 1))];
|
|
330
|
+
if (
|
|
331
|
+
isNot &&
|
|
332
|
+
isIff(inner) &&
|
|
333
|
+
this.isLiteral(manager.getArg(inner, 0)) &&
|
|
334
|
+
this.isLiteral(manager.getArg(inner, 1))
|
|
335
|
+
) {
|
|
336
|
+
const lhs = manager.getArg(inner, 0);
|
|
337
|
+
const rhs = manager.getArg(inner, 1);
|
|
338
|
+
const notLhs = mkNot(manager, lhs);
|
|
339
|
+
manager.incRef(notLhs);
|
|
340
|
+
const result: [number, number] = [
|
|
341
|
+
own(manager.mkOr([lhs, rhs])),
|
|
342
|
+
own(manager.mkOr([notLhs, mkNot(manager, rhs)])),
|
|
343
|
+
];
|
|
344
|
+
manager.decRef(notLhs);
|
|
345
|
+
return result;
|
|
346
|
+
}
|
|
347
|
+
return null;
|
|
348
|
+
}
|
|
349
|
+
|
|
350
|
+
private isLiteral(input: number) {
|
|
351
|
+
const manager = this.manager;
|
|
352
|
+
const arg = manager.isNot(input) ? manager.getArg(input, 0) : input;
|
|
353
|
+
const op = manager.getOp(arg);
|
|
354
|
+
return (
|
|
355
|
+
op !== OP_AND &&
|
|
356
|
+
op !== OP_OR &&
|
|
357
|
+
!(op === OP_EQ && manager.isBool(manager.getArg(arg, 0))) &&
|
|
358
|
+
op !== OP_IMPLIES
|
|
359
|
+
);
|
|
360
|
+
}
|
|
361
|
+
}
|