tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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 +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -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 +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- 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 +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- 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/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- 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 +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- 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 +664 -287
- 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 +4 -11
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +1449 -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 +341 -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 +349 -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 +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -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 +2012 -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 +37 -16
- 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 +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- 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,572 @@
|
|
|
1
|
+
import { SmtInvariantError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
OP_DT_ACCESSOR,
|
|
5
|
+
OP_DT_CONSTRUCTOR,
|
|
6
|
+
OP_DT_IS,
|
|
7
|
+
OP_DT_RECOGNISER,
|
|
8
|
+
OP_DT_UPDATE_FIELD,
|
|
9
|
+
SORT_BOOL,
|
|
10
|
+
SORT_SIZE_INFINITE,
|
|
11
|
+
SORT_SIZE_VERY_BIG,
|
|
12
|
+
} from "./ast";
|
|
13
|
+
import { stringHash } from "./hash";
|
|
14
|
+
import { RandomGen } from "./random-gen";
|
|
15
|
+
|
|
16
|
+
export interface AccessorDef {
|
|
17
|
+
name: string;
|
|
18
|
+
// A sort, or -1 - i for the i-th datatype of the declaration until it exists.
|
|
19
|
+
range: number;
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
export interface ConstructorDef {
|
|
23
|
+
name: string;
|
|
24
|
+
recognizer: string;
|
|
25
|
+
accessors: AccessorDef[];
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
const SIZE_OFFSET = 0;
|
|
29
|
+
const SIZE_PARAMETER = 1;
|
|
30
|
+
const SIZE_PLUS = 2;
|
|
31
|
+
const SIZE_TIMES = 3;
|
|
32
|
+
const SIZE_POWER = 4;
|
|
33
|
+
|
|
34
|
+
interface SizeTerm {
|
|
35
|
+
kind: number;
|
|
36
|
+
size: bigint;
|
|
37
|
+
index: number;
|
|
38
|
+
args: SizeTerm[];
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
export interface DatatypeDef {
|
|
42
|
+
name: string;
|
|
43
|
+
classId: number;
|
|
44
|
+
parameters: number[];
|
|
45
|
+
constructors: ConstructorDef[];
|
|
46
|
+
sort: number;
|
|
47
|
+
size: SizeTerm | undefined;
|
|
48
|
+
isRecursive: boolean;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
const MAX_FINITE_SIZE = 1n << 64n;
|
|
52
|
+
|
|
53
|
+
const mkSizeTerm = (kind: number, size: bigint, index: number, args: SizeTerm[]): SizeTerm => ({
|
|
54
|
+
kind,
|
|
55
|
+
size,
|
|
56
|
+
index,
|
|
57
|
+
args,
|
|
58
|
+
});
|
|
59
|
+
|
|
60
|
+
const mkOffset = (size: bigint) => mkSizeTerm(SIZE_OFFSET, size, 0, []);
|
|
61
|
+
|
|
62
|
+
const mkFold = (kind: number, args: SizeTerm[], empty: bigint) =>
|
|
63
|
+
args.length === 0
|
|
64
|
+
? mkOffset(empty)
|
|
65
|
+
: args.slice(1).reduce((left, right) => mkSizeTerm(kind, 0n, 0, [left, right]), args[0]);
|
|
66
|
+
|
|
67
|
+
const isInfiniteOrVeryBig = (size: bigint) =>
|
|
68
|
+
size === SORT_SIZE_INFINITE || size === SORT_SIZE_VERY_BIG;
|
|
69
|
+
|
|
70
|
+
const toSortSize = (size: bigint) => (size >= MAX_FINITE_SIZE ? SORT_SIZE_VERY_BIG : size);
|
|
71
|
+
|
|
72
|
+
const evalSize = (term: SizeTerm, parameterSizes: bigint[]): bigint => {
|
|
73
|
+
if (term.kind === SIZE_OFFSET) return term.size;
|
|
74
|
+
if (term.kind === SIZE_PARAMETER) return parameterSizes[term.index];
|
|
75
|
+
if (term.kind === SIZE_PLUS) {
|
|
76
|
+
let sum = 0n;
|
|
77
|
+
const todo = [term.args[0], term.args[1]];
|
|
78
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
79
|
+
if (current.kind === SIZE_PLUS) {
|
|
80
|
+
todo.push(current.args[0], current.args[1]);
|
|
81
|
+
continue;
|
|
82
|
+
}
|
|
83
|
+
const size = evalSize(current, parameterSizes);
|
|
84
|
+
if (isInfiniteOrVeryBig(size)) return size;
|
|
85
|
+
sum += size;
|
|
86
|
+
}
|
|
87
|
+
return toSortSize(sum);
|
|
88
|
+
}
|
|
89
|
+
const first = evalSize(term.args[0], parameterSizes);
|
|
90
|
+
const second = evalSize(term.args[1], parameterSizes);
|
|
91
|
+
if (first === SORT_SIZE_INFINITE) return first;
|
|
92
|
+
if (second === SORT_SIZE_INFINITE) return second;
|
|
93
|
+
if (first === SORT_SIZE_VERY_BIG) return first;
|
|
94
|
+
if (second === SORT_SIZE_VERY_BIG) return second;
|
|
95
|
+
if (term.kind === SIZE_TIMES) return toSortSize(first * second);
|
|
96
|
+
if (first === 1n || second === 1n) return first;
|
|
97
|
+
if (first > 2n << 20n || second > 10n) return SORT_SIZE_VERY_BIG;
|
|
98
|
+
return toSortSize(first ** second);
|
|
99
|
+
};
|
|
100
|
+
|
|
101
|
+
const getSymbolHash = (name: string) => stringHash(name, 17);
|
|
102
|
+
|
|
103
|
+
export const getDatatypeDef = (manager: AstManager, sort: number) =>
|
|
104
|
+
manager.datatypeDefs.get(manager.sortNames[sort]);
|
|
105
|
+
|
|
106
|
+
const getDef = (manager: AstManager, sort: number) => {
|
|
107
|
+
const def = getDatatypeDef(manager, sort);
|
|
108
|
+
if (def === undefined) throw new SmtInvariantError("datatype constructors have not been created");
|
|
109
|
+
return def;
|
|
110
|
+
};
|
|
111
|
+
|
|
112
|
+
export const mkDatatypeSort = (manager: AstManager, name: string, parameters: number[]) => {
|
|
113
|
+
const sort = manager.mkDatatypeSort(name, parameters);
|
|
114
|
+
const def = manager.datatypeDefs.get(name);
|
|
115
|
+
if (def?.size !== undefined && def.parameters.length === parameters.length)
|
|
116
|
+
manager.setSortSize(
|
|
117
|
+
sort,
|
|
118
|
+
evalSize(
|
|
119
|
+
def.size,
|
|
120
|
+
parameters.map((parameter) => manager.getSortSize(parameter)),
|
|
121
|
+
),
|
|
122
|
+
);
|
|
123
|
+
return sort;
|
|
124
|
+
};
|
|
125
|
+
|
|
126
|
+
export const substituteSort = (
|
|
127
|
+
manager: AstManager,
|
|
128
|
+
sort: number,
|
|
129
|
+
from: readonly number[],
|
|
130
|
+
to: readonly number[],
|
|
131
|
+
): number => {
|
|
132
|
+
const index = from.indexOf(sort);
|
|
133
|
+
if (index !== -1) return to[index];
|
|
134
|
+
const parameters = manager.getSortParameters(sort);
|
|
135
|
+
if (parameters.length === 0) return sort;
|
|
136
|
+
const substituted = parameters.map((parameter) => substituteSort(manager, parameter, from, to));
|
|
137
|
+
if (manager.isArraySort(sort)) return manager.mkArraySort(substituted);
|
|
138
|
+
if (manager.isSeqSort(sort)) return manager.mkSeqSort(substituted[0]);
|
|
139
|
+
if (manager.isReSort(sort)) return manager.mkReSort(substituted[0]);
|
|
140
|
+
const name = manager.sortNames[sort];
|
|
141
|
+
if (!manager.isDatatypeSort(sort)) return manager.mkUninterpretedSort(name, substituted);
|
|
142
|
+
const result = manager.mkDatatypeSort(name, substituted);
|
|
143
|
+
if (manager.getSortSize(result) === SORT_SIZE_INFINITE)
|
|
144
|
+
manager.setSortSize(result, manager.getSortSize(sort));
|
|
145
|
+
return result;
|
|
146
|
+
};
|
|
147
|
+
|
|
148
|
+
const instantiateDef = (manager: AstManager, def: DatatypeDef, sorts: readonly number[]) => {
|
|
149
|
+
if (def.sort === -1) def.sort = mkDatatypeSort(manager, def.name, def.parameters);
|
|
150
|
+
return sorts.length === 0 ? def.sort : substituteSort(manager, def.sort, def.parameters, sorts);
|
|
151
|
+
};
|
|
152
|
+
|
|
153
|
+
const getSubsorts = (manager: AstManager, sort: number, result: number[]) => {
|
|
154
|
+
result.push(sort);
|
|
155
|
+
for (const parameter of manager.getSortParameters(sort)) getSubsorts(manager, parameter, result);
|
|
156
|
+
return result;
|
|
157
|
+
};
|
|
158
|
+
|
|
159
|
+
const isWellFounded = (manager: AstManager, defs: DatatypeDef[], sorts: number[]) => {
|
|
160
|
+
const isWellFoundedDef = defs.map(() => false);
|
|
161
|
+
let numWellFounded = 0;
|
|
162
|
+
for (let isChanged = true; isChanged && numWellFounded < defs.length;) {
|
|
163
|
+
isChanged = false;
|
|
164
|
+
defs.forEach((def, index) => {
|
|
165
|
+
if (isWellFoundedDef[index]) return;
|
|
166
|
+
const hasGroundedConstructor = def.constructors.some((constructor) =>
|
|
167
|
+
constructor.accessors.every((accessor) => {
|
|
168
|
+
for (const subsort of getSubsorts(manager, accessor.range, [])) {
|
|
169
|
+
const sortIndex = sorts.indexOf(subsort);
|
|
170
|
+
if (sortIndex !== -1) {
|
|
171
|
+
if (!isWellFoundedDef[sortIndex]) return false;
|
|
172
|
+
} else if (manager.isDatatypeSort(subsort)) break;
|
|
173
|
+
}
|
|
174
|
+
return true;
|
|
175
|
+
}),
|
|
176
|
+
);
|
|
177
|
+
if (!hasGroundedConstructor) return;
|
|
178
|
+
isChanged = true;
|
|
179
|
+
isWellFoundedDef[index] = true;
|
|
180
|
+
numWellFounded++;
|
|
181
|
+
});
|
|
182
|
+
}
|
|
183
|
+
return numWellFounded === defs.length;
|
|
184
|
+
};
|
|
185
|
+
|
|
186
|
+
const isCovariant = (manager: AstManager, defs: DatatypeDef[], sorts: number[]) =>
|
|
187
|
+
defs.every((def) =>
|
|
188
|
+
def.constructors.every((constructor) =>
|
|
189
|
+
constructor.accessors.every((accessor) => {
|
|
190
|
+
const range = accessor.range;
|
|
191
|
+
if (!manager.isArraySort(range)) return true;
|
|
192
|
+
const parameters = manager.getSortParameters(range);
|
|
193
|
+
const subsorts: number[] = [];
|
|
194
|
+
for (const domain of parameters.slice(0, -1)) getSubsorts(manager, domain, subsorts);
|
|
195
|
+
const arrayRange = manager.getArrayRange(range);
|
|
196
|
+
if (!manager.isDatatypeSort(arrayRange)) getSubsorts(manager, arrayRange, subsorts);
|
|
197
|
+
return subsorts.every((subsort) => !sorts.includes(subsort));
|
|
198
|
+
}),
|
|
199
|
+
),
|
|
200
|
+
);
|
|
201
|
+
|
|
202
|
+
const isRecursiveDef = (manager: AstManager, start: DatatypeDef) => {
|
|
203
|
+
const isBlack = new Map<string, boolean>();
|
|
204
|
+
const todo = [start.sort];
|
|
205
|
+
while (todo.length > 0) {
|
|
206
|
+
const sort = todo[todo.length - 1];
|
|
207
|
+
const name = manager.sortNames[sort];
|
|
208
|
+
if (isBlack.get(name) === true) {
|
|
209
|
+
todo.pop();
|
|
210
|
+
continue;
|
|
211
|
+
}
|
|
212
|
+
const def = manager.datatypeDefs.get(name);
|
|
213
|
+
if (def === undefined) return true;
|
|
214
|
+
isBlack.set(name, false);
|
|
215
|
+
let canProcess = true;
|
|
216
|
+
for (const constructor of def.constructors)
|
|
217
|
+
for (const accessor of constructor.accessors)
|
|
218
|
+
for (const subsort of getSubsorts(manager, accessor.range, [])) {
|
|
219
|
+
if (!manager.isDatatypeSort(subsort)) continue;
|
|
220
|
+
const status = isBlack.get(manager.sortNames[subsort]);
|
|
221
|
+
if (status === false && manager.sortNames[subsort] === start.name) return true;
|
|
222
|
+
if (status !== undefined) continue;
|
|
223
|
+
todo.push(subsort);
|
|
224
|
+
canProcess = false;
|
|
225
|
+
}
|
|
226
|
+
if (!canProcess) continue;
|
|
227
|
+
isBlack.set(name, true);
|
|
228
|
+
todo.pop();
|
|
229
|
+
}
|
|
230
|
+
return false;
|
|
231
|
+
};
|
|
232
|
+
|
|
233
|
+
const getSortSizeTerm = (
|
|
234
|
+
manager: AstManager,
|
|
235
|
+
parameters: number[],
|
|
236
|
+
sort: number,
|
|
237
|
+
): SizeTerm | undefined => {
|
|
238
|
+
if (parameters.length === 0 && !manager.isDatatypeSort(sort))
|
|
239
|
+
return mkOffset(manager.getSortSize(sort));
|
|
240
|
+
if (manager.isDatatypeSort(sort)) {
|
|
241
|
+
const def = getDatatypeDef(manager, sort);
|
|
242
|
+
if (def === undefined) return undefined;
|
|
243
|
+
const substitution = manager
|
|
244
|
+
.getSortParameters(sort)
|
|
245
|
+
.map((parameter) => getSortSizeTerm(manager, parameters, parameter));
|
|
246
|
+
if (def.size === undefined) def.size = mkOffset(SORT_SIZE_INFINITE);
|
|
247
|
+
return substituteSize(def.size, substitution);
|
|
248
|
+
}
|
|
249
|
+
if (manager.isArraySort(sort)) {
|
|
250
|
+
const sortParameters = manager.getSortParameters(sort);
|
|
251
|
+
const domainSizes = sortParameters
|
|
252
|
+
.slice(0, -1)
|
|
253
|
+
.map((domain) => getSortSizeTerm(manager, parameters, domain));
|
|
254
|
+
const rangeSize = getSortSizeTerm(manager, parameters, manager.getArrayRange(sort));
|
|
255
|
+
if (rangeSize === undefined || domainSizes.some((size) => size === undefined)) return undefined;
|
|
256
|
+
return mkSizeTerm(SIZE_POWER, 0n, 0, [
|
|
257
|
+
rangeSize,
|
|
258
|
+
mkFold(
|
|
259
|
+
SIZE_TIMES,
|
|
260
|
+
domainSizes.flatMap((size) => (size === undefined ? [] : [size])),
|
|
261
|
+
1n,
|
|
262
|
+
),
|
|
263
|
+
]);
|
|
264
|
+
}
|
|
265
|
+
const index = parameters.indexOf(sort);
|
|
266
|
+
if (index !== -1) return mkSizeTerm(SIZE_PARAMETER, 0n, index, []);
|
|
267
|
+
return mkOffset(manager.getSortSize(sort));
|
|
268
|
+
};
|
|
269
|
+
|
|
270
|
+
const substituteSize = (term: SizeTerm, substitution: (SizeTerm | undefined)[]): SizeTerm => {
|
|
271
|
+
if (term.kind === SIZE_OFFSET) return term;
|
|
272
|
+
if (term.kind === SIZE_PARAMETER) return substitution[term.index] ?? mkOffset(SORT_SIZE_INFINITE);
|
|
273
|
+
return mkSizeTerm(
|
|
274
|
+
term.kind,
|
|
275
|
+
0n,
|
|
276
|
+
0,
|
|
277
|
+
term.args.map((arg) => substituteSize(arg, substitution)),
|
|
278
|
+
);
|
|
279
|
+
};
|
|
280
|
+
|
|
281
|
+
const computeSizeFunctions = (manager: AstManager, names: string[]) => {
|
|
282
|
+
const isBlack = new Map<string, boolean>();
|
|
283
|
+
const todo = [...names];
|
|
284
|
+
while (todo.length > 0) {
|
|
285
|
+
const name = todo[todo.length - 1];
|
|
286
|
+
if (isBlack.get(name) === true) {
|
|
287
|
+
todo.pop();
|
|
288
|
+
continue;
|
|
289
|
+
}
|
|
290
|
+
isBlack.set(name, false);
|
|
291
|
+
let isInfinite = false;
|
|
292
|
+
let canProcess = true;
|
|
293
|
+
const def = manager.datatypeDefs.get(name);
|
|
294
|
+
if (def === undefined) return;
|
|
295
|
+
for (const constructor of def.constructors)
|
|
296
|
+
for (const accessor of constructor.accessors) {
|
|
297
|
+
if (!manager.isDatatypeSort(accessor.range)) continue;
|
|
298
|
+
const rangeName = manager.sortNames[accessor.range];
|
|
299
|
+
const status = isBlack.get(rangeName);
|
|
300
|
+
if (status === false) isInfinite = true;
|
|
301
|
+
else if (status === undefined && names.includes(rangeName)) {
|
|
302
|
+
todo.push(rangeName);
|
|
303
|
+
canProcess = false;
|
|
304
|
+
}
|
|
305
|
+
}
|
|
306
|
+
if (!canProcess) continue;
|
|
307
|
+
todo.pop();
|
|
308
|
+
isBlack.set(name, true);
|
|
309
|
+
if (isInfinite) {
|
|
310
|
+
def.size = mkOffset(SORT_SIZE_INFINITE);
|
|
311
|
+
continue;
|
|
312
|
+
}
|
|
313
|
+
def.size = mkFold(
|
|
314
|
+
SIZE_PLUS,
|
|
315
|
+
def.constructors.map((constructor) =>
|
|
316
|
+
mkFold(
|
|
317
|
+
SIZE_TIMES,
|
|
318
|
+
constructor.accessors.flatMap((accessor) => {
|
|
319
|
+
const size = getSortSizeTerm(manager, def.parameters, accessor.range);
|
|
320
|
+
return size === undefined ? [] : [size];
|
|
321
|
+
}),
|
|
322
|
+
1n,
|
|
323
|
+
),
|
|
324
|
+
),
|
|
325
|
+
0n,
|
|
326
|
+
);
|
|
327
|
+
}
|
|
328
|
+
};
|
|
329
|
+
|
|
330
|
+
const resetDeclarations = (manager: AstManager) => {
|
|
331
|
+
manager.datatypeConstructors = [];
|
|
332
|
+
manager.constructorAccessors = [];
|
|
333
|
+
manager.constructorRecognizers = [];
|
|
334
|
+
manager.nonRecConstructors = [];
|
|
335
|
+
manager.nonRecDepths = [];
|
|
336
|
+
};
|
|
337
|
+
|
|
338
|
+
export const removeDatatype = (manager: AstManager, name: string) => {
|
|
339
|
+
manager.datatypeDefs.delete(name);
|
|
340
|
+
resetDeclarations(manager);
|
|
341
|
+
};
|
|
342
|
+
|
|
343
|
+
export const mkDatatypeDef = (
|
|
344
|
+
manager: AstManager,
|
|
345
|
+
name: string,
|
|
346
|
+
parameters: number[],
|
|
347
|
+
constructors: ConstructorDef[],
|
|
348
|
+
): DatatypeDef => ({
|
|
349
|
+
name,
|
|
350
|
+
classId: manager.datatypeDefs.size,
|
|
351
|
+
parameters,
|
|
352
|
+
constructors,
|
|
353
|
+
sort: -1,
|
|
354
|
+
size: undefined,
|
|
355
|
+
isRecursive: false,
|
|
356
|
+
});
|
|
357
|
+
|
|
358
|
+
export const mkDatatypes = (manager: AstManager, defs: DatatypeDef[]): number[] | string => {
|
|
359
|
+
for (const def of defs) {
|
|
360
|
+
if (manager.datatypeDefs.has(def.name)) resetDeclarations(manager);
|
|
361
|
+
manager.datatypeDefs.set(def.name, def);
|
|
362
|
+
}
|
|
363
|
+
const sorts = defs.map((def) => instantiateDef(manager, def, []));
|
|
364
|
+
for (const def of defs)
|
|
365
|
+
for (const constructor of def.constructors)
|
|
366
|
+
for (const accessor of constructor.accessors)
|
|
367
|
+
if (accessor.range < 0) accessor.range = sorts[-1 - accessor.range];
|
|
368
|
+
if (!isWellFounded(manager, defs, sorts)) return "datatype is not well-founded";
|
|
369
|
+
if (!isCovariant(manager, defs, sorts)) return "datatype is not co-variant";
|
|
370
|
+
if (
|
|
371
|
+
defs.some((def) =>
|
|
372
|
+
def.constructors.some((constructor) =>
|
|
373
|
+
constructor.accessors.some(
|
|
374
|
+
(accessor) =>
|
|
375
|
+
manager.isArraySort(accessor.range) &&
|
|
376
|
+
sorts.includes(manager.getArrayRange(accessor.range)),
|
|
377
|
+
),
|
|
378
|
+
),
|
|
379
|
+
)
|
|
380
|
+
)
|
|
381
|
+
manager.hasNestedRecDatatype = true;
|
|
382
|
+
computeSizeFunctions(
|
|
383
|
+
manager,
|
|
384
|
+
defs.map((def) => def.name),
|
|
385
|
+
);
|
|
386
|
+
for (const def of defs) mkDatatypeSort(manager, def.name, def.parameters);
|
|
387
|
+
for (const def of defs) def.isRecursive = isRecursiveDef(manager, def);
|
|
388
|
+
return sorts;
|
|
389
|
+
};
|
|
390
|
+
|
|
391
|
+
const getConstructorDef = (manager: AstManager, constructor: number) =>
|
|
392
|
+
getDef(manager, manager.funcDecls[constructor].range).constructors[
|
|
393
|
+
manager.funcDecls[constructor].parameters[0]
|
|
394
|
+
];
|
|
395
|
+
|
|
396
|
+
export const instantiateAccessor = (
|
|
397
|
+
manager: AstManager,
|
|
398
|
+
sort: number,
|
|
399
|
+
constructorIndex: number,
|
|
400
|
+
index: number,
|
|
401
|
+
) => {
|
|
402
|
+
const def = getDef(manager, sort);
|
|
403
|
+
const constructor = def.constructors[constructorIndex];
|
|
404
|
+
const accessor = constructor.accessors[index];
|
|
405
|
+
return manager.mkDatatypeDecl(
|
|
406
|
+
OP_DT_ACCESSOR,
|
|
407
|
+
accessor.name,
|
|
408
|
+
[constructorIndex, index],
|
|
409
|
+
[getSymbolHash(accessor.name), getSymbolHash(constructor.name)],
|
|
410
|
+
[sort],
|
|
411
|
+
substituteSort(manager, accessor.range, def.parameters, manager.getSortParameters(sort)),
|
|
412
|
+
);
|
|
413
|
+
};
|
|
414
|
+
|
|
415
|
+
export const getDatatypeConstructors = (manager: AstManager, sort: number) => {
|
|
416
|
+
const existing = manager.datatypeConstructors[sort];
|
|
417
|
+
if (existing !== undefined) return existing;
|
|
418
|
+
const def = getDef(manager, sort);
|
|
419
|
+
const parameters = manager.getSortParameters(sort);
|
|
420
|
+
const constructors = def.constructors.map((constructor, index) =>
|
|
421
|
+
manager.mkDatatypeDecl(
|
|
422
|
+
OP_DT_CONSTRUCTOR,
|
|
423
|
+
constructor.name,
|
|
424
|
+
[index],
|
|
425
|
+
[getSymbolHash(constructor.name)],
|
|
426
|
+
constructor.accessors.map((accessor) =>
|
|
427
|
+
substituteSort(manager, accessor.range, def.parameters, parameters),
|
|
428
|
+
),
|
|
429
|
+
instantiateDef(manager, def, parameters),
|
|
430
|
+
),
|
|
431
|
+
);
|
|
432
|
+
manager.datatypeConstructors[sort] = constructors;
|
|
433
|
+
return constructors;
|
|
434
|
+
};
|
|
435
|
+
|
|
436
|
+
export const getConstructorAccessors = (manager: AstManager, constructor: number) => {
|
|
437
|
+
const existing = manager.constructorAccessors[constructor];
|
|
438
|
+
if (existing !== undefined) return existing;
|
|
439
|
+
const funcDecl = manager.funcDecls[constructor];
|
|
440
|
+
const accessors = getConstructorDef(manager, constructor).accessors.map((_accessor, index) =>
|
|
441
|
+
instantiateAccessor(manager, funcDecl.range, funcDecl.parameters[0], index),
|
|
442
|
+
);
|
|
443
|
+
manager.constructorAccessors[constructor] = accessors;
|
|
444
|
+
return accessors;
|
|
445
|
+
};
|
|
446
|
+
|
|
447
|
+
export const getConstructorRecognizer = (manager: AstManager, constructor: number) => {
|
|
448
|
+
const existing = manager.constructorRecognizers[constructor];
|
|
449
|
+
if (existing !== undefined) return existing;
|
|
450
|
+
const name = getConstructorDef(manager, constructor).recognizer;
|
|
451
|
+
const recognizer = manager.mkDatatypeDecl(
|
|
452
|
+
OP_DT_RECOGNISER,
|
|
453
|
+
name,
|
|
454
|
+
[constructor],
|
|
455
|
+
[manager.getDeclHash(constructor), getSymbolHash(name)],
|
|
456
|
+
[manager.funcDecls[constructor].range],
|
|
457
|
+
SORT_BOOL,
|
|
458
|
+
);
|
|
459
|
+
manager.constructorRecognizers[constructor] = recognizer;
|
|
460
|
+
return recognizer;
|
|
461
|
+
};
|
|
462
|
+
|
|
463
|
+
export const getConstructorIs = (manager: AstManager, constructor: number) =>
|
|
464
|
+
manager.mkDatatypeDecl(
|
|
465
|
+
OP_DT_IS,
|
|
466
|
+
"is",
|
|
467
|
+
[constructor],
|
|
468
|
+
[manager.getDeclHash(constructor)],
|
|
469
|
+
[manager.funcDecls[constructor].range],
|
|
470
|
+
SORT_BOOL,
|
|
471
|
+
);
|
|
472
|
+
|
|
473
|
+
export const mkUpdateField = (manager: AstManager, accessor: number) => {
|
|
474
|
+
const funcDecl = manager.funcDecls[accessor];
|
|
475
|
+
return manager.mkDatatypeDecl(
|
|
476
|
+
OP_DT_UPDATE_FIELD,
|
|
477
|
+
"update-field",
|
|
478
|
+
[accessor],
|
|
479
|
+
[manager.getDeclHash(accessor)],
|
|
480
|
+
[funcDecl.domain[0], funcDecl.range],
|
|
481
|
+
funcDecl.domain[0],
|
|
482
|
+
);
|
|
483
|
+
};
|
|
484
|
+
|
|
485
|
+
export const getAccessorConstructor = (manager: AstManager, accessor: number) => {
|
|
486
|
+
const funcDecl = manager.funcDecls[accessor];
|
|
487
|
+
return getDatatypeConstructors(manager, funcDecl.domain[0])[funcDecl.parameters[0]];
|
|
488
|
+
};
|
|
489
|
+
|
|
490
|
+
export const getConstructorIndex = (manager: AstManager, constructor: number) =>
|
|
491
|
+
manager.funcDecls[constructor].parameters[0];
|
|
492
|
+
|
|
493
|
+
export const getRecognizerConstructor = (manager: AstManager, recognizer: number) =>
|
|
494
|
+
manager.funcDecls[recognizer].parameters[0];
|
|
495
|
+
|
|
496
|
+
export const getNumConstructors = (manager: AstManager, sort: number) =>
|
|
497
|
+
getDatatypeDef(manager, sort)?.constructors.length ?? 0;
|
|
498
|
+
|
|
499
|
+
export const isRecursiveDatatype = (manager: AstManager, sort: number) =>
|
|
500
|
+
getDatatypeDef(manager, sort)?.isRecursive ?? true;
|
|
501
|
+
|
|
502
|
+
export const instantiateConstructor = (
|
|
503
|
+
manager: AstManager,
|
|
504
|
+
def: DatatypeDef,
|
|
505
|
+
index: number,
|
|
506
|
+
parameters: number[],
|
|
507
|
+
) => getDatatypeConstructors(manager, instantiateDef(manager, def, parameters))[index];
|
|
508
|
+
|
|
509
|
+
const getArrayRangeRec = (manager: AstManager, sort: number) => {
|
|
510
|
+
let current = sort;
|
|
511
|
+
while (manager.isArraySort(current)) current = manager.getArrayRange(current);
|
|
512
|
+
return current;
|
|
513
|
+
};
|
|
514
|
+
|
|
515
|
+
const isRecursiveNested = (manager: AstManager, sort: number) => {
|
|
516
|
+
if (!manager.isArraySort(sort)) return false;
|
|
517
|
+
const range = getArrayRangeRec(manager, sort);
|
|
518
|
+
return manager.isDatatypeSort(range) && isRecursiveDatatype(manager, range);
|
|
519
|
+
};
|
|
520
|
+
|
|
521
|
+
const getNonRecConstructorCore = (
|
|
522
|
+
manager: AstManager,
|
|
523
|
+
sort: number,
|
|
524
|
+
forbidden: number[],
|
|
525
|
+
): { constructor: number; depth: number } => {
|
|
526
|
+
const constructors = getDatatypeConstructors(manager, sort);
|
|
527
|
+
const found = manager.nonRecConstructors[sort];
|
|
528
|
+
if (found !== undefined) return { constructor: found, depth: manager.nonRecDepths[sort] };
|
|
529
|
+
const remember = (constructor: number, depth: number) => {
|
|
530
|
+
manager.nonRecConstructors[sort] = constructor;
|
|
531
|
+
manager.nonRecDepths[sort] = depth;
|
|
532
|
+
return { constructor, depth };
|
|
533
|
+
};
|
|
534
|
+
const random = new RandomGen(manager.getSortSmallId(sort));
|
|
535
|
+
const start = random.next();
|
|
536
|
+
for (let offset = 0; offset < constructors.length; offset++) {
|
|
537
|
+
const constructor = constructors[(start + offset) % constructors.length];
|
|
538
|
+
if (
|
|
539
|
+
manager.funcDecls[constructor].domain.every(
|
|
540
|
+
(argSort) => !manager.isDatatypeSort(argSort) && !isRecursiveNested(manager, argSort),
|
|
541
|
+
)
|
|
542
|
+
)
|
|
543
|
+
return remember(constructor, 1);
|
|
544
|
+
}
|
|
545
|
+
let result = -1;
|
|
546
|
+
let minDepth = Number.MAX_SAFE_INTEGER;
|
|
547
|
+
for (let offset = 0; offset < constructors.length; offset++) {
|
|
548
|
+
const constructor = constructors[(start + offset) % constructors.length];
|
|
549
|
+
const domain = manager.funcDecls[constructor].domain;
|
|
550
|
+
const argStart = random.next();
|
|
551
|
+
let maxDepth = 0;
|
|
552
|
+
let argOffset = 0;
|
|
553
|
+
for (; argOffset < domain.length; argOffset++) {
|
|
554
|
+
const argSort = getArrayRangeRec(manager, domain[(argStart + argOffset) % domain.length]);
|
|
555
|
+
if (!manager.isDatatypeSort(argSort)) continue;
|
|
556
|
+
if (forbidden.includes(argSort)) break;
|
|
557
|
+
forbidden.push(argSort);
|
|
558
|
+
const nested = getNonRecConstructorCore(manager, argSort, forbidden);
|
|
559
|
+
forbidden.pop();
|
|
560
|
+
if (nested.constructor === -1) break;
|
|
561
|
+
maxDepth = Math.max(nested.depth + 1, maxDepth);
|
|
562
|
+
}
|
|
563
|
+
if (argOffset === domain.length && maxDepth < minDepth) {
|
|
564
|
+
result = constructor;
|
|
565
|
+
minDepth = maxDepth;
|
|
566
|
+
}
|
|
567
|
+
}
|
|
568
|
+
return result === -1 ? { constructor: -1, depth: 0 } : remember(result, minDepth);
|
|
569
|
+
};
|
|
570
|
+
|
|
571
|
+
export const getNonRecConstructor = (manager: AstManager, sort: number) =>
|
|
572
|
+
getNonRecConstructorCore(manager, sort, [sort]).constructor;
|
|
@@ -0,0 +1,82 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
OP_DT_ACCESSOR,
|
|
5
|
+
OP_DT_CONSTRUCTOR,
|
|
6
|
+
OP_DT_IS,
|
|
7
|
+
OP_DT_RECOGNISER,
|
|
8
|
+
OP_DT_UPDATE_FIELD,
|
|
9
|
+
} from "./ast";
|
|
10
|
+
import {
|
|
11
|
+
getAccessorConstructor,
|
|
12
|
+
getConstructorIs,
|
|
13
|
+
getNumConstructors,
|
|
14
|
+
getRecognizerConstructor,
|
|
15
|
+
} from "./datatype-decl-plugin";
|
|
16
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
17
|
+
|
|
18
|
+
const isAppOf = (manager: AstManager, expr: number, op: number) =>
|
|
19
|
+
manager.kinds[expr] === KIND_APP && manager.getOp(expr) === op;
|
|
20
|
+
|
|
21
|
+
export const mkDatatypeAppCore = (
|
|
22
|
+
manager: AstManager,
|
|
23
|
+
decl: number,
|
|
24
|
+
args: number[],
|
|
25
|
+
): number | Rewrite | undefined => {
|
|
26
|
+
const funcDecl = manager.funcDecls[decl];
|
|
27
|
+
const arg = args[0];
|
|
28
|
+
if (funcDecl.op === OP_DT_RECOGNISER)
|
|
29
|
+
return {
|
|
30
|
+
expr: manager.mkApp(
|
|
31
|
+
getConstructorIs(manager, getRecognizerConstructor(manager, decl)),
|
|
32
|
+
[arg],
|
|
33
|
+
funcDecl.range,
|
|
34
|
+
),
|
|
35
|
+
depth: 1,
|
|
36
|
+
};
|
|
37
|
+
if (funcDecl.op === OP_DT_IS) {
|
|
38
|
+
if (getNumConstructors(manager, manager.sorts[arg]) === 1) return manager.trueExpr;
|
|
39
|
+
if (isAppOf(manager, arg, OP_DT_UPDATE_FIELD))
|
|
40
|
+
return { expr: manager.mkApp(decl, [manager.getArg(arg, 0)], funcDecl.range), depth: 1 };
|
|
41
|
+
if (!isAppOf(manager, arg, OP_DT_CONSTRUCTOR)) return undefined;
|
|
42
|
+
return manager.decls[arg] === getRecognizerConstructor(manager, decl)
|
|
43
|
+
? manager.trueExpr
|
|
44
|
+
: manager.falseExpr;
|
|
45
|
+
}
|
|
46
|
+
if (funcDecl.op === OP_DT_ACCESSOR) {
|
|
47
|
+
if (manager.kinds[arg] !== KIND_APP) return undefined;
|
|
48
|
+
if (
|
|
49
|
+
isAppOf(manager, arg, OP_DT_UPDATE_FIELD) &&
|
|
50
|
+
getNumConstructors(manager, manager.sorts[arg]) === 1
|
|
51
|
+
) {
|
|
52
|
+
if (manager.funcDecls[manager.decls[arg]].parameters[0] === decl)
|
|
53
|
+
return manager.getArg(arg, 1);
|
|
54
|
+
return { expr: manager.mkApp(decl, [manager.getArg(arg, 0)], funcDecl.range), depth: 1 };
|
|
55
|
+
}
|
|
56
|
+
if (!isAppOf(manager, arg, OP_DT_CONSTRUCTOR)) return undefined;
|
|
57
|
+
if (manager.decls[arg] !== getAccessorConstructor(manager, decl)) return undefined;
|
|
58
|
+
return manager.getArg(arg, funcDecl.parameters[1]);
|
|
59
|
+
}
|
|
60
|
+
if (funcDecl.op !== OP_DT_UPDATE_FIELD || !isAppOf(manager, arg, OP_DT_CONSTRUCTOR))
|
|
61
|
+
return undefined;
|
|
62
|
+
const accessor = funcDecl.parameters[0];
|
|
63
|
+
if (manager.decls[arg] !== getAccessorConstructor(manager, accessor)) return arg;
|
|
64
|
+
const position = manager.funcDecls[accessor].parameters[1];
|
|
65
|
+
return manager.mkApp(
|
|
66
|
+
manager.decls[arg],
|
|
67
|
+
manager.mapArgs(arg, (field, index) => (index === position ? args[1] : field)),
|
|
68
|
+
manager.sorts[arg],
|
|
69
|
+
);
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
export const mkDatatypeEqCore = (
|
|
73
|
+
manager: AstManager,
|
|
74
|
+
lhs: number,
|
|
75
|
+
rhs: number,
|
|
76
|
+
): number | Rewrite | undefined => {
|
|
77
|
+
if (!isAppOf(manager, lhs, OP_DT_CONSTRUCTOR) || !isAppOf(manager, rhs, OP_DT_CONSTRUCTOR))
|
|
78
|
+
return undefined;
|
|
79
|
+
if (manager.decls[lhs] !== manager.decls[rhs]) return manager.falseExpr;
|
|
80
|
+
const eqs = manager.mapArgs(lhs, (arg, index) => manager.mkEq(arg, manager.getArg(rhs, index)));
|
|
81
|
+
return { expr: manager.mkAnd(eqs), depth: 2 };
|
|
82
|
+
};
|