tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +47 -44
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +474 -718
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +8 -7
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +244 -238
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +31 -106
- package/src/exit-codes.ts +2 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +616 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +50 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +15 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +206 -44
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +22 -47
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +54 -26
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,189 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
KIND_APP,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_ATAN2,
|
|
9
|
+
OP_DISTINCT,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_FALSE,
|
|
12
|
+
OP_GE,
|
|
13
|
+
OP_IMPLIES,
|
|
14
|
+
OP_ITE,
|
|
15
|
+
OP_LE,
|
|
16
|
+
OP_NOT,
|
|
17
|
+
OP_OR,
|
|
18
|
+
OP_PI,
|
|
19
|
+
OP_TRUE,
|
|
20
|
+
OP_XOR,
|
|
21
|
+
SORT_BOOL,
|
|
22
|
+
SORT_INT,
|
|
23
|
+
SORT_REAL,
|
|
24
|
+
} from "./ast";
|
|
25
|
+
import { toPolynomial } from "./expr2polynomial";
|
|
26
|
+
import { getLcm } from "./rational";
|
|
27
|
+
import { flipKind } from "./nlsat/atoms";
|
|
28
|
+
import type { NlsatSolver } from "./nlsat/solver";
|
|
29
|
+
import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
|
|
30
|
+
import type { IneqKind } from "./nlsat/types";
|
|
31
|
+
|
|
32
|
+
export const goal2nlsat = (
|
|
33
|
+
manager: AstManager,
|
|
34
|
+
forms: readonly number[],
|
|
35
|
+
solver: NlsatSolver,
|
|
36
|
+
t2x: Map<number, number>,
|
|
37
|
+
a2b: Map<number, number>,
|
|
38
|
+
assumption: number | null,
|
|
39
|
+
isFactoring = true,
|
|
40
|
+
) => {
|
|
41
|
+
const pm = solver.pm;
|
|
42
|
+
|
|
43
|
+
const mkVar = (term: number) => {
|
|
44
|
+
let variable = t2x.get(term);
|
|
45
|
+
if (variable === undefined) {
|
|
46
|
+
variable = solver.mkVar(manager.sorts[term] === SORT_INT);
|
|
47
|
+
t2x.set(term, variable);
|
|
48
|
+
}
|
|
49
|
+
return variable;
|
|
50
|
+
};
|
|
51
|
+
|
|
52
|
+
const processIneq = (atom: number, kind: IneqKind) => {
|
|
53
|
+
const lhs = toPolynomial(manager, pm, manager.getArg(atom, 0), mkVar);
|
|
54
|
+
const rhs = toPolynomial(manager, pm, manager.getArg(atom, 1), mkVar);
|
|
55
|
+
const lcm = getLcm(lhs.denominator, rhs.denominator);
|
|
56
|
+
const polynomial = pm.addmul(
|
|
57
|
+
lcm / lhs.denominator,
|
|
58
|
+
lhs.polynomial,
|
|
59
|
+
-(lcm / rhs.denominator),
|
|
60
|
+
rhs.polynomial,
|
|
61
|
+
);
|
|
62
|
+
if (pm.isConst(polynomial)) {
|
|
63
|
+
const sign = pm.isZero(polynomial) ? 0 : polynomial.as[0] > 0n ? 1 : -1;
|
|
64
|
+
const isTrue = kind === "EQ" ? sign === 0 : kind === "LT" ? sign < 0 : sign > 0;
|
|
65
|
+
return isTrue ? 0 : 1;
|
|
66
|
+
}
|
|
67
|
+
if (!isFactoring) return solver.mkIneqLiteral(kind, [polynomial], [false]);
|
|
68
|
+
const factors = pm.factor(polynomial);
|
|
69
|
+
return solver.mkIneqLiteral(
|
|
70
|
+
factors.constant < 0n ? flipKind(kind) : kind,
|
|
71
|
+
factors.factors,
|
|
72
|
+
factors.degrees.map((degree) => degree % 2 === 0),
|
|
73
|
+
);
|
|
74
|
+
};
|
|
75
|
+
|
|
76
|
+
const processBoolVar = (atom: number) => {
|
|
77
|
+
const existing = a2b.get(atom);
|
|
78
|
+
if (existing !== undefined) return 2 * existing;
|
|
79
|
+
const boolVar = solver.mkBoolVar();
|
|
80
|
+
a2b.set(atom, boolVar);
|
|
81
|
+
return 2 * boolVar;
|
|
82
|
+
};
|
|
83
|
+
|
|
84
|
+
const processAtom = (atom: number) => {
|
|
85
|
+
if (manager.kinds[atom] !== KIND_APP) return processBoolVar(atom);
|
|
86
|
+
const op = manager.getOp(atom);
|
|
87
|
+
const family = manager.getFamily(atom);
|
|
88
|
+
if (op === OP_EQ) {
|
|
89
|
+
const sort = manager.sorts[manager.getArg(atom, 0)];
|
|
90
|
+
return sort === SORT_INT || sort === SORT_REAL
|
|
91
|
+
? processIneq(atom, "EQ")
|
|
92
|
+
: processBoolVar(atom);
|
|
93
|
+
}
|
|
94
|
+
if (op === OP_LE) return processIneq(atom, "GT") ^ 1;
|
|
95
|
+
if (op === OP_GE) return processIneq(atom, "LT") ^ 1;
|
|
96
|
+
if (family === FAMILY_BASIC) {
|
|
97
|
+
if (op === OP_TRUE || op === OP_FALSE)
|
|
98
|
+
throw new SmtTacticError("apply simplify before applying nlsat");
|
|
99
|
+
if ([OP_AND, OP_OR, OP_XOR, OP_NOT, OP_IMPLIES, OP_ITE].includes(op))
|
|
100
|
+
throw new SmtTacticError("convert goal into cnf before applying nlsat");
|
|
101
|
+
if (op === OP_DISTINCT)
|
|
102
|
+
throw new SmtTacticError(
|
|
103
|
+
"eliminate distinct operator (use tactic '(using-params simplify :blast-distinct true)') before applying nlsat",
|
|
104
|
+
);
|
|
105
|
+
}
|
|
106
|
+
if (family === FAMILY_ARITH)
|
|
107
|
+
throw new SmtTacticError("apply purify-arith before applying nlsat");
|
|
108
|
+
return processBoolVar(atom);
|
|
109
|
+
};
|
|
110
|
+
|
|
111
|
+
const processLiteral = (form: number) => {
|
|
112
|
+
let atom = form;
|
|
113
|
+
let isNeg = false;
|
|
114
|
+
while (manager.isNot(atom)) {
|
|
115
|
+
atom = manager.getArg(atom, 0);
|
|
116
|
+
isNeg = !isNeg;
|
|
117
|
+
}
|
|
118
|
+
const literal = processAtom(atom);
|
|
119
|
+
return isNeg ? literal ^ 1 : literal;
|
|
120
|
+
};
|
|
121
|
+
|
|
122
|
+
if (forms.some((form) => hasTermIte(manager, form)))
|
|
123
|
+
throw new SmtTacticError("eliminate term-ite before applying nlsat");
|
|
124
|
+
for (const form of forms) {
|
|
125
|
+
const literals = manager.getOp(form) === OP_OR ? manager.getArgs(form) : [form];
|
|
126
|
+
solver.mkExternalClause(literals.map(processLiteral), assumption);
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
// The polynomial conversion treats a transcendental application, argument included, as one
|
|
130
|
+
// variable, so its argument gets a variable here, through an equation unless it is one already.
|
|
131
|
+
const mkArgVar = (term: number) => {
|
|
132
|
+
const result = toPolynomial(manager, pm, term, mkVar);
|
|
133
|
+
const polynomial = result.polynomial;
|
|
134
|
+
const monomial = polynomial.ms[0];
|
|
135
|
+
if (
|
|
136
|
+
result.denominator === 1n &&
|
|
137
|
+
polynomial.ms.length === 1 &&
|
|
138
|
+
polynomial.as[0] === 1n &&
|
|
139
|
+
monomial.size === 1 &&
|
|
140
|
+
monomial.degrees[0] === 1
|
|
141
|
+
)
|
|
142
|
+
return monomial.vars[0];
|
|
143
|
+
const variable = solver.mkVar(false);
|
|
144
|
+
const equation = pm.addmul(result.denominator, pm.mkVar(variable), -1n, polynomial);
|
|
145
|
+
solver.mkExternalClause([solver.mkIneqLiteral("EQ", [equation], [false])], null);
|
|
146
|
+
return variable;
|
|
147
|
+
};
|
|
148
|
+
|
|
149
|
+
// An argument can bring in applications nested inside it, so this repeats to a fixed point.
|
|
150
|
+
const seen = new Set<number>();
|
|
151
|
+
let piVar: number | undefined;
|
|
152
|
+
for (let isChanged = true; isChanged;) {
|
|
153
|
+
const found = [...t2x].filter(
|
|
154
|
+
(entry) =>
|
|
155
|
+
!seen.has(entry[0]) &&
|
|
156
|
+
manager.kinds[entry[0]] === KIND_APP &&
|
|
157
|
+
manager.getFamily(entry[0]) === FAMILY_ARITH,
|
|
158
|
+
);
|
|
159
|
+
const atan2Found = found.filter((entry) => manager.getOp(entry[0]) === OP_ATAN2);
|
|
160
|
+
piVar = found.find((entry) => manager.getOp(entry[0]) === OP_PI)?.[1] ?? piVar;
|
|
161
|
+
isChanged = false;
|
|
162
|
+
for (const [term, variable] of found) {
|
|
163
|
+
const op = TRANSCENDENTAL_OPS.get(manager.getOp(term));
|
|
164
|
+
if (op === undefined) continue;
|
|
165
|
+
seen.add(term);
|
|
166
|
+
solver.transcendentals.add(op, mkArgVar(manager.getArg(term, 0)), variable);
|
|
167
|
+
isChanged = true;
|
|
168
|
+
}
|
|
169
|
+
for (const [term, variable] of atan2Found) {
|
|
170
|
+
seen.add(term);
|
|
171
|
+
const y = mkArgVar(manager.getArg(term, 0));
|
|
172
|
+
solver.transcendentals.addAtan2(y, mkArgVar(manager.getArg(term, 1)), variable);
|
|
173
|
+
isChanged = true;
|
|
174
|
+
}
|
|
175
|
+
}
|
|
176
|
+
if (piVar !== undefined) solver.transcendentals.addPi(piVar);
|
|
177
|
+
};
|
|
178
|
+
|
|
179
|
+
const hasTermIte = (manager: AstManager, form: number) => {
|
|
180
|
+
const seen = new Set<number>();
|
|
181
|
+
const todo = [form];
|
|
182
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
183
|
+
if (seen.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
|
|
184
|
+
seen.add(expr);
|
|
185
|
+
if (manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL) return true;
|
|
186
|
+
manager.pushArgs(expr, todo);
|
|
187
|
+
}
|
|
188
|
+
return false;
|
|
189
|
+
};
|
|
@@ -0,0 +1,219 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_AND,
|
|
4
|
+
OP_EQ,
|
|
5
|
+
OP_NOT,
|
|
6
|
+
OP_OR,
|
|
7
|
+
SORT_BOOL,
|
|
8
|
+
SORT_INT,
|
|
9
|
+
SORT_REAL,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { assign, release } from "./expr-ref";
|
|
12
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
13
|
+
import { Rational } from "./rational";
|
|
14
|
+
import { RefVector } from "./ref-vector";
|
|
15
|
+
import {
|
|
16
|
+
type RangePredicate,
|
|
17
|
+
guardToRangePredicate,
|
|
18
|
+
intersectRanges,
|
|
19
|
+
mkTopRange,
|
|
20
|
+
} from "./seq-range-predicate";
|
|
21
|
+
|
|
22
|
+
export interface GuardSetEval {
|
|
23
|
+
status: number;
|
|
24
|
+
witness: number;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
export class GuardSetCache {
|
|
28
|
+
private ranges = new Map<number, RangePredicate | undefined>();
|
|
29
|
+
private trail: RefVector;
|
|
30
|
+
|
|
31
|
+
constructor(manager: AstManager) {
|
|
32
|
+
this.trail = new RefVector(manager);
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
reset() {
|
|
36
|
+
this.ranges.clear();
|
|
37
|
+
this.trail.reset();
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
maybeReset(cap: number) {
|
|
41
|
+
if (this.ranges.size > cap) this.reset();
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
has(guard: number) {
|
|
45
|
+
return this.ranges.has(guard);
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
get(guard: number) {
|
|
49
|
+
return this.ranges.get(guard);
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
insert(guard: number, ranges: RangePredicate | undefined) {
|
|
53
|
+
this.trail.push(guard);
|
|
54
|
+
this.ranges.set(guard, ranges);
|
|
55
|
+
}
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
export class GuardSet {
|
|
59
|
+
private isChar: boolean;
|
|
60
|
+
private isOk = true;
|
|
61
|
+
private ranges: RangePredicate;
|
|
62
|
+
private guard = -1;
|
|
63
|
+
|
|
64
|
+
constructor(
|
|
65
|
+
private manager: AstManager,
|
|
66
|
+
private sort: number,
|
|
67
|
+
private variable: number,
|
|
68
|
+
private cache?: GuardSetCache,
|
|
69
|
+
) {
|
|
70
|
+
this.isChar = manager.isCharSort(sort);
|
|
71
|
+
this.ranges = this.isChar ? mkTopRange(manager) : [];
|
|
72
|
+
if (!this.isChar) this.guard = assign(manager, -1, manager.trueExpr);
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
release() {
|
|
76
|
+
release(this.manager, this.guard);
|
|
77
|
+
this.guard = -1;
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
clone() {
|
|
81
|
+
const copy = new GuardSet(this.manager, this.sort, this.variable, this.cache);
|
|
82
|
+
copy.isOk = this.isOk;
|
|
83
|
+
copy.ranges = this.ranges;
|
|
84
|
+
if (!this.isChar) copy.guard = assign(this.manager, copy.guard, this.guard);
|
|
85
|
+
return copy;
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
conjoin(guard: number) {
|
|
89
|
+
const manager = this.manager;
|
|
90
|
+
if (!this.isOk) return;
|
|
91
|
+
if (!this.isChar) {
|
|
92
|
+
this.guard = assign(
|
|
93
|
+
manager,
|
|
94
|
+
this.guard,
|
|
95
|
+
manager.mkApp(OP_AND, [this.guard, guard], SORT_BOOL),
|
|
96
|
+
);
|
|
97
|
+
return;
|
|
98
|
+
}
|
|
99
|
+
const cache = this.cache;
|
|
100
|
+
if (cache !== undefined) {
|
|
101
|
+
if (!cache.has(guard))
|
|
102
|
+
cache.insert(guard, guardToRangePredicate(manager, this.variable, guard));
|
|
103
|
+
const cached = cache.get(guard);
|
|
104
|
+
if (cached === undefined) {
|
|
105
|
+
this.isOk = false;
|
|
106
|
+
return;
|
|
107
|
+
}
|
|
108
|
+
this.ranges = intersectRanges(this.ranges, cached);
|
|
109
|
+
return;
|
|
110
|
+
}
|
|
111
|
+
const ranges = guardToRangePredicate(manager, this.variable, guard);
|
|
112
|
+
if (ranges === undefined) this.isOk = false;
|
|
113
|
+
else this.ranges = intersectRanges(this.ranges, ranges);
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
eval(isWitnessWanted: boolean): GuardSetEval {
|
|
117
|
+
if (!this.isOk) return { status: L_UNDEF, witness: -1 };
|
|
118
|
+
if (!this.isChar) return this.evalGeneric(isWitnessWanted);
|
|
119
|
+
if (this.ranges.length === 0) return { status: L_FALSE, witness: -1 };
|
|
120
|
+
return {
|
|
121
|
+
status: L_TRUE,
|
|
122
|
+
witness: isWitnessWanted ? this.manager.mkChar(this.ranges[0]) : -1,
|
|
123
|
+
};
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
private collectConsts(guard: number, consts: number[]) {
|
|
127
|
+
const manager = this.manager;
|
|
128
|
+
const op = manager.getOp(guard);
|
|
129
|
+
if (op === OP_AND || op === OP_OR) {
|
|
130
|
+
for (const arg of manager.getArgs(guard)) this.collectConsts(arg, consts);
|
|
131
|
+
return;
|
|
132
|
+
}
|
|
133
|
+
if (op === OP_NOT) {
|
|
134
|
+
this.collectConsts(manager.getArg(guard, 0), consts);
|
|
135
|
+
return;
|
|
136
|
+
}
|
|
137
|
+
if (op !== OP_EQ) return;
|
|
138
|
+
const first = manager.getArg(guard, 0);
|
|
139
|
+
const second = manager.getArg(guard, 1);
|
|
140
|
+
if (first === this.variable && second !== this.variable) consts.push(second);
|
|
141
|
+
else if (second === this.variable && first !== this.variable) consts.push(first);
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
private evalAt(guard: number, candidate: number): number {
|
|
145
|
+
const manager = this.manager;
|
|
146
|
+
if (manager.isTrue(guard)) return L_TRUE;
|
|
147
|
+
if (manager.isFalse(guard)) return L_FALSE;
|
|
148
|
+
const op = manager.getOp(guard);
|
|
149
|
+
if (op === OP_NOT) return -this.evalAt(manager.getArg(guard, 0), candidate);
|
|
150
|
+
if (op === OP_AND || op === OP_OR) {
|
|
151
|
+
const absorbing = op === OP_AND ? L_FALSE : L_TRUE;
|
|
152
|
+
let result = -absorbing;
|
|
153
|
+
for (const arg of manager.getArgs(guard)) {
|
|
154
|
+
const value = this.evalAt(arg, candidate);
|
|
155
|
+
if (value === absorbing) return absorbing;
|
|
156
|
+
if (value === L_UNDEF) result = L_UNDEF;
|
|
157
|
+
}
|
|
158
|
+
return result;
|
|
159
|
+
}
|
|
160
|
+
if (op !== OP_EQ) return L_UNDEF;
|
|
161
|
+
const first = manager.getArg(guard, 0);
|
|
162
|
+
const second = manager.getArg(guard, 1);
|
|
163
|
+
const other = first === this.variable ? second : second === this.variable ? first : -1;
|
|
164
|
+
if (other === -1) return L_UNDEF;
|
|
165
|
+
if (other === this.variable) return L_TRUE;
|
|
166
|
+
return candidate === other ? L_TRUE : L_FALSE;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private mkFresh(consts: number[]) {
|
|
170
|
+
const manager = this.manager;
|
|
171
|
+
const sort = this.sort;
|
|
172
|
+
if (sort === SORT_BOOL) {
|
|
173
|
+
if (!consts.some((expr) => manager.isTrue(expr))) return manager.trueExpr;
|
|
174
|
+
if (!consts.some((expr) => manager.isFalse(expr))) return manager.falseExpr;
|
|
175
|
+
return -1;
|
|
176
|
+
}
|
|
177
|
+
if (sort === SORT_INT || sort === SORT_REAL) {
|
|
178
|
+
let max: Rational | undefined;
|
|
179
|
+
for (const expr of consts) {
|
|
180
|
+
if (!manager.isNumeral(expr)) continue;
|
|
181
|
+
const value = manager.getRationalValue(expr);
|
|
182
|
+
if (max === undefined || value.compare(max) > 0) max = value;
|
|
183
|
+
}
|
|
184
|
+
return manager.mkNumeralOfSort(
|
|
185
|
+
max === undefined ? Rational.zero : max.add(Rational.one),
|
|
186
|
+
sort,
|
|
187
|
+
);
|
|
188
|
+
}
|
|
189
|
+
if (!manager.isBvSort(sort)) return -1;
|
|
190
|
+
const width = manager.getBvSize(sort);
|
|
191
|
+
for (let candidate = 0n; candidate <= BigInt(consts.length); candidate++)
|
|
192
|
+
if (
|
|
193
|
+
!consts.some(
|
|
194
|
+
(expr) => manager.isBvNumeral(expr) && manager.getBvNumeralValue(expr) === candidate,
|
|
195
|
+
)
|
|
196
|
+
)
|
|
197
|
+
return manager.mkBvNumeral(candidate, width);
|
|
198
|
+
return -1;
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
private evalGeneric(isWitnessWanted: boolean): GuardSetEval {
|
|
202
|
+
const consts: number[] = [];
|
|
203
|
+
this.collectConsts(this.guard, consts);
|
|
204
|
+
let isUndefined = false;
|
|
205
|
+
for (const candidate of consts) {
|
|
206
|
+
const value = this.evalAt(this.guard, candidate);
|
|
207
|
+
if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? candidate : -1 };
|
|
208
|
+
if (value === L_UNDEF) isUndefined = true;
|
|
209
|
+
}
|
|
210
|
+
const fresh = this.mkFresh(consts);
|
|
211
|
+
if (fresh === -1) isUndefined = true;
|
|
212
|
+
else {
|
|
213
|
+
const value = this.evalAt(this.guard, fresh);
|
|
214
|
+
if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? fresh : -1 };
|
|
215
|
+
if (value === L_UNDEF) isUndefined = true;
|
|
216
|
+
}
|
|
217
|
+
return { status: isUndefined ? L_UNDEF : L_FALSE, witness: -1 };
|
|
218
|
+
}
|
|
219
|
+
}
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/util/hashtable.h, src/util/obj_hashtable.h), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
|
|
4
3
|
const INITIAL_CAPACITY = 8;
|
|
@@ -10,14 +9,20 @@ const USED = 2;
|
|
|
10
9
|
export const getIdentityHash = (key: number) => key;
|
|
11
10
|
|
|
12
11
|
export class ObjMap<V> {
|
|
13
|
-
private capacity
|
|
14
|
-
private states
|
|
12
|
+
private capacity: number;
|
|
13
|
+
private states: Uint8Array;
|
|
15
14
|
private slotKeys: number[] = [];
|
|
16
|
-
private
|
|
15
|
+
private slotValues: V[] = [];
|
|
17
16
|
private numDeleted = 0;
|
|
18
17
|
size = 0;
|
|
19
18
|
|
|
20
|
-
constructor(
|
|
19
|
+
constructor(
|
|
20
|
+
private getHash: (key: number) => number,
|
|
21
|
+
initialCapacity = INITIAL_CAPACITY,
|
|
22
|
+
) {
|
|
23
|
+
this.capacity = initialCapacity;
|
|
24
|
+
this.states = new Uint8Array(initialCapacity);
|
|
25
|
+
}
|
|
21
26
|
|
|
22
27
|
private findSlot(key: number) {
|
|
23
28
|
const mask = this.capacity - 1;
|
|
@@ -33,11 +38,11 @@ export class ObjMap<V> {
|
|
|
33
38
|
private moveTable(capacity: number) {
|
|
34
39
|
const states = this.states;
|
|
35
40
|
const keys = this.slotKeys;
|
|
36
|
-
const values = this.
|
|
41
|
+
const values = this.slotValues;
|
|
37
42
|
this.capacity = capacity;
|
|
38
43
|
this.states = new Uint8Array(capacity);
|
|
39
44
|
this.slotKeys = [];
|
|
40
|
-
this.
|
|
45
|
+
this.slotValues = [];
|
|
41
46
|
this.numDeleted = 0;
|
|
42
47
|
const mask = capacity - 1;
|
|
43
48
|
for (let slot = 0; slot < states.length; slot++) {
|
|
@@ -46,7 +51,7 @@ export class ObjMap<V> {
|
|
|
46
51
|
while (this.states[target] !== FREE) target = (target + 1) & mask;
|
|
47
52
|
this.states[target] = USED;
|
|
48
53
|
this.slotKeys[target] = keys[slot];
|
|
49
|
-
this.
|
|
54
|
+
this.slotValues[target] = values[slot];
|
|
50
55
|
}
|
|
51
56
|
}
|
|
52
57
|
|
|
@@ -56,12 +61,12 @@ export class ObjMap<V> {
|
|
|
56
61
|
|
|
57
62
|
get(key: number) {
|
|
58
63
|
const slot = this.findSlot(key);
|
|
59
|
-
return slot === -1 ? undefined : this.
|
|
64
|
+
return slot === -1 ? undefined : this.slotValues[slot];
|
|
60
65
|
}
|
|
61
66
|
|
|
62
67
|
replace(key: number, value: V) {
|
|
63
68
|
const slot = this.findSlot(key);
|
|
64
|
-
if (slot !== -1) this.
|
|
69
|
+
if (slot !== -1) this.slotValues[slot] = value;
|
|
65
70
|
}
|
|
66
71
|
|
|
67
72
|
set(key: number, value: V) {
|
|
@@ -73,7 +78,7 @@ export class ObjMap<V> {
|
|
|
73
78
|
const slot = (begin + offset) & mask;
|
|
74
79
|
if (this.states[slot] === USED) {
|
|
75
80
|
if (this.slotKeys[slot] === key) {
|
|
76
|
-
this.
|
|
81
|
+
this.slotValues[slot] = value;
|
|
77
82
|
return;
|
|
78
83
|
}
|
|
79
84
|
} else if (this.states[slot] === FREE) {
|
|
@@ -81,7 +86,7 @@ export class ObjMap<V> {
|
|
|
81
86
|
if (deletedSlot !== -1) this.numDeleted--;
|
|
82
87
|
this.states[target] = USED;
|
|
83
88
|
this.slotKeys[target] = key;
|
|
84
|
-
this.
|
|
89
|
+
this.slotValues[target] = value;
|
|
85
90
|
this.size++;
|
|
86
91
|
return;
|
|
87
92
|
} else deletedSlot = slot;
|
|
@@ -110,14 +115,19 @@ export class ObjMap<V> {
|
|
|
110
115
|
if (this.capacity > 16 && overhead << 2 > this.capacity * 3) this.capacity >>= 1;
|
|
111
116
|
this.states = new Uint8Array(this.capacity);
|
|
112
117
|
this.slotKeys = [];
|
|
113
|
-
this.
|
|
118
|
+
this.slotValues = [];
|
|
114
119
|
this.size = 0;
|
|
115
120
|
this.numDeleted = 0;
|
|
116
121
|
}
|
|
117
122
|
|
|
118
123
|
*entries(): IterableIterator<[number, V]> {
|
|
119
124
|
for (let slot = 0; slot < this.capacity; slot++)
|
|
120
|
-
if (this.states[slot] === USED) yield [this.slotKeys[slot], this.
|
|
125
|
+
if (this.states[slot] === USED) yield [this.slotKeys[slot], this.slotValues[slot]];
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
*values(): IterableIterator<V> {
|
|
129
|
+
for (let slot = 0; slot < this.capacity; slot++)
|
|
130
|
+
if (this.states[slot] === USED) yield this.slotValues[slot];
|
|
121
131
|
}
|
|
122
132
|
|
|
123
133
|
*keys(): IterableIterator<number> {
|
|
@@ -133,8 +143,8 @@ export class ObjMap<V> {
|
|
|
133
143
|
export class ObjHashtable {
|
|
134
144
|
private map: ObjMap<true>;
|
|
135
145
|
|
|
136
|
-
constructor(getHash: (key: number) => number) {
|
|
137
|
-
this.map = new ObjMap(getHash);
|
|
146
|
+
constructor(getHash: (key: number) => number, initialCapacity = INITIAL_CAPACITY) {
|
|
147
|
+
this.map = new ObjMap(getHash, initialCapacity);
|
|
138
148
|
}
|
|
139
149
|
|
|
140
150
|
get size() {
|
|
@@ -149,6 +159,10 @@ export class ObjHashtable {
|
|
|
149
159
|
this.map.set(key, true);
|
|
150
160
|
}
|
|
151
161
|
|
|
162
|
+
delete(key: number) {
|
|
163
|
+
this.map.delete(key);
|
|
164
|
+
}
|
|
165
|
+
|
|
152
166
|
[Symbol.iterator]() {
|
|
153
167
|
return this.map.keys();
|
|
154
168
|
}
|
|
@@ -0,0 +1,63 @@
|
|
|
1
|
+
// A value infinity * oo + value + epsilon * ε, ordered lexicographically.
|
|
2
|
+
import { Rational } from "./rational";
|
|
3
|
+
|
|
4
|
+
export class InfEps {
|
|
5
|
+
static readonly infinity = new InfEps(Rational.one, Rational.zero);
|
|
6
|
+
static readonly minusInfinity = new InfEps(Rational.minusOne, Rational.zero);
|
|
7
|
+
|
|
8
|
+
constructor(
|
|
9
|
+
readonly infinity: Rational,
|
|
10
|
+
readonly value: Rational,
|
|
11
|
+
readonly epsilon: Rational = Rational.zero,
|
|
12
|
+
) {}
|
|
13
|
+
|
|
14
|
+
static of(value: Rational, epsilon = Rational.zero) {
|
|
15
|
+
return new InfEps(Rational.zero, value, epsilon);
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
isFinite() {
|
|
19
|
+
return this.infinity.isZero();
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
isPositive() {
|
|
23
|
+
return (
|
|
24
|
+
this.infinity.isPositive() ||
|
|
25
|
+
(this.infinity.isZero() &&
|
|
26
|
+
(this.value.isPositive() || (this.value.isZero() && this.epsilon.isPositive())))
|
|
27
|
+
);
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
isNegative() {
|
|
31
|
+
return (
|
|
32
|
+
this.infinity.isNegative() ||
|
|
33
|
+
(this.infinity.isZero() &&
|
|
34
|
+
(this.value.isNegative() || (this.value.isZero() && this.epsilon.isNegative())))
|
|
35
|
+
);
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
compare(other: InfEps) {
|
|
39
|
+
return (
|
|
40
|
+
this.infinity.compare(other.infinity) ||
|
|
41
|
+
this.value.compare(other.value) ||
|
|
42
|
+
this.epsilon.compare(other.epsilon)
|
|
43
|
+
);
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
equals(other: InfEps) {
|
|
47
|
+
return this.compare(other) === 0;
|
|
48
|
+
}
|
|
49
|
+
|
|
50
|
+
add(other: InfEps) {
|
|
51
|
+
return new InfEps(
|
|
52
|
+
this.infinity.add(other.infinity),
|
|
53
|
+
this.value.add(other.value),
|
|
54
|
+
this.epsilon.add(other.epsilon),
|
|
55
|
+
);
|
|
56
|
+
}
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
export const maxInfEps = (first: InfEps, second: InfEps) =>
|
|
60
|
+
first.compare(second) < 0 ? second : first;
|
|
61
|
+
|
|
62
|
+
export const minInfEps = (first: InfEps, second: InfEps) =>
|
|
63
|
+
second.compare(first) < 0 ? second : first;
|
|
@@ -0,0 +1,101 @@
|
|
|
1
|
+
import {
|
|
2
|
+
FAMILY_USER,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
KIND_VAR,
|
|
5
|
+
OP_EQ,
|
|
6
|
+
OP_NOT,
|
|
7
|
+
OP_OR,
|
|
8
|
+
type AstManager,
|
|
9
|
+
QUANTIFIER_FORALL,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { isAppOf } from "./ast-util";
|
|
12
|
+
|
|
13
|
+
// The result comes with a reference, which the caller releases.
|
|
14
|
+
export const simplifyInjAxiom = (manager: AstManager, quantifier: number) => {
|
|
15
|
+
const data = manager.getQuantifier(quantifier);
|
|
16
|
+
const body = data.body;
|
|
17
|
+
if (
|
|
18
|
+
data.kind !== QUANTIFIER_FORALL ||
|
|
19
|
+
!isAppOf(manager, body, OP_OR) ||
|
|
20
|
+
manager.getNumArgs(body) !== 2
|
|
21
|
+
)
|
|
22
|
+
return undefined;
|
|
23
|
+
const isSwapped = isAppOf(manager, manager.getArg(body, 1), OP_NOT);
|
|
24
|
+
const negated = manager.getArg(body, isSwapped ? 1 : 0);
|
|
25
|
+
const varEq = manager.getArg(body, isSwapped ? 0 : 1);
|
|
26
|
+
if (!isAppOf(manager, negated, OP_NOT)) return undefined;
|
|
27
|
+
const appEq = manager.getArg(negated, 0);
|
|
28
|
+
if (!isAppOf(manager, appEq, OP_EQ) || !isAppOf(manager, varEq, OP_EQ)) return undefined;
|
|
29
|
+
const first = manager.getArg(appEq, 0);
|
|
30
|
+
const second = manager.getArg(appEq, 1);
|
|
31
|
+
const firstVar = manager.getArg(varEq, 0);
|
|
32
|
+
const secondVar = manager.getArg(varEq, 1);
|
|
33
|
+
const decl = manager.decls[first];
|
|
34
|
+
const numArgs = manager.kinds[first] === KIND_APP ? manager.getNumArgs(first) : 0;
|
|
35
|
+
if (
|
|
36
|
+
manager.kinds[first] !== KIND_APP ||
|
|
37
|
+
manager.kinds[second] !== KIND_APP ||
|
|
38
|
+
manager.decls[second] !== decl ||
|
|
39
|
+
manager.getNumArgs(second) !== numArgs ||
|
|
40
|
+
manager.funcDecls[decl].family !== FAMILY_USER ||
|
|
41
|
+
numArgs === 0 ||
|
|
42
|
+
manager.kinds[firstVar] !== KIND_VAR ||
|
|
43
|
+
manager.kinds[secondVar] !== KIND_VAR ||
|
|
44
|
+
firstVar === secondVar
|
|
45
|
+
)
|
|
46
|
+
return undefined;
|
|
47
|
+
let index = -1;
|
|
48
|
+
for (let argIndex = 0; argIndex < numArgs; argIndex++) {
|
|
49
|
+
const firstArg = manager.getArg(first, argIndex);
|
|
50
|
+
const secondArg = manager.getArg(second, argIndex);
|
|
51
|
+
if (manager.kinds[firstArg] !== KIND_VAR && !manager.isUninterpretedConst(firstArg))
|
|
52
|
+
return undefined;
|
|
53
|
+
if (
|
|
54
|
+
(firstArg === firstVar && secondArg === secondVar) ||
|
|
55
|
+
(firstArg === secondVar && secondArg === firstVar)
|
|
56
|
+
) {
|
|
57
|
+
if (index !== -1) return undefined;
|
|
58
|
+
index = argIndex;
|
|
59
|
+
} else if (firstArg !== secondArg || firstArg === firstVar || firstArg === secondVar)
|
|
60
|
+
return undefined;
|
|
61
|
+
}
|
|
62
|
+
if (index === -1 || !manager.isGround(quantifier)) return undefined;
|
|
63
|
+
return manager.withTemporaries(() => {
|
|
64
|
+
const domain = manager.funcDecls[decl].domain;
|
|
65
|
+
const sorts: number[] = [];
|
|
66
|
+
const names: number[] = [];
|
|
67
|
+
const args: number[] = [];
|
|
68
|
+
const invArgs: number[] = [];
|
|
69
|
+
let inverted = -1;
|
|
70
|
+
for (let argIndex = 0; argIndex < numArgs; argIndex++) {
|
|
71
|
+
const arg = manager.getArg(first, argIndex);
|
|
72
|
+
if (manager.kinds[arg] !== KIND_VAR) {
|
|
73
|
+
args.push(arg);
|
|
74
|
+
continue;
|
|
75
|
+
}
|
|
76
|
+
names.push(argIndex);
|
|
77
|
+
sorts.push(domain[argIndex]);
|
|
78
|
+
const variable = manager.mkVar(sorts.length - 1, domain[argIndex]);
|
|
79
|
+
args.push(variable);
|
|
80
|
+
if (argIndex === index) inverted = variable;
|
|
81
|
+
else invArgs.push(variable);
|
|
82
|
+
}
|
|
83
|
+
const app = manager.mkApp(decl, args, manager.sorts[first]);
|
|
84
|
+
invArgs.push(app);
|
|
85
|
+
const inverse = manager.mkFreshFuncDecl(
|
|
86
|
+
"inj",
|
|
87
|
+
invArgs.map((arg) => manager.sorts[arg]),
|
|
88
|
+
domain[index],
|
|
89
|
+
);
|
|
90
|
+
return manager.mkQuantifier({
|
|
91
|
+
kind: QUANTIFIER_FORALL,
|
|
92
|
+
sorts: sorts.reverse(),
|
|
93
|
+
names,
|
|
94
|
+
body: manager.mkEq(manager.mkApp(inverse, invArgs, domain[index]), inverted),
|
|
95
|
+
patterns: [manager.mkPattern([app])],
|
|
96
|
+
noPatterns: [],
|
|
97
|
+
weight: 0,
|
|
98
|
+
qid: "",
|
|
99
|
+
});
|
|
100
|
+
});
|
|
101
|
+
};
|