tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +47 -44
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +474 -718
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +8 -7
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +244 -238
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +31 -106
- package/src/exit-codes.ts +2 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +616 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +50 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +15 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +206 -44
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +22 -47
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +54 -26
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,871 @@
|
|
|
1
|
+
import { SmtCanceledError } from "../../../errors";
|
|
2
|
+
import { OP_EQ, SORT_BOOL, type AstManager } from "./ast";
|
|
3
|
+
import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
|
|
4
|
+
import { assign, assignOwned, release } from "./expr-ref";
|
|
5
|
+
import { Rewriter } from "./rewriter";
|
|
6
|
+
|
|
7
|
+
// Z3's default bool_rewriter parameters, after set_flat_and_or(false).
|
|
8
|
+
const BOOL_REWRITER_OPTIONS = {
|
|
9
|
+
isEliminatingAnd: false,
|
|
10
|
+
arith: TACTIC_ARITH_OPTIONS,
|
|
11
|
+
isRewritingPatterns: false,
|
|
12
|
+
isFlatAndOr: false,
|
|
13
|
+
};
|
|
14
|
+
|
|
15
|
+
type Bits = readonly number[];
|
|
16
|
+
|
|
17
|
+
// mk_not_core releases the negation of an equality's left side before it returns. Its callers hold
|
|
18
|
+
// temporaries open.
|
|
19
|
+
class BlasterBoolRewriter extends Rewriter {
|
|
20
|
+
mkNot(arg: number): number {
|
|
21
|
+
const manager = this.manager;
|
|
22
|
+
if (manager.getOp(arg) !== OP_EQ || manager.sorts[manager.getArg(arg, 0)] !== SORT_BOOL)
|
|
23
|
+
return super.mkNot(arg);
|
|
24
|
+
const outer = manager.beginTemporaries();
|
|
25
|
+
const result = this.mkEq(this.mkNot(manager.getArg(arg, 0)), manager.getArg(arg, 1));
|
|
26
|
+
manager.incRef(result);
|
|
27
|
+
manager.endTemporaries(outer);
|
|
28
|
+
manager.releaseLater(result);
|
|
29
|
+
return result;
|
|
30
|
+
}
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
export class BitBlaster {
|
|
34
|
+
private rewriter: Rewriter;
|
|
35
|
+
|
|
36
|
+
// isBlasterCfg: the blaster_cfg of bit_blaster_rewriter, whose bool_rewriter eliminates and and
|
|
37
|
+
// whose xor3 and carry don't sort their arguments.
|
|
38
|
+
constructor(
|
|
39
|
+
private manager: AstManager,
|
|
40
|
+
private isBlasterCfg = false,
|
|
41
|
+
) {
|
|
42
|
+
this.rewriter = isBlasterCfg
|
|
43
|
+
? new BlasterBoolRewriter(manager, { ...BOOL_REWRITER_OPTIONS, isEliminatingAnd: true })
|
|
44
|
+
: new Rewriter(manager, BOOL_REWRITER_OPTIONS);
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
private checkpoint() {
|
|
48
|
+
if (!this.manager.limit.inc()) throw new SmtCanceledError();
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
private own(expr: number) {
|
|
52
|
+
this.manager.incRef(expr);
|
|
53
|
+
return expr;
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
private drop(expr: number) {
|
|
57
|
+
this.manager.decRef(expr);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
private dropAll(exprs: number[]) {
|
|
61
|
+
for (const expr of exprs) this.manager.decRef(expr);
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
private isBoolConst(expr: number) {
|
|
65
|
+
return expr === this.manager.trueExpr || expr === this.manager.falseExpr;
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
// blaster_cfg's bool_rewriter releases the conjunction that eliminating and makes, so its
|
|
69
|
+
// temporaries are held until it returns.
|
|
70
|
+
private beginRewrite() {
|
|
71
|
+
return this.isBlasterCfg ? this.manager.beginTemporaries() : -1;
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
private endRewrite(result: number, outer: number) {
|
|
75
|
+
this.manager.incRef(result);
|
|
76
|
+
if (this.isBlasterCfg) this.manager.endTemporaries(outer);
|
|
77
|
+
return result;
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
mkNot(arg: number) {
|
|
81
|
+
const outer = this.beginRewrite();
|
|
82
|
+
return this.endRewrite(this.rewriter.mkNot(arg), outer);
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
mkAnd(args: number[]) {
|
|
86
|
+
const outer = this.beginRewrite();
|
|
87
|
+
return this.endRewrite(this.rewriter.mkAnd(args), outer);
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
mkOr(args: number[]) {
|
|
91
|
+
const outer = this.beginRewrite();
|
|
92
|
+
return this.endRewrite(this.rewriter.mkOr(args), outer);
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
mkIff(first: number, second: number) {
|
|
96
|
+
const outer = this.beginRewrite();
|
|
97
|
+
return this.endRewrite(this.rewriter.mkEq(first, second), outer);
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
// previous: the argument's expr_ref Z3 assigns the result to, released before the temporaries.
|
|
101
|
+
|
|
102
|
+
mkXor(first: number, second: number, previous = -1) {
|
|
103
|
+
const negation = this.mkNot(first);
|
|
104
|
+
const result = this.mkIff(negation, second);
|
|
105
|
+
release(this.manager, previous);
|
|
106
|
+
this.drop(negation);
|
|
107
|
+
return result;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
mkIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
111
|
+
const outer = this.beginRewrite();
|
|
112
|
+
const result = this.rewriter.mkIte(condition, thenExpr, elseExpr);
|
|
113
|
+
return this.endRewrite(typeof result === "number" ? result : result.expr, outer);
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
private mkNand(first: number, second: number) {
|
|
117
|
+
const conjunction = this.mkAnd([first, second]);
|
|
118
|
+
const result = this.mkNot(conjunction);
|
|
119
|
+
this.drop(conjunction);
|
|
120
|
+
return result;
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private mkNor(first: number, second: number) {
|
|
124
|
+
const disjunction = this.mkOr([first, second]);
|
|
125
|
+
const result = this.mkNot(disjunction);
|
|
126
|
+
this.drop(disjunction);
|
|
127
|
+
return result;
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
private mkGe2(first: number, second: number, third: number, previous: number) {
|
|
131
|
+
const manager = this.manager;
|
|
132
|
+
const result = manager.isFalse(first)
|
|
133
|
+
? this.mkAnd([second, third])
|
|
134
|
+
: manager.isFalse(second)
|
|
135
|
+
? this.mkAnd([first, third])
|
|
136
|
+
: manager.isFalse(third)
|
|
137
|
+
? this.mkAnd([first, second])
|
|
138
|
+
: manager.isTrue(first)
|
|
139
|
+
? this.mkOr([second, third])
|
|
140
|
+
: manager.isTrue(second)
|
|
141
|
+
? this.mkOr([first, third])
|
|
142
|
+
: manager.isTrue(third)
|
|
143
|
+
? this.mkOr([first, second])
|
|
144
|
+
: -1;
|
|
145
|
+
if (result !== -1) {
|
|
146
|
+
release(manager, previous);
|
|
147
|
+
return result;
|
|
148
|
+
}
|
|
149
|
+
const pair1 = this.mkAnd([first, second]);
|
|
150
|
+
const pair2 = this.mkAnd([first, third]);
|
|
151
|
+
const pair3 = this.mkAnd([second, third]);
|
|
152
|
+
const disjunction = this.mkOr([pair1, pair2, pair3]);
|
|
153
|
+
release(manager, previous);
|
|
154
|
+
this.drop(pair3);
|
|
155
|
+
this.drop(pair2);
|
|
156
|
+
this.drop(pair1);
|
|
157
|
+
return disjunction;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
private sortArgs(first: number, second: number, third: number) {
|
|
161
|
+
const ids = this.manager.ids;
|
|
162
|
+
return [first, second, third].sort((left, right) => ids[left] - ids[right]);
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private mkXor3(first: number, second: number, third: number, previous = -1) {
|
|
166
|
+
if (this.isBlasterCfg) {
|
|
167
|
+
const partial = this.mkXor(second, third);
|
|
168
|
+
const result = this.mkXor(first, partial, previous);
|
|
169
|
+
this.drop(partial);
|
|
170
|
+
return result;
|
|
171
|
+
}
|
|
172
|
+
const sorted = this.sortArgs(first, second, third);
|
|
173
|
+
const partial = this.mkXor(sorted[0], sorted[1]);
|
|
174
|
+
const result = this.mkXor(partial, sorted[2], previous);
|
|
175
|
+
this.drop(partial);
|
|
176
|
+
return result;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
private mkCarry(first: number, second: number, third: number) {
|
|
180
|
+
const sorted = this.isBlasterCfg ? [first, second, third] : this.sortArgs(first, second, third);
|
|
181
|
+
const pair1 = this.mkAnd([sorted[0], sorted[1]]);
|
|
182
|
+
const pair2 = this.mkAnd([sorted[0], sorted[2]]);
|
|
183
|
+
const pair3 = this.mkAnd([sorted[1], sorted[2]]);
|
|
184
|
+
const result = this.mkOr([pair1, pair2, pair3]);
|
|
185
|
+
this.drop(pair3);
|
|
186
|
+
this.drop(pair2);
|
|
187
|
+
this.drop(pair1);
|
|
188
|
+
return result;
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
private getNumeral(bits: Bits) {
|
|
192
|
+
const manager = this.manager;
|
|
193
|
+
let value = 0n;
|
|
194
|
+
for (let index = bits.length - 1; index >= 0; index--) {
|
|
195
|
+
if (manager.isTrue(bits[index])) value = value * 2n + 1n;
|
|
196
|
+
else if (manager.isFalse(bits[index])) value *= 2n;
|
|
197
|
+
else return undefined;
|
|
198
|
+
}
|
|
199
|
+
return value;
|
|
200
|
+
}
|
|
201
|
+
|
|
202
|
+
private isMinusOne(bits: Bits) {
|
|
203
|
+
return bits.every((bit) => this.manager.isTrue(bit));
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
num2bits(value: bigint, size: number, out: number[]) {
|
|
207
|
+
for (let index = 0; index < size; index++)
|
|
208
|
+
out.push(
|
|
209
|
+
this.own(
|
|
210
|
+
((value >> BigInt(index)) & 1n) === 1n ? this.manager.trueExpr : this.manager.falseExpr,
|
|
211
|
+
),
|
|
212
|
+
);
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
mkNeg(bits: Bits, out: number[]) {
|
|
216
|
+
const manager = this.manager;
|
|
217
|
+
const size = bits.length;
|
|
218
|
+
let carryIn = this.own(manager.trueExpr);
|
|
219
|
+
let carryOut = -1;
|
|
220
|
+
let output = -1;
|
|
221
|
+
for (let index = 0; index < size; index++) {
|
|
222
|
+
const negation = this.mkNot(bits[index]);
|
|
223
|
+
output = assignOwned(manager, output, this.mkXor(negation, carryIn));
|
|
224
|
+
if (index < size - 1)
|
|
225
|
+
carryOut = assignOwned(manager, carryOut, this.mkAnd([negation, carryIn]));
|
|
226
|
+
out.push(this.own(output));
|
|
227
|
+
carryIn = assign(manager, carryIn, carryOut);
|
|
228
|
+
this.drop(negation);
|
|
229
|
+
}
|
|
230
|
+
release(manager, output);
|
|
231
|
+
release(manager, carryOut);
|
|
232
|
+
release(manager, carryIn);
|
|
233
|
+
}
|
|
234
|
+
|
|
235
|
+
mkAdder(first: Bits, second: Bits, out: number[]) {
|
|
236
|
+
const manager = this.manager;
|
|
237
|
+
const size = first.length;
|
|
238
|
+
let carryIn = this.own(manager.falseExpr);
|
|
239
|
+
let carryOut = -1;
|
|
240
|
+
let output = -1;
|
|
241
|
+
for (let index = 0; index < size; index++) {
|
|
242
|
+
output = assignOwned(manager, output, this.mkXor3(first[index], second[index], carryIn));
|
|
243
|
+
if (index < size - 1)
|
|
244
|
+
carryOut = assignOwned(
|
|
245
|
+
manager,
|
|
246
|
+
carryOut,
|
|
247
|
+
this.mkCarry(first[index], second[index], carryIn),
|
|
248
|
+
);
|
|
249
|
+
out.push(this.own(output));
|
|
250
|
+
carryIn = assign(manager, carryIn, carryOut);
|
|
251
|
+
}
|
|
252
|
+
release(manager, output);
|
|
253
|
+
release(manager, carryOut);
|
|
254
|
+
release(manager, carryIn);
|
|
255
|
+
}
|
|
256
|
+
|
|
257
|
+
// The carry out of the last bit, which it returns, is first >= second.
|
|
258
|
+
mkSubtracter(first: Bits, second: Bits, out: number[]) {
|
|
259
|
+
const manager = this.manager;
|
|
260
|
+
let carryIn = this.own(manager.trueExpr);
|
|
261
|
+
let carryOut = -1;
|
|
262
|
+
let output = -1;
|
|
263
|
+
for (let index = 0; index < first.length; index++) {
|
|
264
|
+
const negation = this.mkNot(second[index]);
|
|
265
|
+
output = assignOwned(manager, output, this.mkXor3(first[index], negation, carryIn));
|
|
266
|
+
carryOut = assignOwned(manager, carryOut, this.mkCarry(first[index], negation, carryIn));
|
|
267
|
+
out.push(this.own(output));
|
|
268
|
+
carryIn = assign(manager, carryIn, carryOut);
|
|
269
|
+
this.drop(negation);
|
|
270
|
+
}
|
|
271
|
+
release(manager, output);
|
|
272
|
+
release(manager, carryIn);
|
|
273
|
+
return carryOut;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
mkMultiplier(inputFirst: Bits, inputSecond: Bits, out: number[]) {
|
|
277
|
+
const manager = this.manager;
|
|
278
|
+
const size = inputFirst.length;
|
|
279
|
+
const isFirstNumeral = this.getNumeral(inputFirst) !== undefined;
|
|
280
|
+
const first = isFirstNumeral ? inputSecond : inputFirst;
|
|
281
|
+
const second = isFirstNumeral ? inputFirst : inputSecond;
|
|
282
|
+
if (this.isMinusOne(second)) {
|
|
283
|
+
this.mkNeg(first, out);
|
|
284
|
+
return;
|
|
285
|
+
}
|
|
286
|
+
const firstValue = this.getNumeral(first);
|
|
287
|
+
const secondValue = this.getNumeral(second);
|
|
288
|
+
if (firstValue !== undefined && secondValue !== undefined) {
|
|
289
|
+
this.num2bits(firstValue * secondValue, size, out);
|
|
290
|
+
return;
|
|
291
|
+
}
|
|
292
|
+
if (this.mkConstCaseMultiplier(first, second, out)) return;
|
|
293
|
+
let carryIns: number[] = [];
|
|
294
|
+
let carryOuts: number[] = [];
|
|
295
|
+
let output = this.mkAnd([first[0], second[0]]);
|
|
296
|
+
let carryOut = -1;
|
|
297
|
+
out.push(this.own(output));
|
|
298
|
+
for (let index = 1; index < size; index++) {
|
|
299
|
+
this.checkpoint();
|
|
300
|
+
this.dropAll(carryOuts);
|
|
301
|
+
carryOuts = [];
|
|
302
|
+
const product1 = this.mkAnd([first[0], second[index]]);
|
|
303
|
+
const product2 = this.mkAnd([first[1], second[index - 1]]);
|
|
304
|
+
if (index < size - 1) {
|
|
305
|
+
output = assignOwned(manager, output, this.mkXor(product1, product2));
|
|
306
|
+
carryOut = assignOwned(manager, carryOut, this.mkAnd([product1, product2]));
|
|
307
|
+
carryOuts.push(this.own(carryOut));
|
|
308
|
+
for (let column = 2; column <= index; column++) {
|
|
309
|
+
const previous = this.own(output);
|
|
310
|
+
const product3 = this.mkAnd([first[column], second[index - column]]);
|
|
311
|
+
const carry = carryIns[column - 2];
|
|
312
|
+
output = assignOwned(manager, output, this.mkXor3(product3, previous, carry));
|
|
313
|
+
carryOut = assignOwned(manager, carryOut, this.mkCarry(product3, previous, carry));
|
|
314
|
+
carryOuts.push(this.own(carryOut));
|
|
315
|
+
this.drop(product3);
|
|
316
|
+
this.drop(previous);
|
|
317
|
+
}
|
|
318
|
+
out.push(this.own(output));
|
|
319
|
+
const swapped = carryIns;
|
|
320
|
+
carryIns = carryOuts;
|
|
321
|
+
carryOuts = swapped;
|
|
322
|
+
} else {
|
|
323
|
+
output = assignOwned(manager, output, this.mkXor(product1, product2));
|
|
324
|
+
for (let column = 2; column <= index; column++) {
|
|
325
|
+
const product3 = this.mkAnd([first[column], second[index - column]]);
|
|
326
|
+
output = this.mkXor3(product3, output, carryIns[column - 2], output);
|
|
327
|
+
this.drop(product3);
|
|
328
|
+
}
|
|
329
|
+
out.push(this.own(output));
|
|
330
|
+
}
|
|
331
|
+
this.drop(product2);
|
|
332
|
+
this.drop(product1);
|
|
333
|
+
}
|
|
334
|
+
release(manager, carryOut);
|
|
335
|
+
this.drop(output);
|
|
336
|
+
this.dropAll(carryOuts);
|
|
337
|
+
this.dropAll(carryIns);
|
|
338
|
+
}
|
|
339
|
+
|
|
340
|
+
private mkConstCaseMultiplier(first: Bits, second: Bits, out: number[]) {
|
|
341
|
+
const size = first.length;
|
|
342
|
+
let caseSize = 1;
|
|
343
|
+
const circuitSize = size * size * 5;
|
|
344
|
+
for (let index = 0; caseSize < circuitSize && index < size; index++) {
|
|
345
|
+
if (!this.isBoolConst(first[index])) caseSize *= 2;
|
|
346
|
+
if (!this.isBoolConst(second[index])) caseSize *= 2;
|
|
347
|
+
}
|
|
348
|
+
if (caseSize >= circuitSize || size >= 100) return false;
|
|
349
|
+
this.mkConstCaseMultiplierCore(true, 0, [...first], [...second], out);
|
|
350
|
+
return true;
|
|
351
|
+
}
|
|
352
|
+
|
|
353
|
+
private mkConstCaseMultiplierCore(
|
|
354
|
+
inputIsFirst: boolean,
|
|
355
|
+
start: number,
|
|
356
|
+
first: number[],
|
|
357
|
+
second: number[],
|
|
358
|
+
out: number[],
|
|
359
|
+
) {
|
|
360
|
+
const manager = this.manager;
|
|
361
|
+
const size = first.length;
|
|
362
|
+
let isFirst = inputIsFirst;
|
|
363
|
+
let index = start;
|
|
364
|
+
while (isFirst && index < size && this.isBoolConst(first[index])) index++;
|
|
365
|
+
if (isFirst && index === size) {
|
|
366
|
+
isFirst = false;
|
|
367
|
+
index = 0;
|
|
368
|
+
}
|
|
369
|
+
while (!isFirst && index < size && this.isBoolConst(second[index])) index++;
|
|
370
|
+
if (index === size) {
|
|
371
|
+
this.num2bits((this.getNumeral(first) ?? 0n) * (this.getNumeral(second) ?? 0n), size, out);
|
|
372
|
+
return;
|
|
373
|
+
}
|
|
374
|
+
const bits = isFirst ? first : second;
|
|
375
|
+
const split = this.own(bits[index]);
|
|
376
|
+
const whenTrue: number[] = [];
|
|
377
|
+
const whenFalse: number[] = [];
|
|
378
|
+
bits[index] = manager.trueExpr;
|
|
379
|
+
this.mkConstCaseMultiplierCore(isFirst, index + 1, first, second, whenTrue);
|
|
380
|
+
bits[index] = manager.falseExpr;
|
|
381
|
+
this.mkConstCaseMultiplierCore(isFirst, index + 1, first, second, whenFalse);
|
|
382
|
+
bits[index] = split;
|
|
383
|
+
let bit = -1;
|
|
384
|
+
for (let position = 0; position < size; position++) {
|
|
385
|
+
bit = assignOwned(manager, bit, this.mkIte(split, whenTrue[position], whenFalse[position]));
|
|
386
|
+
out.push(this.own(bit));
|
|
387
|
+
}
|
|
388
|
+
release(manager, bit);
|
|
389
|
+
this.drop(split);
|
|
390
|
+
this.dropAll(whenFalse);
|
|
391
|
+
this.dropAll(whenTrue);
|
|
392
|
+
}
|
|
393
|
+
|
|
394
|
+
private mkUdivUrem(first: Bits, second: Bits, quotient: number[], remainder: number[]) {
|
|
395
|
+
const manager = this.manager;
|
|
396
|
+
const size = first.length;
|
|
397
|
+
const partial = remainder;
|
|
398
|
+
partial.push(this.own(first[size - 1]));
|
|
399
|
+
for (let index = 1; index < size; index++) partial.push(this.own(manager.falseExpr));
|
|
400
|
+
for (let index = 0; index < size; index++) quotient.push(-1);
|
|
401
|
+
const difference: number[] = [];
|
|
402
|
+
for (let index = 0; index < size; index++) {
|
|
403
|
+
this.checkpoint();
|
|
404
|
+
this.dropAll(difference);
|
|
405
|
+
difference.length = 0;
|
|
406
|
+
const bit = this.mkSubtracter(partial, second, difference);
|
|
407
|
+
quotient[size - index - 1] = bit;
|
|
408
|
+
if (index < size - 1) {
|
|
409
|
+
for (let position = size - 1; position > 0; position--) {
|
|
410
|
+
const selected = this.mkIte(bit, difference[position - 1], partial[position - 1]);
|
|
411
|
+
this.drop(partial[position]);
|
|
412
|
+
partial[position] = selected;
|
|
413
|
+
}
|
|
414
|
+
this.drop(partial[0]);
|
|
415
|
+
partial[0] = this.own(first[size - index - 2]);
|
|
416
|
+
} else
|
|
417
|
+
for (let position = 0; position < size; position++) {
|
|
418
|
+
const selected = this.mkIte(bit, difference[position], partial[position]);
|
|
419
|
+
this.drop(partial[position]);
|
|
420
|
+
partial[position] = selected;
|
|
421
|
+
}
|
|
422
|
+
}
|
|
423
|
+
this.dropAll(difference);
|
|
424
|
+
}
|
|
425
|
+
|
|
426
|
+
mkUdiv(first: Bits, second: Bits, out: number[]) {
|
|
427
|
+
const remainder: number[] = [];
|
|
428
|
+
this.mkUdivUrem(first, second, out, remainder);
|
|
429
|
+
this.dropAll(remainder);
|
|
430
|
+
}
|
|
431
|
+
|
|
432
|
+
mkUrem(first: Bits, second: Bits, out: number[]) {
|
|
433
|
+
const quotient: number[] = [];
|
|
434
|
+
this.mkUdivUrem(first, second, quotient, out);
|
|
435
|
+
this.dropAll(quotient);
|
|
436
|
+
}
|
|
437
|
+
|
|
438
|
+
mkMultiplexer(condition: number, thenBits: Bits, elseBits: Bits, out: number[]) {
|
|
439
|
+
for (let index = 0; index < thenBits.length; index++)
|
|
440
|
+
out.push(this.mkIte(condition, thenBits[index], elseBits[index]));
|
|
441
|
+
}
|
|
442
|
+
|
|
443
|
+
private mkAbs(bits: Bits, out: number[]) {
|
|
444
|
+
const manager = this.manager;
|
|
445
|
+
const sign = bits[bits.length - 1];
|
|
446
|
+
if (manager.isFalse(sign)) {
|
|
447
|
+
for (const bit of bits) out.push(this.own(bit));
|
|
448
|
+
return;
|
|
449
|
+
}
|
|
450
|
+
if (manager.isTrue(sign)) {
|
|
451
|
+
this.mkNeg(bits, out);
|
|
452
|
+
return;
|
|
453
|
+
}
|
|
454
|
+
const negated: number[] = [];
|
|
455
|
+
this.mkNeg(bits, negated);
|
|
456
|
+
this.mkMultiplexer(sign, negated, bits, out);
|
|
457
|
+
this.dropAll(negated);
|
|
458
|
+
}
|
|
459
|
+
|
|
460
|
+
mkSdiv(first: Bits, second: Bits, out: number[]) {
|
|
461
|
+
const manager = this.manager;
|
|
462
|
+
const size = first.length;
|
|
463
|
+
const firstSign = first[size - 1];
|
|
464
|
+
const secondSign = second[size - 1];
|
|
465
|
+
const isFirstPositive = manager.isFalse(firstSign);
|
|
466
|
+
const isFirstNegative = manager.isTrue(firstSign);
|
|
467
|
+
const isSecondPositive = manager.isFalse(secondSign);
|
|
468
|
+
const isSecondNegative = manager.isTrue(secondSign);
|
|
469
|
+
if (isFirstPositive && isSecondPositive) {
|
|
470
|
+
this.mkUdiv(first, second, out);
|
|
471
|
+
return;
|
|
472
|
+
}
|
|
473
|
+
if ((isFirstPositive || isFirstNegative) && (isSecondPositive || isSecondNegative)) {
|
|
474
|
+
const negatedFirst: number[] = [];
|
|
475
|
+
const negatedSecond: number[] = [];
|
|
476
|
+
if (isFirstNegative) this.mkNeg(first, negatedFirst);
|
|
477
|
+
if (isSecondNegative) this.mkNeg(second, negatedSecond);
|
|
478
|
+
const dividend = isFirstNegative ? negatedFirst : first;
|
|
479
|
+
const divisor = isSecondNegative ? negatedSecond : second;
|
|
480
|
+
if (isFirstNegative && isSecondNegative) this.mkUdiv(dividend, divisor, out);
|
|
481
|
+
else {
|
|
482
|
+
const quotient: number[] = [];
|
|
483
|
+
this.mkUdiv(dividend, divisor, quotient);
|
|
484
|
+
this.mkNeg(quotient, out);
|
|
485
|
+
this.dropAll(quotient);
|
|
486
|
+
}
|
|
487
|
+
this.dropAll(negatedSecond);
|
|
488
|
+
this.dropAll(negatedFirst);
|
|
489
|
+
return;
|
|
490
|
+
}
|
|
491
|
+
const absFirst: number[] = [];
|
|
492
|
+
const absSecond: number[] = [];
|
|
493
|
+
this.mkAbs(first, absFirst);
|
|
494
|
+
this.mkAbs(second, absSecond);
|
|
495
|
+
const quotient: number[] = [];
|
|
496
|
+
this.mkUdiv(absFirst, absSecond, quotient);
|
|
497
|
+
const negatedQuotient: number[] = [];
|
|
498
|
+
this.mkNeg(quotient, negatedQuotient);
|
|
499
|
+
const isSameSign = this.mkIff(firstSign, secondSign);
|
|
500
|
+
this.mkMultiplexer(isSameSign, quotient, negatedQuotient, out);
|
|
501
|
+
this.drop(isSameSign);
|
|
502
|
+
this.dropAll(negatedQuotient);
|
|
503
|
+
this.dropAll(quotient);
|
|
504
|
+
this.dropAll(absSecond);
|
|
505
|
+
this.dropAll(absFirst);
|
|
506
|
+
}
|
|
507
|
+
|
|
508
|
+
mkSrem(first: Bits, second: Bits, out: number[]) {
|
|
509
|
+
const manager = this.manager;
|
|
510
|
+
const size = first.length;
|
|
511
|
+
const firstSign = first[size - 1];
|
|
512
|
+
const secondSign = second[size - 1];
|
|
513
|
+
const isFirstPositive = manager.isFalse(firstSign);
|
|
514
|
+
const isFirstNegative = manager.isTrue(firstSign);
|
|
515
|
+
const isSecondPositive = manager.isFalse(secondSign);
|
|
516
|
+
const isSecondNegative = manager.isTrue(secondSign);
|
|
517
|
+
if (isFirstPositive && isSecondPositive) {
|
|
518
|
+
this.mkUrem(first, second, out);
|
|
519
|
+
return;
|
|
520
|
+
}
|
|
521
|
+
if ((isFirstPositive || isFirstNegative) && (isSecondPositive || isSecondNegative)) {
|
|
522
|
+
const negatedFirst: number[] = [];
|
|
523
|
+
const negatedSecond: number[] = [];
|
|
524
|
+
if (isFirstNegative) this.mkNeg(first, negatedFirst);
|
|
525
|
+
if (isSecondNegative) this.mkNeg(second, negatedSecond);
|
|
526
|
+
const dividend = isFirstNegative ? negatedFirst : first;
|
|
527
|
+
const divisor = isSecondNegative ? negatedSecond : second;
|
|
528
|
+
if (!isFirstNegative) this.mkUrem(dividend, divisor, out);
|
|
529
|
+
else {
|
|
530
|
+
const remainder: number[] = [];
|
|
531
|
+
this.mkUrem(dividend, divisor, remainder);
|
|
532
|
+
this.mkNeg(remainder, out);
|
|
533
|
+
this.dropAll(remainder);
|
|
534
|
+
}
|
|
535
|
+
this.dropAll(negatedSecond);
|
|
536
|
+
this.dropAll(negatedFirst);
|
|
537
|
+
return;
|
|
538
|
+
}
|
|
539
|
+
const absFirst: number[] = [];
|
|
540
|
+
const absSecond: number[] = [];
|
|
541
|
+
this.mkAbs(first, absFirst);
|
|
542
|
+
this.mkAbs(second, absSecond);
|
|
543
|
+
const remainder: number[] = [];
|
|
544
|
+
const divisor = this.getNumeral(absSecond);
|
|
545
|
+
const shift =
|
|
546
|
+
divisor !== undefined && divisor > 0n && (divisor & (divisor - 1n)) === 0n
|
|
547
|
+
? divisor.toString(2).length - 1
|
|
548
|
+
: -1;
|
|
549
|
+
if (shift !== -1) this.mkZeroExtend(absFirst.slice(0, shift), size - shift, remainder);
|
|
550
|
+
else this.mkUrem(absFirst, absSecond, remainder);
|
|
551
|
+
const negatedRemainder: number[] = [];
|
|
552
|
+
this.mkNeg(remainder, negatedRemainder);
|
|
553
|
+
this.mkMultiplexer(firstSign, negatedRemainder, remainder, out);
|
|
554
|
+
this.dropAll(negatedRemainder);
|
|
555
|
+
this.dropAll(remainder);
|
|
556
|
+
this.dropAll(absSecond);
|
|
557
|
+
this.dropAll(absFirst);
|
|
558
|
+
}
|
|
559
|
+
|
|
560
|
+
mkSmod(first: Bits, second: Bits, out: number[]) {
|
|
561
|
+
const size = first.length;
|
|
562
|
+
const firstSign = first[size - 1];
|
|
563
|
+
const secondSign = second[size - 1];
|
|
564
|
+
const absFirst: number[] = [];
|
|
565
|
+
const absSecond: number[] = [];
|
|
566
|
+
this.mkAbs(first, absFirst);
|
|
567
|
+
this.mkAbs(second, absSecond);
|
|
568
|
+
const remainder: number[] = [];
|
|
569
|
+
this.mkUrem(absFirst, absSecond, remainder);
|
|
570
|
+
const negatedRemainder: number[] = [];
|
|
571
|
+
this.mkNeg(remainder, negatedRemainder);
|
|
572
|
+
const negatedPlusSecond: number[] = [];
|
|
573
|
+
this.mkAdder(negatedRemainder, second, negatedPlusSecond);
|
|
574
|
+
const remainderPlusSecond: number[] = [];
|
|
575
|
+
this.mkAdder(remainder, second, remainderPlusSecond);
|
|
576
|
+
const zero: number[] = [];
|
|
577
|
+
this.num2bits(0n, size, zero);
|
|
578
|
+
const isZero = this.mkEq(remainder, zero);
|
|
579
|
+
const negativeCase: number[] = [];
|
|
580
|
+
const positiveCase: number[] = [];
|
|
581
|
+
const body: number[] = [];
|
|
582
|
+
this.mkMultiplexer(secondSign, negatedRemainder, negatedPlusSecond, negativeCase);
|
|
583
|
+
this.mkMultiplexer(secondSign, remainderPlusSecond, remainder, positiveCase);
|
|
584
|
+
this.mkMultiplexer(firstSign, negativeCase, positiveCase, body);
|
|
585
|
+
this.mkMultiplexer(isZero, remainder, body, out);
|
|
586
|
+
this.dropAll(body);
|
|
587
|
+
this.dropAll(positiveCase);
|
|
588
|
+
this.dropAll(negativeCase);
|
|
589
|
+
this.drop(isZero);
|
|
590
|
+
this.dropAll(zero);
|
|
591
|
+
this.dropAll(remainderPlusSecond);
|
|
592
|
+
this.dropAll(negatedPlusSecond);
|
|
593
|
+
this.dropAll(negatedRemainder);
|
|
594
|
+
this.dropAll(remainder);
|
|
595
|
+
this.dropAll(absSecond);
|
|
596
|
+
this.dropAll(absFirst);
|
|
597
|
+
}
|
|
598
|
+
|
|
599
|
+
mkEq(first: Bits, second: Bits) {
|
|
600
|
+
const equivalences: number[] = [];
|
|
601
|
+
for (let index = 0; index < first.length; index++)
|
|
602
|
+
equivalences.push(this.mkIff(first[index], second[index]));
|
|
603
|
+
const result = this.mkAnd(equivalences);
|
|
604
|
+
this.dropAll(equivalences);
|
|
605
|
+
return result;
|
|
606
|
+
}
|
|
607
|
+
|
|
608
|
+
mkRotateLeft(bits: Bits, amount: number, out: number[]) {
|
|
609
|
+
const size = bits.length;
|
|
610
|
+
const shift = amount % size;
|
|
611
|
+
for (let index = size - shift; index < size; index++) out.push(this.own(bits[index]));
|
|
612
|
+
for (let index = 0; index < size - shift; index++) out.push(this.own(bits[index]));
|
|
613
|
+
}
|
|
614
|
+
|
|
615
|
+
mkRotateRight(bits: Bits, amount: number, out: number[]) {
|
|
616
|
+
this.mkRotateLeft(bits, bits.length - (amount % bits.length), out);
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
mkSignExtend(bits: Bits, amount: number, out: number[]) {
|
|
620
|
+
for (const bit of bits) out.push(this.own(bit));
|
|
621
|
+
for (let index = 0; index < amount; index++) out.push(this.own(bits[bits.length - 1]));
|
|
622
|
+
}
|
|
623
|
+
|
|
624
|
+
mkZeroExtend(bits: Bits, amount: number, out: number[]) {
|
|
625
|
+
for (const bit of bits) out.push(this.own(bit));
|
|
626
|
+
for (let index = 0; index < amount; index++) out.push(this.own(this.manager.falseExpr));
|
|
627
|
+
}
|
|
628
|
+
|
|
629
|
+
private mkShift(bits: Bits, amountBits: Bits, isLeft: boolean, fill: number, out: number[]) {
|
|
630
|
+
const manager = this.manager;
|
|
631
|
+
const size = bits.length;
|
|
632
|
+
const amount = this.getNumeral(amountBits);
|
|
633
|
+
if (amount !== undefined) {
|
|
634
|
+
const shift = amount > BigInt(size) ? size : Number(amount);
|
|
635
|
+
if (isLeft) {
|
|
636
|
+
for (let index = 0; index < shift; index++) out.push(this.own(fill));
|
|
637
|
+
for (let index = 0; index + shift < size; index++) out.push(this.own(bits[index]));
|
|
638
|
+
} else {
|
|
639
|
+
for (let index = shift; index < size; index++) out.push(this.own(bits[index]));
|
|
640
|
+
for (let index = size - shift; index < size; index++) out.push(this.own(fill));
|
|
641
|
+
}
|
|
642
|
+
return;
|
|
643
|
+
}
|
|
644
|
+
let current = bits.map((bit) => this.own(bit));
|
|
645
|
+
let stage = 0;
|
|
646
|
+
for (; stage < size; stage++) {
|
|
647
|
+
this.checkpoint();
|
|
648
|
+
const shift = 2 ** stage;
|
|
649
|
+
if (shift >= size) break;
|
|
650
|
+
const next: number[] = [];
|
|
651
|
+
for (let index = 0; index < size; index++) {
|
|
652
|
+
const source = isLeft ? index - shift : index + shift;
|
|
653
|
+
const shifted = source >= 0 && source < size ? current[source] : fill;
|
|
654
|
+
next.push(this.mkIte(amountBits[stage], shifted, current[index]));
|
|
655
|
+
}
|
|
656
|
+
this.dropAll(current);
|
|
657
|
+
current = next;
|
|
658
|
+
}
|
|
659
|
+
let isLarge = this.own(manager.falseExpr);
|
|
660
|
+
for (; stage < size; stage++)
|
|
661
|
+
isLarge = assignOwned(manager, isLarge, this.mkOr([isLarge, amountBits[stage]]));
|
|
662
|
+
for (let index = 0; index < size; index++) {
|
|
663
|
+
const selected = this.mkIte(isLarge, fill, current[index]);
|
|
664
|
+
this.drop(current[index]);
|
|
665
|
+
current[index] = selected;
|
|
666
|
+
}
|
|
667
|
+
this.drop(isLarge);
|
|
668
|
+
for (const bit of current) out.push(bit);
|
|
669
|
+
}
|
|
670
|
+
|
|
671
|
+
mkShl(bits: Bits, amountBits: Bits, out: number[]) {
|
|
672
|
+
this.mkShift(bits, amountBits, true, this.manager.falseExpr, out);
|
|
673
|
+
}
|
|
674
|
+
|
|
675
|
+
mkLshr(bits: Bits, amountBits: Bits, out: number[]) {
|
|
676
|
+
this.mkShift(bits, amountBits, false, this.manager.falseExpr, out);
|
|
677
|
+
}
|
|
678
|
+
|
|
679
|
+
mkAshr(bits: Bits, amountBits: Bits, out: number[]) {
|
|
680
|
+
this.mkShift(bits, amountBits, false, bits[bits.length - 1], out);
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
private mkExtRotate(bits: Bits, amountBits: Bits, isLeft: boolean, out: number[]) {
|
|
684
|
+
const size = bits.length;
|
|
685
|
+
const amount = this.getNumeral(amountBits);
|
|
686
|
+
if (amount !== undefined && amount < 2n ** 32n) {
|
|
687
|
+
if (isLeft) this.mkRotateLeft(bits, Number(amount % BigInt(size)), out);
|
|
688
|
+
else this.mkRotateRight(bits, Number(amount % BigInt(size)), out);
|
|
689
|
+
return;
|
|
690
|
+
}
|
|
691
|
+
let current: number[] = bits.map((bit) => this.own(bit));
|
|
692
|
+
const isPowerOfTwo = (size & (size - 1)) === 0;
|
|
693
|
+
for (let index = 0, power = 1; index < size; index++) {
|
|
694
|
+
const bit = amountBits[index];
|
|
695
|
+
if (!this.manager.isFalse(bit)) {
|
|
696
|
+
const next: number[] = [];
|
|
697
|
+
for (let position = 0; position < size; position++) {
|
|
698
|
+
const source = (isLeft ? size + position - power : position + power) % size;
|
|
699
|
+
next.push(this.mkIte(bit, current[source], current[position]));
|
|
700
|
+
}
|
|
701
|
+
this.dropAll(current);
|
|
702
|
+
current = next;
|
|
703
|
+
}
|
|
704
|
+
power *= 2;
|
|
705
|
+
if (isPowerOfTwo && size === power) break;
|
|
706
|
+
power %= size;
|
|
707
|
+
}
|
|
708
|
+
for (const bit of current) out.push(bit);
|
|
709
|
+
}
|
|
710
|
+
|
|
711
|
+
mkExtRotateLeft(bits: Bits, amountBits: Bits, out: number[]) {
|
|
712
|
+
this.mkExtRotate(bits, amountBits, true, out);
|
|
713
|
+
}
|
|
714
|
+
|
|
715
|
+
mkExtRotateRight(bits: Bits, amountBits: Bits, out: number[]) {
|
|
716
|
+
this.mkExtRotate(bits, amountBits, false, out);
|
|
717
|
+
}
|
|
718
|
+
|
|
719
|
+
private mkLe(first: Bits, second: Bits, isSigned: boolean) {
|
|
720
|
+
const size = first.length;
|
|
721
|
+
let negation = this.mkNot(first[0]);
|
|
722
|
+
let result = this.mkOr([negation, second[0]]);
|
|
723
|
+
const manager = this.manager;
|
|
724
|
+
for (let index = 1; index < (isSigned ? size - 1 : size); index++) {
|
|
725
|
+
negation = assignOwned(manager, negation, this.mkNot(first[index]));
|
|
726
|
+
result = this.mkGe2(negation, second[index], result, result);
|
|
727
|
+
}
|
|
728
|
+
if (isSigned) {
|
|
729
|
+
const negatedSign = this.mkNot(second[size - 1]);
|
|
730
|
+
result = this.mkGe2(negatedSign, first[size - 1], result, result);
|
|
731
|
+
this.drop(negatedSign);
|
|
732
|
+
}
|
|
733
|
+
this.drop(negation);
|
|
734
|
+
return result;
|
|
735
|
+
}
|
|
736
|
+
|
|
737
|
+
mkSle(first: Bits, second: Bits) {
|
|
738
|
+
return this.mkLe(first, second, true);
|
|
739
|
+
}
|
|
740
|
+
|
|
741
|
+
mkUle(first: Bits, second: Bits) {
|
|
742
|
+
return this.mkLe(first, second, false);
|
|
743
|
+
}
|
|
744
|
+
|
|
745
|
+
mkNotBits(bits: Bits, out: number[]) {
|
|
746
|
+
for (const bit of bits) out.push(this.mkNot(bit));
|
|
747
|
+
}
|
|
748
|
+
|
|
749
|
+
mkAndBits(first: Bits, second: Bits, out: number[]) {
|
|
750
|
+
for (let index = 0; index < first.length; index++)
|
|
751
|
+
out.push(this.mkAnd([first[index], second[index]]));
|
|
752
|
+
}
|
|
753
|
+
|
|
754
|
+
mkOrBits(first: Bits, second: Bits, out: number[]) {
|
|
755
|
+
for (let index = 0; index < first.length; index++)
|
|
756
|
+
out.push(this.mkOr([first[index], second[index]]));
|
|
757
|
+
}
|
|
758
|
+
|
|
759
|
+
mkXorBits(first: Bits, second: Bits, out: number[]) {
|
|
760
|
+
for (let index = 0; index < first.length; index++)
|
|
761
|
+
out.push(this.mkXor(first[index], second[index]));
|
|
762
|
+
}
|
|
763
|
+
|
|
764
|
+
mkXnorBits(first: Bits, second: Bits, out: number[]) {
|
|
765
|
+
for (let index = 0; index < first.length; index++)
|
|
766
|
+
out.push(this.mkIff(first[index], second[index]));
|
|
767
|
+
}
|
|
768
|
+
|
|
769
|
+
mkNandBits(first: Bits, second: Bits, out: number[]) {
|
|
770
|
+
for (let index = 0; index < first.length; index++)
|
|
771
|
+
out.push(this.mkNand(first[index], second[index]));
|
|
772
|
+
}
|
|
773
|
+
|
|
774
|
+
mkNorBits(first: Bits, second: Bits, out: number[]) {
|
|
775
|
+
for (let index = 0; index < first.length; index++)
|
|
776
|
+
out.push(this.mkNor(first[index], second[index]));
|
|
777
|
+
}
|
|
778
|
+
|
|
779
|
+
mkRedand(bits: Bits, out: number[]) {
|
|
780
|
+
out.push(this.mkAnd([...bits]));
|
|
781
|
+
}
|
|
782
|
+
|
|
783
|
+
mkRedor(bits: Bits, out: number[]) {
|
|
784
|
+
out.push(this.mkOr([...bits]));
|
|
785
|
+
}
|
|
786
|
+
|
|
787
|
+
mkComp(first: Bits, second: Bits, out: number[]) {
|
|
788
|
+
out.push(this.mkEq(first, second));
|
|
789
|
+
}
|
|
790
|
+
|
|
791
|
+
mkUmulNoOverflow(first: Bits, second: Bits) {
|
|
792
|
+
const manager = this.manager;
|
|
793
|
+
const size = first.length;
|
|
794
|
+
const product: number[] = [];
|
|
795
|
+
this.mkMultiplier([...first, manager.falseExpr], [...second, manager.falseExpr], product);
|
|
796
|
+
const overflow1 = this.own(product[size]);
|
|
797
|
+
let accumulated = this.own(manager.falseExpr);
|
|
798
|
+
let overflow2 = this.own(manager.falseExpr);
|
|
799
|
+
let term = -1;
|
|
800
|
+
for (let index = 1; index < size; index++) {
|
|
801
|
+
accumulated = assignOwned(
|
|
802
|
+
manager,
|
|
803
|
+
accumulated,
|
|
804
|
+
this.mkOr([accumulated, first[size - index]]),
|
|
805
|
+
);
|
|
806
|
+
term = assignOwned(manager, term, this.mkAnd([accumulated, second[index]]));
|
|
807
|
+
overflow2 = assignOwned(manager, overflow2, this.mkOr([term, overflow2]));
|
|
808
|
+
}
|
|
809
|
+
const overflow = this.mkOr([overflow1, overflow2]);
|
|
810
|
+
const result = this.mkNot(overflow);
|
|
811
|
+
release(manager, term);
|
|
812
|
+
this.drop(overflow2);
|
|
813
|
+
this.drop(accumulated);
|
|
814
|
+
this.drop(overflow);
|
|
815
|
+
this.drop(overflow1);
|
|
816
|
+
this.dropAll(product);
|
|
817
|
+
return result;
|
|
818
|
+
}
|
|
819
|
+
|
|
820
|
+
private mkSmulNoOverflowCore(first: Bits, second: Bits, isOverflow: boolean) {
|
|
821
|
+
const manager = this.manager;
|
|
822
|
+
const size = first.length;
|
|
823
|
+
const product: number[] = [];
|
|
824
|
+
this.mkMultiplier([...first, first[size - 1]], [...second, second[size - 1]], product);
|
|
825
|
+
const overflow1 = this.mkXor(product[size], product[size - 1]);
|
|
826
|
+
let term = -1;
|
|
827
|
+
let firstDiffers = -1;
|
|
828
|
+
let secondDiffers = -1;
|
|
829
|
+
let accumulated = this.own(manager.falseExpr);
|
|
830
|
+
let overflow2 = this.own(manager.falseExpr);
|
|
831
|
+
for (let index = 1; index + 1 < size; index++) {
|
|
832
|
+
secondDiffers = assignOwned(
|
|
833
|
+
manager,
|
|
834
|
+
secondDiffers,
|
|
835
|
+
this.mkXor(second[size - 1], second[index]),
|
|
836
|
+
);
|
|
837
|
+
firstDiffers = assignOwned(
|
|
838
|
+
manager,
|
|
839
|
+
firstDiffers,
|
|
840
|
+
this.mkXor(first[size - 1], first[size - 1 - index]),
|
|
841
|
+
);
|
|
842
|
+
accumulated = assignOwned(manager, accumulated, this.mkOr([firstDiffers, accumulated]));
|
|
843
|
+
term = assignOwned(manager, term, this.mkAnd([accumulated, secondDiffers]));
|
|
844
|
+
overflow2 = assignOwned(manager, overflow2, this.mkOr([term, overflow2]));
|
|
845
|
+
}
|
|
846
|
+
let overflow = this.mkOr([overflow1, overflow2]);
|
|
847
|
+
const sign = isOverflow
|
|
848
|
+
? this.mkIff(first[size - 1], second[size - 1])
|
|
849
|
+
: this.mkXor(first[size - 1], second[size - 1]);
|
|
850
|
+
overflow = assignOwned(manager, overflow, this.mkAnd([sign, overflow]));
|
|
851
|
+
const result = this.mkNot(overflow);
|
|
852
|
+
this.drop(sign);
|
|
853
|
+
this.drop(accumulated);
|
|
854
|
+
release(manager, secondDiffers);
|
|
855
|
+
release(manager, firstDiffers);
|
|
856
|
+
release(manager, term);
|
|
857
|
+
this.drop(overflow2);
|
|
858
|
+
this.drop(overflow);
|
|
859
|
+
this.drop(overflow1);
|
|
860
|
+
this.dropAll(product);
|
|
861
|
+
return result;
|
|
862
|
+
}
|
|
863
|
+
|
|
864
|
+
mkSmulNoOverflow(first: Bits, second: Bits) {
|
|
865
|
+
return this.mkSmulNoOverflowCore(first, second, true);
|
|
866
|
+
}
|
|
867
|
+
|
|
868
|
+
mkSmulNoUnderflow(first: Bits, second: Bits) {
|
|
869
|
+
return this.mkSmulNoOverflowCore(first, second, false);
|
|
870
|
+
}
|
|
871
|
+
}
|