tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
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 +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +58 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- 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 +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +633 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- 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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- 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 +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- 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 +0 -2
- 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 +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- 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 +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- 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 +483 -116
- 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 +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1448 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- 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 +109 -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 +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- 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 +205 -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 +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -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 +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -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 +328 -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 +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -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 +109 -36
- 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 +0 -2
- 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 +0 -1
- 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 +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- 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 +163 -99
- 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 -290
- 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 +118 -88
- 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 +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -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 +1404 -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 +219 -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 +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -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 +281 -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 +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- 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 +1096 -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 +1499 -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 +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- 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 +262 -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 +44 -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 +2105 -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 +995 -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 +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -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 +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -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 +90 -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 +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -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 +1995 -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 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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 +852 -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 +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- 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 +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- 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,243 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_USER,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_EQ,
|
|
9
|
+
OP_ITE,
|
|
10
|
+
SORT_BOOL,
|
|
11
|
+
type SmtSymbol,
|
|
12
|
+
QUANTIFIER_FORALL,
|
|
13
|
+
} from "./ast";
|
|
14
|
+
import type { Goal } from "./goal";
|
|
15
|
+
import { MacroManager } from "./macro-finder";
|
|
16
|
+
import { hasSubterm } from "./recfun-decl-plugin";
|
|
17
|
+
import { RefVector } from "./ref-vector";
|
|
18
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
19
|
+
|
|
20
|
+
interface QuasiMacro {
|
|
21
|
+
head: number;
|
|
22
|
+
def: number;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
const isNonGroundUninterp = (manager: AstManager, expr: number) =>
|
|
26
|
+
!manager.isGroundApp(expr) &&
|
|
27
|
+
manager.kinds[expr] === KIND_APP &&
|
|
28
|
+
manager.funcDecls[manager.decls[expr]].family === FAMILY_USER;
|
|
29
|
+
|
|
30
|
+
const isFullyDependingOn = (manager: AstManager, app: number, numDecls: number) => {
|
|
31
|
+
const isUsed = Array.from({ length: numDecls }, () => false);
|
|
32
|
+
for (const arg of manager.getArgs(app))
|
|
33
|
+
if (manager.kinds[arg] === KIND_VAR) isUsed[manager.values[arg]] = true;
|
|
34
|
+
return isUsed.every(Boolean);
|
|
35
|
+
};
|
|
36
|
+
|
|
37
|
+
class QuasiMacros {
|
|
38
|
+
private occurrences = new Map<number, number>();
|
|
39
|
+
private rewriter: Rewriter;
|
|
40
|
+
private newVars: RefVector;
|
|
41
|
+
private newEqs: RefVector;
|
|
42
|
+
|
|
43
|
+
constructor(
|
|
44
|
+
private manager: AstManager,
|
|
45
|
+
private macros: MacroManager,
|
|
46
|
+
) {
|
|
47
|
+
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
48
|
+
this.newVars = new RefVector(manager);
|
|
49
|
+
this.newEqs = new RefVector(manager);
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
// A term reached a second time counts again, and a third time not.
|
|
53
|
+
private findOccurrences(expr: number) {
|
|
54
|
+
const manager = this.manager;
|
|
55
|
+
const visitedOnce = new Set<number>();
|
|
56
|
+
const visitedMore = new Set<number>();
|
|
57
|
+
const todo = [expr];
|
|
58
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
59
|
+
if (visitedMore.has(current)) continue;
|
|
60
|
+
if (visitedOnce.has(current)) visitedMore.add(current);
|
|
61
|
+
visitedOnce.add(current);
|
|
62
|
+
if (manager.kinds[current] === KIND_QUANTIFIER)
|
|
63
|
+
todo.push(manager.getQuantifier(current).body);
|
|
64
|
+
if (manager.kinds[current] !== KIND_APP) continue;
|
|
65
|
+
if (isNonGroundUninterp(manager, current)) {
|
|
66
|
+
const decl = manager.decls[current];
|
|
67
|
+
this.occurrences.set(decl, (this.occurrences.get(decl) ?? 0) + 1);
|
|
68
|
+
}
|
|
69
|
+
for (let index = manager.getNumArgs(current); index > 0; index--)
|
|
70
|
+
todo.push(manager.getArg(current, index - 1));
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
private isUnique(decl: number) {
|
|
75
|
+
return this.occurrences.get(decl) === 1;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private isQuasiDef(numDecls: number, lhs: number, rhs: number) {
|
|
79
|
+
const manager = this.manager;
|
|
80
|
+
return (
|
|
81
|
+
isNonGroundUninterp(manager, lhs) &&
|
|
82
|
+
this.isUnique(manager.decls[lhs]) &&
|
|
83
|
+
!hasSubterm(
|
|
84
|
+
manager,
|
|
85
|
+
[rhs],
|
|
86
|
+
(expr) => manager.kinds[expr] === KIND_APP && manager.decls[expr] === manager.decls[lhs],
|
|
87
|
+
false,
|
|
88
|
+
) &&
|
|
89
|
+
isFullyDependingOn(manager, lhs, numDecls)
|
|
90
|
+
);
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
private getQuasiMacro(expr: number): QuasiMacro | undefined {
|
|
94
|
+
const manager = this.manager;
|
|
95
|
+
if (
|
|
96
|
+
manager.kinds[expr] !== KIND_QUANTIFIER ||
|
|
97
|
+
manager.getQuantifier(expr).kind !== QUANTIFIER_FORALL
|
|
98
|
+
)
|
|
99
|
+
return undefined;
|
|
100
|
+
const numDecls = manager.getQuantifier(expr).sorts.length;
|
|
101
|
+
const body = manager.getQuantifier(expr).body;
|
|
102
|
+
const isUniqueUninterp = (term: number) =>
|
|
103
|
+
isNonGroundUninterp(manager, term) && this.isUnique(manager.decls[term]);
|
|
104
|
+
if (manager.getOp(body) === OP_EQ) {
|
|
105
|
+
const lhs = manager.getArg(body, 0);
|
|
106
|
+
const rhs = manager.getArg(body, 1);
|
|
107
|
+
if (this.isQuasiDef(numDecls, lhs, rhs)) return { head: lhs, def: rhs };
|
|
108
|
+
if (this.isQuasiDef(numDecls, rhs, lhs)) return { head: rhs, def: lhs };
|
|
109
|
+
return undefined;
|
|
110
|
+
}
|
|
111
|
+
if (manager.isNot(body) && isUniqueUninterp(manager.getArg(body, 0)))
|
|
112
|
+
return { head: manager.getArg(body, 0), def: manager.falseExpr };
|
|
113
|
+
if (isUniqueUninterp(body)) return { head: body, def: manager.trueExpr };
|
|
114
|
+
if (!manager.isNot(body)) return undefined;
|
|
115
|
+
const eq = manager.getArg(body, 0);
|
|
116
|
+
if (manager.getOp(eq) !== OP_EQ || !manager.isBool(manager.getArg(eq, 0))) return undefined;
|
|
117
|
+
const lhs = manager.getArg(eq, 0);
|
|
118
|
+
const rhs = manager.getArg(eq, 1);
|
|
119
|
+
if (this.isQuasiDef(numDecls, lhs, rhs)) return { head: lhs, def: manager.mkNot(rhs) };
|
|
120
|
+
if (this.isQuasiDef(numDecls, rhs, lhs)) return { head: rhs, def: manager.mkNot(lhs) };
|
|
121
|
+
return undefined;
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
// The macro comes with a reference, which the caller releases, and -1 is no macro.
|
|
125
|
+
private toMacro(quantifier: number, macro: QuasiMacro) {
|
|
126
|
+
const manager = this.manager;
|
|
127
|
+
const data = manager.getQuantifier(quantifier);
|
|
128
|
+
const funcDecl = manager.funcDecls[manager.decls[macro.head]];
|
|
129
|
+
const newNames: SmtSymbol[] = [];
|
|
130
|
+
const newSorts: number[] = [];
|
|
131
|
+
this.newVars.reset();
|
|
132
|
+
this.newEqs.reset();
|
|
133
|
+
const isSeen = Array.from({ length: data.sorts.length }, () => false);
|
|
134
|
+
let numSeen = 0;
|
|
135
|
+
for (const [index, arg] of manager.getArgs(macro.head).entries()) {
|
|
136
|
+
const isVar = manager.kinds[arg] === KIND_VAR;
|
|
137
|
+
if (!isVar && !manager.isGroundApp(arg)) return -1;
|
|
138
|
+
if (isVar && !isSeen[manager.values[arg]]) {
|
|
139
|
+
this.newVars.push(arg);
|
|
140
|
+
isSeen[manager.values[arg]] = true;
|
|
141
|
+
numSeen++;
|
|
142
|
+
continue;
|
|
143
|
+
}
|
|
144
|
+
const sort = funcDecl.domain[index];
|
|
145
|
+
newNames.push(`X${newNames.length}`);
|
|
146
|
+
newSorts.push(sort);
|
|
147
|
+
this.newVars.push(manager.mkVar(newNames.length - 1 + data.sorts.length, sort));
|
|
148
|
+
this.newEqs.push(manager.mkEq(this.newVars.items[this.newVars.size - 1], arg));
|
|
149
|
+
}
|
|
150
|
+
if (numSeen < data.sorts.length) return -1;
|
|
151
|
+
const app = manager.mkApp(manager.decls[macro.head], this.newVars.items, funcDecl.range);
|
|
152
|
+
manager.incRef(app);
|
|
153
|
+
const elseDecl = manager.mkFreshFuncDecl(
|
|
154
|
+
funcDecl.name,
|
|
155
|
+
funcDecl.domain,
|
|
156
|
+
funcDecl.range,
|
|
157
|
+
true,
|
|
158
|
+
"else",
|
|
159
|
+
);
|
|
160
|
+
const elseApp = manager.mkApp(elseDecl, this.newVars.items, funcDecl.range);
|
|
161
|
+
manager.incRef(elseApp);
|
|
162
|
+
const ite = manager.mkApp(
|
|
163
|
+
OP_ITE,
|
|
164
|
+
[manager.mkApp(OP_AND, this.newEqs.items, SORT_BOOL), macro.def, elseApp],
|
|
165
|
+
funcDecl.range,
|
|
166
|
+
);
|
|
167
|
+
manager.incRef(ite);
|
|
168
|
+
const eq = manager.mkEq(app, ite);
|
|
169
|
+
manager.incRef(eq);
|
|
170
|
+
const result = manager.mkQuantifier({
|
|
171
|
+
kind: QUANTIFIER_FORALL,
|
|
172
|
+
sorts: [...newSorts.toReversed(), ...data.sorts],
|
|
173
|
+
names: [...newNames.toReversed(), ...data.names],
|
|
174
|
+
body: eq,
|
|
175
|
+
patterns: [],
|
|
176
|
+
noPatterns: [],
|
|
177
|
+
weight: 0,
|
|
178
|
+
qid: "",
|
|
179
|
+
});
|
|
180
|
+
manager.incRef(result);
|
|
181
|
+
manager.decRef(eq);
|
|
182
|
+
manager.decRef(ite);
|
|
183
|
+
manager.decRef(elseApp);
|
|
184
|
+
manager.decRef(app);
|
|
185
|
+
return result;
|
|
186
|
+
}
|
|
187
|
+
|
|
188
|
+
private findMacros(forms: number[]) {
|
|
189
|
+
const manager = this.manager;
|
|
190
|
+
let isFound = false;
|
|
191
|
+
this.occurrences.clear();
|
|
192
|
+
for (const form of forms) this.findOccurrences(form);
|
|
193
|
+
for (const form of forms) {
|
|
194
|
+
const quasiMacro = this.getQuasiMacro(form);
|
|
195
|
+
if (quasiMacro === undefined) continue;
|
|
196
|
+
manager.incRef(quasiMacro.head);
|
|
197
|
+
manager.incRef(quasiMacro.def);
|
|
198
|
+
const macro = this.toMacro(form, quasiMacro);
|
|
199
|
+
if (macro !== -1 && this.macros.insert(manager.decls[quasiMacro.head], macro)) isFound = true;
|
|
200
|
+
if (macro !== -1) manager.decRef(macro);
|
|
201
|
+
manager.decRef(quasiMacro.def);
|
|
202
|
+
manager.decRef(quasiMacro.head);
|
|
203
|
+
}
|
|
204
|
+
return isFound;
|
|
205
|
+
}
|
|
206
|
+
|
|
207
|
+
apply(forms: RefVector) {
|
|
208
|
+
const manager = this.manager;
|
|
209
|
+
if (!this.findMacros(forms.items)) return false;
|
|
210
|
+
for (let index = 0; index < forms.size; index++) {
|
|
211
|
+
const expanded = this.macros.expand(forms.items[index]);
|
|
212
|
+
const rewritten = this.rewriter.rewrite(expanded);
|
|
213
|
+
forms.set(index, rewritten);
|
|
214
|
+
manager.decRef(rewritten);
|
|
215
|
+
manager.decRef(expanded);
|
|
216
|
+
}
|
|
217
|
+
return true;
|
|
218
|
+
}
|
|
219
|
+
|
|
220
|
+
release() {
|
|
221
|
+
this.newEqs.reset();
|
|
222
|
+
this.newVars.reset();
|
|
223
|
+
this.rewriter.release();
|
|
224
|
+
}
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
export const findQuasiMacros = (manager: AstManager, goal: Goal) => {
|
|
228
|
+
const macros = new MacroManager(manager);
|
|
229
|
+
const quasiMacros = new QuasiMacros(manager, macros);
|
|
230
|
+
const forms = new RefVector(manager);
|
|
231
|
+
for (const form of goal.forms.items) forms.push(form);
|
|
232
|
+
do manager.limit.checkpoint();
|
|
233
|
+
while (quasiMacros.apply(forms));
|
|
234
|
+
goal.reset();
|
|
235
|
+
for (const form of forms.items) goal.assert(form);
|
|
236
|
+
const definitions = macros.getInterpretations();
|
|
237
|
+
goal.addDefinitions(definitions);
|
|
238
|
+
for (const definition of definitions) manager.decRef(definition.def);
|
|
239
|
+
goal.depth++;
|
|
240
|
+
forms.reset();
|
|
241
|
+
quasiMacros.release();
|
|
242
|
+
macros.release();
|
|
243
|
+
};
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
|
|
1
|
+
import { SmtInvariantError } from "../../../errors";
|
|
2
2
|
|
|
3
3
|
export const getGcd = (first: bigint, second: bigint) => {
|
|
4
4
|
let left = first < 0n ? -first : first;
|
|
@@ -13,6 +13,20 @@ export const getGcd = (first: bigint, second: bigint) => {
|
|
|
13
13
|
|
|
14
14
|
const isBigInt = (value: bigint) => value <= -2147483648n || value > 2147483647n;
|
|
15
15
|
|
|
16
|
+
// mpz's get_double sums the 32-bit digits of a bignum from the least significant one, which rounds
|
|
17
|
+
// differently from Number.
|
|
18
|
+
const getDouble = (value: bigint) => {
|
|
19
|
+
if (!isBigInt(value)) return Number(value);
|
|
20
|
+
let result = 0;
|
|
21
|
+
let scale = 1;
|
|
22
|
+
for (let rest = value < 0n ? -value : value; rest > 0n; rest >>= 32n) {
|
|
23
|
+
result += scale * Number(rest & 0xffffffffn);
|
|
24
|
+
scale *= 4294967296;
|
|
25
|
+
}
|
|
26
|
+
if (!(result >= 0)) result = 2 ** 64;
|
|
27
|
+
return value < 0n ? -result : result;
|
|
28
|
+
};
|
|
29
|
+
|
|
16
30
|
export const getLcm = (first: bigint, second: bigint) => {
|
|
17
31
|
const product = first * second;
|
|
18
32
|
return (product < 0n ? -product : product) / getGcd(first, second);
|
|
@@ -49,6 +63,21 @@ const getIntRoot = (value: bigint, degree: number): bigint | undefined => {
|
|
|
49
63
|
return low ** exponent === value ? low : undefined;
|
|
50
64
|
};
|
|
51
65
|
|
|
66
|
+
// rational::mult_inverse: the inverse of the value modulo 2^bits, which only an odd value has.
|
|
67
|
+
export const getMultInverse = (value: bigint, bits: number) => {
|
|
68
|
+
if (value === 1n) return 1n;
|
|
69
|
+
if (value % 2n === 0n) return undefined;
|
|
70
|
+
const modulus = 1n << BigInt(bits);
|
|
71
|
+
let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
|
|
72
|
+
let [oldCoefficient, coefficient] = [1n, 0n];
|
|
73
|
+
while (remainder !== 0n) {
|
|
74
|
+
const quotient = oldRemainder / remainder;
|
|
75
|
+
[oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
|
|
76
|
+
[oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
|
|
77
|
+
}
|
|
78
|
+
return ((oldCoefficient % modulus) + modulus) % modulus;
|
|
79
|
+
};
|
|
80
|
+
|
|
52
81
|
export class Rational {
|
|
53
82
|
static readonly zero = new Rational(0n, 1n);
|
|
54
83
|
static readonly one = new Rational(1n, 1n);
|
|
@@ -70,6 +99,17 @@ export class Rational {
|
|
|
70
99
|
return new Rational(BigInt(value), 1n);
|
|
71
100
|
}
|
|
72
101
|
|
|
102
|
+
static fromDouble(value: number) {
|
|
103
|
+
if (!Number.isFinite(value)) throw new SmtInvariantError(`${value} is not a rational number`);
|
|
104
|
+
let den = 1n;
|
|
105
|
+
let scaled = value;
|
|
106
|
+
while (!Number.isInteger(scaled)) {
|
|
107
|
+
scaled *= 2;
|
|
108
|
+
den *= 2n;
|
|
109
|
+
}
|
|
110
|
+
return Rational.of(BigInt(scaled), den);
|
|
111
|
+
}
|
|
112
|
+
|
|
73
113
|
isZero() {
|
|
74
114
|
return this.num === 0n;
|
|
75
115
|
}
|
|
@@ -152,6 +192,10 @@ export class Rational {
|
|
|
152
192
|
return new Rational(this.num < 0n ? quotient : quotient + 1n, 1n);
|
|
153
193
|
}
|
|
154
194
|
|
|
195
|
+
toDouble() {
|
|
196
|
+
return getDouble(this.num) / getDouble(this.den);
|
|
197
|
+
}
|
|
198
|
+
|
|
155
199
|
toString() {
|
|
156
200
|
return this.den === 1n ? `${this.num}` : `${this.num}/${this.den}`;
|
|
157
201
|
}
|
|
@@ -0,0 +1,262 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
KIND_QUANTIFIER,
|
|
5
|
+
OP_FUN_DEFINED,
|
|
6
|
+
OP_ITE,
|
|
7
|
+
OP_NOT,
|
|
8
|
+
type RecFunDef,
|
|
9
|
+
SORT_BOOL,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
12
|
+
import { ObjMap } from "./hashtable";
|
|
13
|
+
|
|
14
|
+
const getChildren = (manager: AstManager, expr: number, isUnderQuantifiers: boolean) =>
|
|
15
|
+
manager.kinds[expr] === KIND_QUANTIFIER
|
|
16
|
+
? isUnderQuantifiers
|
|
17
|
+
? [manager.getQuantifier(expr).body]
|
|
18
|
+
: []
|
|
19
|
+
: manager.kinds[expr] === KIND_APP
|
|
20
|
+
? manager.getArgs(expr)
|
|
21
|
+
: [];
|
|
22
|
+
|
|
23
|
+
// subterms::all goes under quantifiers, and subterms::ground does not.
|
|
24
|
+
export const getSubterms = (manager: AstManager, expr: number, isUnderQuantifiers = true) => {
|
|
25
|
+
const visited = new Set<number>();
|
|
26
|
+
const todo = [expr];
|
|
27
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
28
|
+
if (visited.has(current)) continue;
|
|
29
|
+
visited.add(current);
|
|
30
|
+
todo.push(...getChildren(manager, current, isUnderQuantifiers));
|
|
31
|
+
}
|
|
32
|
+
return [...visited];
|
|
33
|
+
};
|
|
34
|
+
|
|
35
|
+
// Whether a subterm of the roots satisfies the predicate, which the walk calls in no particular
|
|
36
|
+
// order.
|
|
37
|
+
export const hasSubterm = (
|
|
38
|
+
manager: AstManager,
|
|
39
|
+
roots: readonly number[],
|
|
40
|
+
predicate: (term: number) => boolean,
|
|
41
|
+
isUnderQuantifiers = true,
|
|
42
|
+
) => {
|
|
43
|
+
const visited = new Set<number>();
|
|
44
|
+
const todo = [...roots];
|
|
45
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
46
|
+
if (visited.has(current)) continue;
|
|
47
|
+
visited.add(current);
|
|
48
|
+
if (predicate(current)) return true;
|
|
49
|
+
if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
|
|
50
|
+
else if (isUnderQuantifiers && manager.kinds[current] === KIND_QUANTIFIER)
|
|
51
|
+
todo.push(manager.getQuantifier(current).body);
|
|
52
|
+
}
|
|
53
|
+
return false;
|
|
54
|
+
};
|
|
55
|
+
|
|
56
|
+
export const isDefinedApp = (manager: AstManager, expr: number) =>
|
|
57
|
+
manager.getOp(expr) === OP_FUN_DEFINED;
|
|
58
|
+
|
|
59
|
+
export const containsDef = (manager: AstManager, expr: number) =>
|
|
60
|
+
hasSubterm(manager, [expr], (term) => isDefinedApp(manager, term), false);
|
|
61
|
+
|
|
62
|
+
// An ite on a condition without a defined function, with one in a branch.
|
|
63
|
+
const containsIte = (manager: AstManager, expr: number) =>
|
|
64
|
+
hasSubterm(
|
|
65
|
+
manager,
|
|
66
|
+
[expr],
|
|
67
|
+
(term) =>
|
|
68
|
+
manager.getOp(term) === OP_ITE &&
|
|
69
|
+
!containsDef(manager, manager.getArg(term, 0)) &&
|
|
70
|
+
containsDef(manager, term),
|
|
71
|
+
false,
|
|
72
|
+
);
|
|
73
|
+
|
|
74
|
+
interface ChoiceList {
|
|
75
|
+
ite: number;
|
|
76
|
+
isPositive: boolean;
|
|
77
|
+
next: ChoiceList | null;
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
interface ExprList {
|
|
81
|
+
expr: number;
|
|
82
|
+
next: ExprList | null;
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
interface Branch {
|
|
86
|
+
path: ChoiceList | null;
|
|
87
|
+
toSplit: ExprList | null;
|
|
88
|
+
toUnfold: ExprList | null;
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
const addCase = (
|
|
92
|
+
manager: AstManager,
|
|
93
|
+
def: RecFunDef,
|
|
94
|
+
guards: number[],
|
|
95
|
+
rhs: number,
|
|
96
|
+
isImmediate: boolean,
|
|
97
|
+
) => {
|
|
98
|
+
for (const guard of guards) manager.incRef(guard);
|
|
99
|
+
manager.incRef(rhs);
|
|
100
|
+
def.cases.push({
|
|
101
|
+
pred: manager.mkRecFunCasePredDecl(def.decl, def.cases.length),
|
|
102
|
+
guards,
|
|
103
|
+
rhs,
|
|
104
|
+
isImmediate,
|
|
105
|
+
def,
|
|
106
|
+
});
|
|
107
|
+
};
|
|
108
|
+
|
|
109
|
+
// convert_path: the conditions of the choices, the last first, and the substitution of each ite by
|
|
110
|
+
// its branch.
|
|
111
|
+
const convertPath = (manager: AstManager, path: ChoiceList | null, subst: ExprSafeReplace) => {
|
|
112
|
+
const conditions: number[] = [];
|
|
113
|
+
for (let choice = path; choice !== null; choice = choice.next) {
|
|
114
|
+
const condition = manager.getArg(choice.ite, 0);
|
|
115
|
+
conditions.push(choice.isPositive ? condition : manager.mkApp(OP_NOT, [condition], SORT_BOOL));
|
|
116
|
+
const target = subst.apply(manager.getArg(choice.ite, choice.isPositive ? 1 : 2));
|
|
117
|
+
subst.insert(choice.ite, target);
|
|
118
|
+
manager.decRef(target);
|
|
119
|
+
}
|
|
120
|
+
return conditions;
|
|
121
|
+
};
|
|
122
|
+
|
|
123
|
+
// def::compute_cases: a case for each path through the ites whose branches call a defined
|
|
124
|
+
// function, with the conditions on the path as its guards.
|
|
125
|
+
const computeCases = (manager: AstManager, def: RecFunDef, isMacro: boolean, rhs: number) => {
|
|
126
|
+
manager.incRef(rhs);
|
|
127
|
+
def.rhs = rhs;
|
|
128
|
+
if (isMacro || manager.funcDecls[def.decl].domain.length === 0 || !containsIte(manager, rhs)) {
|
|
129
|
+
addCase(manager, def, [], rhs, false);
|
|
130
|
+
return;
|
|
131
|
+
}
|
|
132
|
+
const branches: Branch[] = [{ path: null, toSplit: null, toUnfold: { expr: rhs, next: null } }];
|
|
133
|
+
for (let branch = branches.pop(); branch !== undefined; branch = branches.pop()) {
|
|
134
|
+
while (branch.toUnfold !== null) {
|
|
135
|
+
const stack = [branch.toUnfold.expr];
|
|
136
|
+
branch.toUnfold = branch.toUnfold.next;
|
|
137
|
+
for (let expr = stack.pop(); expr !== undefined; expr = stack.pop()) {
|
|
138
|
+
if (manager.getOp(expr) === OP_ITE) {
|
|
139
|
+
if (containsDef(manager, manager.getArg(expr, 0))) continue;
|
|
140
|
+
if (
|
|
141
|
+
!containsDef(manager, manager.getArg(expr, 1)) &&
|
|
142
|
+
!containsDef(manager, manager.getArg(expr, 2))
|
|
143
|
+
)
|
|
144
|
+
continue;
|
|
145
|
+
branch.toSplit = { expr, next: branch.toSplit };
|
|
146
|
+
} else if (manager.kinds[expr] === KIND_APP)
|
|
147
|
+
for (const arg of manager.getArgs(expr)) if (containsIte(manager, arg)) stack.push(arg);
|
|
148
|
+
}
|
|
149
|
+
}
|
|
150
|
+
if (branch.toSplit !== null) {
|
|
151
|
+
const ite = branch.toSplit.expr;
|
|
152
|
+
const toSplit = branch.toSplit.next;
|
|
153
|
+
const condition = manager.getArg(ite, 0);
|
|
154
|
+
const mkBranch = (isPositive: boolean): Branch => ({
|
|
155
|
+
path: { ite, isPositive, next: branch.path },
|
|
156
|
+
toSplit,
|
|
157
|
+
toUnfold: {
|
|
158
|
+
expr: condition,
|
|
159
|
+
next: { expr: manager.getArg(ite, isPositive ? 1 : 2), next: branch.toUnfold },
|
|
160
|
+
},
|
|
161
|
+
});
|
|
162
|
+
branches.push(mkBranch(false), mkBranch(true));
|
|
163
|
+
continue;
|
|
164
|
+
}
|
|
165
|
+
manager.withTemporaries(
|
|
166
|
+
() => {
|
|
167
|
+
const subst = new ExprSafeReplace(manager);
|
|
168
|
+
const conditions = convertPath(manager, branch.path, subst);
|
|
169
|
+
const caseRhs = subst.apply(rhs);
|
|
170
|
+
const guards = conditions.map((condition) => subst.apply(condition));
|
|
171
|
+
subst.release();
|
|
172
|
+
const isImmediate = !hasSubterm(manager, [caseRhs], (term) => isDefinedApp(manager, term));
|
|
173
|
+
addCase(manager, def, guards, caseRhs, isImmediate);
|
|
174
|
+
manager.decRef(caseRhs);
|
|
175
|
+
for (const guard of guards) manager.decRef(guard);
|
|
176
|
+
},
|
|
177
|
+
() => [],
|
|
178
|
+
);
|
|
179
|
+
}
|
|
180
|
+
};
|
|
181
|
+
|
|
182
|
+
// compute_scores: the number of ites on the paths from the root to each subterm. The scores are in
|
|
183
|
+
// an obj_map, whose order decides which of the ites with the highest score redirect_ite takes.
|
|
184
|
+
const computeScores = (manager: AstManager, expr: number) => {
|
|
185
|
+
const parents = new Map<number, number[]>([[expr, []]]);
|
|
186
|
+
const byDepth = new Map<number, number[]>();
|
|
187
|
+
for (const term of getSubterms(manager, expr, false)) {
|
|
188
|
+
if (manager.kinds[term] === KIND_APP)
|
|
189
|
+
for (const arg of manager.getArgs(term)) {
|
|
190
|
+
const argParents = parents.get(arg) ?? [];
|
|
191
|
+
argParents.push(term);
|
|
192
|
+
parents.set(arg, argParents);
|
|
193
|
+
}
|
|
194
|
+
const depth = manager.depths[term];
|
|
195
|
+
byDepth.set(depth, [...(byDepth.get(depth) ?? []), term]);
|
|
196
|
+
}
|
|
197
|
+
const scores = new ObjMap<number>((term) => manager.hashes[term]);
|
|
198
|
+
scores.set(expr, 0);
|
|
199
|
+
for (let depth = manager.depths[expr]; depth > 0; depth--)
|
|
200
|
+
for (const term of byDepth.get(depth) ?? []) {
|
|
201
|
+
const score = (parents.get(term) ?? []).reduce(
|
|
202
|
+
(sum, parent) => sum + (scores.get(parent) ?? 0),
|
|
203
|
+
0,
|
|
204
|
+
);
|
|
205
|
+
scores.set(term, manager.getOp(term) === OP_ITE ? score + 1 : score);
|
|
206
|
+
}
|
|
207
|
+
return scores;
|
|
208
|
+
};
|
|
209
|
+
|
|
210
|
+
// redirect_ite: an ite under more than four others that calls a defined function becomes a fresh
|
|
211
|
+
// function, so that the cases do not multiply.
|
|
212
|
+
const redirectIte = (manager: AstManager, def: RecFunDef, rhs: number) => {
|
|
213
|
+
const domain = manager.funcDecls[def.decl].domain;
|
|
214
|
+
const vars = domain.map((sort, index) => manager.mkVar(domain.length - 1 - index, sort));
|
|
215
|
+
for (const variable of vars) manager.incRef(variable);
|
|
216
|
+
let result = rhs;
|
|
217
|
+
manager.incRef(result);
|
|
218
|
+
for (;;) {
|
|
219
|
+
let maxScore = 0;
|
|
220
|
+
let maxExpr = -1;
|
|
221
|
+
for (const [term, score] of computeScores(manager, result))
|
|
222
|
+
if (manager.getOp(term) === OP_ITE && score > maxScore && containsDef(manager, term)) {
|
|
223
|
+
maxExpr = term;
|
|
224
|
+
maxScore = score;
|
|
225
|
+
}
|
|
226
|
+
if (maxScore <= 4) break;
|
|
227
|
+
// mk_fresh_id gives the id after the increment.
|
|
228
|
+
const decl = manager.mkRecFuncDecl(
|
|
229
|
+
`fold-rec-${manager.mkFreshId() + 1}`,
|
|
230
|
+
domain,
|
|
231
|
+
manager.sorts[maxExpr],
|
|
232
|
+
);
|
|
233
|
+
const newBody = manager.mkApp(decl, vars, manager.sorts[maxExpr]);
|
|
234
|
+
manager.incRef(newBody);
|
|
235
|
+
setRecFunDefinition(manager, manager.recFunDefs.get(decl)!, false, maxExpr);
|
|
236
|
+
const subst = new ExprSafeReplace(manager);
|
|
237
|
+
subst.insert(maxExpr, newBody);
|
|
238
|
+
const replaced = subst.apply(result);
|
|
239
|
+
subst.release();
|
|
240
|
+
manager.decRef(newBody);
|
|
241
|
+
manager.decRef(result);
|
|
242
|
+
result = replaced;
|
|
243
|
+
}
|
|
244
|
+
for (const variable of vars) manager.decRef(variable);
|
|
245
|
+
return result;
|
|
246
|
+
};
|
|
247
|
+
|
|
248
|
+
// plugin::set_definition: a definition that is not a macro is recursive.
|
|
249
|
+
export const setRecFunDefinition = (
|
|
250
|
+
manager: AstManager,
|
|
251
|
+
def: RecFunDef,
|
|
252
|
+
isMacro: boolean,
|
|
253
|
+
rhs: number,
|
|
254
|
+
) => {
|
|
255
|
+
if (!isMacro) manager.hasRecDefs = true;
|
|
256
|
+
const redirected = isMacro ? rhs : redirectIte(manager, def, rhs);
|
|
257
|
+
if (isMacro) manager.incRef(redirected);
|
|
258
|
+
def.isMacro = isMacro;
|
|
259
|
+
computeCases(manager, def, isMacro, redirected);
|
|
260
|
+
manager.decRef(redirected);
|
|
261
|
+
for (const recFunCase of def.cases) manager.recFunCases.set(recFunCase.pred, recFunCase);
|
|
262
|
+
};
|
|
@@ -0,0 +1,107 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_USER,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_VAR,
|
|
6
|
+
OP_DT_ACCESSOR,
|
|
7
|
+
OP_DT_CONSTRUCTOR,
|
|
8
|
+
OP_DT_IS,
|
|
9
|
+
OP_DT_RECOGNISER,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { getSubterms, isDefinedApp } from "./recfun-decl-plugin";
|
|
12
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
13
|
+
import { VarSubst } from "./var-subst";
|
|
14
|
+
|
|
15
|
+
const getRhs = (manager: AstManager, decl: number) => manager.recFunDefs.get(decl)?.rhs ?? -1;
|
|
16
|
+
|
|
17
|
+
const isFunMacro = (manager: AstManager, decl: number) =>
|
|
18
|
+
manager.recFunDefs.get(decl)?.cases.length === 1;
|
|
19
|
+
|
|
20
|
+
// Leaves cycles through unconditional bodies to the resource-limited theory solver.
|
|
21
|
+
const isOnMacroCycle = (manager: AstManager, decl: number) => {
|
|
22
|
+
const todo = [decl];
|
|
23
|
+
const visited = new Set(todo);
|
|
24
|
+
for (let index = 0; index < todo.length; index++) {
|
|
25
|
+
for (const term of getSubterms(manager, getRhs(manager, todo[index]))) {
|
|
26
|
+
if (!isDefinedApp(manager, term)) continue;
|
|
27
|
+
const callee = manager.decls[term];
|
|
28
|
+
if (callee === decl) return true;
|
|
29
|
+
if (isFunMacro(manager, callee) && !visited.has(callee)) {
|
|
30
|
+
visited.add(callee);
|
|
31
|
+
todo.push(callee);
|
|
32
|
+
}
|
|
33
|
+
}
|
|
34
|
+
}
|
|
35
|
+
return false;
|
|
36
|
+
};
|
|
37
|
+
|
|
38
|
+
const isDecreasingArg = (
|
|
39
|
+
manager: AstManager,
|
|
40
|
+
decl: number,
|
|
41
|
+
position: number,
|
|
42
|
+
isAnyAccessorAllowed: boolean,
|
|
43
|
+
) => {
|
|
44
|
+
const body = getRhs(manager, decl);
|
|
45
|
+
if (body === -1 || manager.hasQuantifierFlags[body]) return false;
|
|
46
|
+
const index = manager.funcDecls[decl].domain.length - position - 1;
|
|
47
|
+
const isParameter = (expr: number) =>
|
|
48
|
+
manager.kinds[expr] === KIND_VAR && manager.values[expr] === index;
|
|
49
|
+
const subterms = getSubterms(manager, body);
|
|
50
|
+
let decreasing = -1;
|
|
51
|
+
for (const term of subterms) {
|
|
52
|
+
if (manager.kinds[term] !== KIND_APP || !manager.getArgs(term).some(isParameter)) continue;
|
|
53
|
+
const op = manager.getOp(term);
|
|
54
|
+
if (op !== OP_DT_ACCESSOR && op !== OP_DT_IS && op !== OP_DT_RECOGNISER) return false;
|
|
55
|
+
if (op !== OP_DT_ACCESSOR) continue;
|
|
56
|
+
if (!isAnyAccessorAllowed && decreasing !== -1 && manager.decls[term] !== decreasing)
|
|
57
|
+
return false;
|
|
58
|
+
decreasing = manager.decls[term];
|
|
59
|
+
}
|
|
60
|
+
if (!isAnyAccessorAllowed) return true;
|
|
61
|
+
if (decreasing === -1) return false;
|
|
62
|
+
for (const term of subterms) {
|
|
63
|
+
if (manager.kinds[term] !== KIND_APP || manager.decls[term] !== decl) continue;
|
|
64
|
+
let arg = manager.getArg(term, position);
|
|
65
|
+
let isStrict = false;
|
|
66
|
+
while (manager.getOp(arg) === OP_DT_ACCESSOR) {
|
|
67
|
+
arg = manager.getArg(arg, 0);
|
|
68
|
+
isStrict = true;
|
|
69
|
+
}
|
|
70
|
+
if (!isStrict || !isParameter(arg)) return false;
|
|
71
|
+
}
|
|
72
|
+
return true;
|
|
73
|
+
};
|
|
74
|
+
|
|
75
|
+
// recfun_rewriter::mk_app_core, which unfolds a body with uninterpreted functions only with
|
|
76
|
+
// unfold_recursive_functions, which only the model evaluator sets.
|
|
77
|
+
export const mkRecFunApp = (
|
|
78
|
+
manager: AstManager,
|
|
79
|
+
decl: number,
|
|
80
|
+
args: number[],
|
|
81
|
+
isUnfolding = false,
|
|
82
|
+
): Rewrite | undefined => {
|
|
83
|
+
const body = getRhs(manager, decl);
|
|
84
|
+
if (args.length === 0 || body === -1) return undefined;
|
|
85
|
+
if (isFunMacro(manager, decl) && isOnMacroCycle(manager, decl)) return undefined;
|
|
86
|
+
if (
|
|
87
|
+
!isUnfolding &&
|
|
88
|
+
getSubterms(manager, body).some(
|
|
89
|
+
(term) => manager.kinds[term] === KIND_APP && manager.getFamily(term) === FAMILY_USER,
|
|
90
|
+
)
|
|
91
|
+
)
|
|
92
|
+
return undefined;
|
|
93
|
+
const isSafe =
|
|
94
|
+
args.every((arg) => manager.isValue(arg)) ||
|
|
95
|
+
(!manager.hasQuantifierFlags[body] &&
|
|
96
|
+
args.some(
|
|
97
|
+
(arg, position) =>
|
|
98
|
+
manager.getOp(arg) === OP_DT_CONSTRUCTOR &&
|
|
99
|
+
isDecreasingArg(manager, decl, position, manager.isGroundApp(arg)),
|
|
100
|
+
));
|
|
101
|
+
if (!isSafe) return undefined;
|
|
102
|
+
const subst = new VarSubst(manager, true);
|
|
103
|
+
const result = subst.apply(body, args);
|
|
104
|
+
subst.release();
|
|
105
|
+
manager.releaseLater(result);
|
|
106
|
+
return { expr: result, depth: Infinity };
|
|
107
|
+
};
|