tla-ts 0.0.9 → 0.0.10
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +72 -10
- package/dist/index.d.ts +72 -10
- 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 +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +128 -103
- package/dist/transfer.js +128 -103
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +7 -21
- package/src/bags.ts +99 -99
- package/src/builtins.ts +44 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +576 -300
- package/src/cli/options.ts +11 -6
- package/src/cli/run.ts +2 -2
- package/src/cli/runtime-invariants.ts +135 -0
- package/src/cli/shared.ts +20 -9
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +646 -0
- package/src/cli/tlc-usage.ts +362 -0
- package/src/cli/tlc.ts +538 -220
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +630 -297
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +2 -12
- package/src/json-reader.ts +456 -0
- package/src/json.ts +262 -139
- package/src/levels.ts +2 -3
- package/src/lexer.ts +17 -26
- package/src/liveness-checker.ts +10 -18
- package/src/liveness.ts +121 -49
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +29 -39
- package/src/parallel.ts +29 -13
- package/src/parser.ts +436 -90
- package/src/pcal/ast.ts +7 -28
- package/src/pcal/parse.ts +11 -39
- package/src/pcal/tokenize.ts +4 -20
- package/src/pcal/translate.ts +10 -42
- package/src/pcal/validate.ts +3 -21
- package/src/pretty-print.ts +1 -2
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +84 -35
- package/src/resolve.ts +18 -60
- package/src/runtime.ts +11 -4
- package/src/sany/builtins.ts +3 -4
- package/src/sany/generator.ts +119 -169
- package/src/sany/levels.ts +6 -30
- package/src/sany/lexer.ts +7 -23
- package/src/sany/linter.ts +1 -8
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +494 -154
- package/src/simulate.ts +694 -0
- package/src/spec-description.ts +166 -48
- package/src/standard-definitions.ts +2 -3
- package/src/standard-modules.ts +264 -68
- package/src/state-graph.ts +51 -18
- package/src/subexpressions.ts +31 -5
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +267 -77
- package/src/symmetry.ts +31 -8
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -61
- package/src/tlc/jar-data.ts +113 -6
- package/src/tlc/messages.ts +122 -37
- package/src/tlc/order.ts +33 -38
- package/src/tlc/random.ts +16 -16
- package/src/tlc/replay.ts +563 -211
- package/src/tlc/summary.ts +2 -4
- package/src/tlc/tlc-operators.ts +81 -36
- package/src/tlc/tlcext-operators.ts +138 -117
- package/src/tlc/trace-spec.ts +273 -0
- package/src/tlc/value-stream.ts +143 -0
- package/src/tlc/version.ts +2 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +826 -276
- package/src/worker.ts +7 -8
|
@@ -1,15 +1,11 @@
|
|
|
1
1
|
// Ported from Z3 (src/math/polynomial/upolynomial.{h,cpp}, src/util/mpzzp.h,
|
|
2
|
-
// src/math/polynomial/polynomial_primes.h), MIT license, see z3-license.txt.
|
|
3
|
-
// polynomials with integer coefficients, as coefficient arrays from the constant term up with no
|
|
4
|
-
// leading zeros, over Z or over Z_p. Root isolation by Descartes' rule of signs, Sturm sequences
|
|
5
|
-
// and refinement of isolating intervals with binary rational endpoints.
|
|
2
|
+
// src/math/polynomial/polynomial_primes.h), MIT license, see z3-license.txt.
|
|
6
3
|
import { SmtInvariantError } from "../../../../errors";
|
|
7
4
|
import { getGcd, Rational } from "../rational";
|
|
8
5
|
import { getLog2, Mpbq, refineLower, refineUpper } from "./mpbq";
|
|
9
6
|
|
|
10
7
|
export type Upolynomial = readonly bigint[];
|
|
11
8
|
|
|
12
|
-
// g_big_primes: the primes mod_gcd tries, in order.
|
|
13
9
|
const BIG_PRIMES = [
|
|
14
10
|
39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217,
|
|
15
11
|
39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359,
|
|
@@ -30,15 +26,13 @@ const BIG_PRIMES = [
|
|
|
30
26
|
41507, 41513, 41519, 41521, 41539, 41543, 41549,
|
|
31
27
|
].map(BigInt);
|
|
32
28
|
|
|
33
|
-
const
|
|
29
|
+
const getSign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
|
|
34
30
|
|
|
35
|
-
|
|
36
|
-
const floorDiv = (dividend: bigint, divisor: bigint) => {
|
|
31
|
+
export const floorDiv = (dividend: bigint, divisor: bigint) => {
|
|
37
32
|
const quotient = dividend / divisor;
|
|
38
33
|
return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
|
|
39
34
|
};
|
|
40
35
|
|
|
41
|
-
// mpz gcd(a, b, x, y, g): a*x + b*y = g.
|
|
42
36
|
const getExtendedGcd = (first: bigint, second: bigint) => {
|
|
43
37
|
let [oldR, r] = [first, second];
|
|
44
38
|
let [oldS, s] = [1n, 0n];
|
|
@@ -65,7 +59,6 @@ interface IsolatedRoots {
|
|
|
65
59
|
uppers: Mpbq[];
|
|
66
60
|
}
|
|
67
61
|
|
|
68
|
-
// An interval (a, b) refined around the root of a square-free polynomial, or the root itself.
|
|
69
62
|
interface Refinement {
|
|
70
63
|
isInterval: boolean;
|
|
71
64
|
lower: Mpbq;
|
|
@@ -80,8 +73,6 @@ interface DrsFrame {
|
|
|
80
73
|
}
|
|
81
74
|
|
|
82
75
|
export class UpolynomialManager {
|
|
83
|
-
// Z_p when set, else Z. Coefficients over Z_p lie in the symmetric range around zero. Hensel
|
|
84
|
-
// lifting also sets a prime power.
|
|
85
76
|
private isPrimeModulus = true;
|
|
86
77
|
|
|
87
78
|
constructor(private modulus: bigint | null = null) {}
|
|
@@ -90,25 +81,21 @@ export class UpolynomialManager {
|
|
|
90
81
|
return this.modulus;
|
|
91
82
|
}
|
|
92
83
|
|
|
93
|
-
// field: Z_p for a prime p. Over a prime power, division falls back to pseudo-division.
|
|
94
84
|
private get isField() {
|
|
95
85
|
return this.modulus !== null && this.isPrimeModulus;
|
|
96
86
|
}
|
|
97
87
|
|
|
98
|
-
// set_zp
|
|
99
88
|
setZp(prime: bigint) {
|
|
100
89
|
this.modulus = prime;
|
|
101
90
|
this.isPrimeModulus = true;
|
|
102
91
|
}
|
|
103
92
|
|
|
104
|
-
// set_p_sq: from Z_m to Z_(m^2).
|
|
105
93
|
squareModulus() {
|
|
106
94
|
if (this.modulus === null) throw new SmtInvariantError("squaring the modulus of Z");
|
|
107
95
|
this.modulus *= this.modulus;
|
|
108
96
|
this.isPrimeModulus = false;
|
|
109
97
|
}
|
|
110
98
|
|
|
111
|
-
// scoped_set_zp
|
|
112
99
|
withZp<T>(prime: bigint, body: () => T) {
|
|
113
100
|
const savedModulus = this.modulus;
|
|
114
101
|
const savedIsPrime = this.isPrimeModulus;
|
|
@@ -119,9 +106,6 @@ export class UpolynomialManager {
|
|
|
119
106
|
return result;
|
|
120
107
|
}
|
|
121
108
|
|
|
122
|
-
// Numerals.
|
|
123
|
-
|
|
124
|
-
// p_normalize
|
|
125
109
|
normalizeNumeral(value: bigint) {
|
|
126
110
|
const modulus = this.modulus;
|
|
127
111
|
if (modulus === null) return value;
|
|
@@ -137,7 +121,6 @@ export class UpolynomialManager {
|
|
|
137
121
|
return this.normalizeNumeral(getExtendedGcd(this.normalizeNumeral(value), modulus).x);
|
|
138
122
|
}
|
|
139
123
|
|
|
140
|
-
// mpzzp div: exact over Z (rounding toward minus infinity), multiplication by the inverse over Z_p.
|
|
141
124
|
private divNumeral(dividend: bigint, divisor: bigint) {
|
|
142
125
|
return this.modulus === null
|
|
143
126
|
? floorDiv(dividend, divisor)
|
|
@@ -149,13 +132,10 @@ export class UpolynomialManager {
|
|
|
149
132
|
return divisor === 0n ? dividend === 0n : dividend % divisor === 0n;
|
|
150
133
|
}
|
|
151
134
|
|
|
152
|
-
// set: the coefficients reduced to the current ring.
|
|
153
135
|
set(coeffs: Upolynomial) {
|
|
154
136
|
return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff)));
|
|
155
137
|
}
|
|
156
138
|
|
|
157
|
-
// Core operations.
|
|
158
|
-
|
|
159
139
|
getContent(coeffs: Upolynomial) {
|
|
160
140
|
let content = 0n;
|
|
161
141
|
for (const coeff of coeffs) content = getGcd(content, coeff);
|
|
@@ -208,7 +188,6 @@ export class UpolynomialManager {
|
|
|
208
188
|
return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff * factor)));
|
|
209
189
|
}
|
|
210
190
|
|
|
211
|
-
// div(p, b): each coefficient divided by b, which divides it.
|
|
212
191
|
divConst(coeffs: Upolynomial, divisor: bigint) {
|
|
213
192
|
if (divisor === 1n) return [...coeffs];
|
|
214
193
|
return trim(coeffs.map((coeff) => this.divNumeral(coeff, divisor)));
|
|
@@ -221,7 +200,6 @@ export class UpolynomialManager {
|
|
|
221
200
|
);
|
|
222
201
|
}
|
|
223
202
|
|
|
224
|
-
// normalize: the coefficients divided by their gcd, or the sign of a constant.
|
|
225
203
|
normalize(coeffs: Upolynomial) {
|
|
226
204
|
if (coeffs.length === 0) return [];
|
|
227
205
|
if (coeffs.length === 1) return [coeffs[0] > 0n ? 1n : this.normalizeNumeral(-1n)];
|
|
@@ -234,7 +212,6 @@ export class UpolynomialManager {
|
|
|
234
212
|
return coeffs.length > 0 && coeffs[coeffs.length - 1] < 0n ? this.neg(coeffs) : [...coeffs];
|
|
235
213
|
}
|
|
236
214
|
|
|
237
|
-
// mk_monic: the polynomial divided by its leading coefficient, over Z_p.
|
|
238
215
|
mkMonic(coeffs: Upolynomial) {
|
|
239
216
|
if (coeffs.length === 0 || coeffs[coeffs.length - 1] === 1n) return [...coeffs];
|
|
240
217
|
const inverse = this.inv(coeffs[coeffs.length - 1]);
|
|
@@ -243,7 +220,6 @@ export class UpolynomialManager {
|
|
|
243
220
|
);
|
|
244
221
|
}
|
|
245
222
|
|
|
246
|
-
// div_rem: q and r with lc(p2)^d * p1 = q * p2 + r over Z, or p1 = q * p2 + r over a field.
|
|
247
223
|
divRem(dividend: Upolynomial, divisor: Upolynomial) {
|
|
248
224
|
const isField = this.isField;
|
|
249
225
|
if (divisor.length === 1) {
|
|
@@ -290,7 +266,6 @@ export class UpolynomialManager {
|
|
|
290
266
|
return this.divRem(dividend, divisor).quotient;
|
|
291
267
|
}
|
|
292
268
|
|
|
293
|
-
// rem: the pseudo-remainder, with the number of pseudo-division steps.
|
|
294
269
|
remWithPower(dividend: Upolynomial, divisor: Upolynomial) {
|
|
295
270
|
if (divisor.length === 1) return { remainder: [] as bigint[], power: 0 };
|
|
296
271
|
const remainder = this.set(dividend);
|
|
@@ -327,8 +302,6 @@ export class UpolynomialManager {
|
|
|
327
302
|
return this.remWithPower(dividend, divisor).remainder;
|
|
328
303
|
}
|
|
329
304
|
|
|
330
|
-
// srem: the signed pseudo-remainder, negated unless an odd number of steps by a negative leading
|
|
331
|
-
// coefficient already flipped it.
|
|
332
305
|
srem(dividend: Upolynomial, divisor: Upolynomial) {
|
|
333
306
|
const result = this.remWithPower(dividend, divisor);
|
|
334
307
|
return result.power % 2 === 0 || (divisor.length > 0 && divisor[divisor.length - 1] > 0n)
|
|
@@ -336,7 +309,6 @@ export class UpolynomialManager {
|
|
|
336
309
|
: result.remainder;
|
|
337
310
|
}
|
|
338
311
|
|
|
339
|
-
// divides: whether divisor divides dividend, checking only the leading coefficients.
|
|
340
312
|
divides(dividend: Upolynomial, divisor: Upolynomial) {
|
|
341
313
|
if (divisor.length === 0) return false;
|
|
342
314
|
if (dividend.length === 0) return true;
|
|
@@ -356,7 +328,6 @@ export class UpolynomialManager {
|
|
|
356
328
|
return true;
|
|
357
329
|
}
|
|
358
330
|
|
|
359
|
-
// exact_div: dividend / divisor when the division is exact, else null.
|
|
360
331
|
exactDiv(dividend: Upolynomial, divisor: Upolynomial): bigint[] | null {
|
|
361
332
|
if (divisor.length === 0) return null;
|
|
362
333
|
if (dividend.length === 0) return [];
|
|
@@ -383,8 +354,6 @@ export class UpolynomialManager {
|
|
|
383
354
|
return trim(result);
|
|
384
355
|
}
|
|
385
356
|
|
|
386
|
-
// GCD.
|
|
387
|
-
|
|
388
357
|
private euclidGcd(first: Upolynomial, second: Upolynomial) {
|
|
389
358
|
if (first.length === 0) return this.flipSignIfLmNeg(this.set(second));
|
|
390
359
|
if (second.length === 0) return this.flipSignIfLmNeg(this.set(first));
|
|
@@ -399,7 +368,6 @@ export class UpolynomialManager {
|
|
|
399
368
|
return this.isField ? this.mkMonic(normalized) : this.flipSignIfLmNeg(normalized);
|
|
400
369
|
}
|
|
401
370
|
|
|
402
|
-
// CRA_combine_images: the image modulo bound * prime, in the symmetric range.
|
|
403
371
|
private combineImages(image: Upolynomial, prime: bigint, combined: Upolynomial, bound: bigint) {
|
|
404
372
|
const inverses = getExtendedGcd(prime, bound);
|
|
405
373
|
const mod = (value: bigint, modulus: bigint) => ((value % modulus) + modulus) % modulus;
|
|
@@ -421,7 +389,6 @@ export class UpolynomialManager {
|
|
|
421
389
|
return { coeffs: result, bound: newBound };
|
|
422
390
|
}
|
|
423
391
|
|
|
424
|
-
// mod_gcd: the gcd over Z from images modulo big primes, combined by the Chinese remainder theorem.
|
|
425
392
|
private modGcd(first: Upolynomial, second: Upolynomial) {
|
|
426
393
|
const contentU = this.getContent(first);
|
|
427
394
|
const contentV = this.getContent(second);
|
|
@@ -442,8 +409,6 @@ export class UpolynomialManager {
|
|
|
442
409
|
});
|
|
443
410
|
if (image === null) continue;
|
|
444
411
|
if (image.length <= 1) return [contentG];
|
|
445
|
-
// The first image, or one of lower degree, replaces the accumulated image. Before the first
|
|
446
|
-
// image the bound is zero, which is even.
|
|
447
412
|
if (image.length < combined.length || bound % 2n === 0n) {
|
|
448
413
|
combined = image;
|
|
449
414
|
bound = prime;
|
|
@@ -469,7 +434,6 @@ export class UpolynomialManager {
|
|
|
469
434
|
return this.modulus === null ? this.modGcd(first, second) : this.euclidGcd(first, second);
|
|
470
435
|
}
|
|
471
436
|
|
|
472
|
-
// square_free: p divided by gcd(p, p'), normalized.
|
|
473
437
|
squareFree(coeffs: Upolynomial) {
|
|
474
438
|
if (coeffs.length <= 1) return this.set(coeffs);
|
|
475
439
|
const common = this.gcd(coeffs, this.derivative(coeffs));
|
|
@@ -487,7 +451,6 @@ export class UpolynomialManager {
|
|
|
487
451
|
return result;
|
|
488
452
|
}
|
|
489
453
|
|
|
490
|
-
// ext_gcd over Z_p: u, v and the monic d with a*u + b*v = d.
|
|
491
454
|
extGcd(first: Upolynomial, second: Upolynomial) {
|
|
492
455
|
let u: bigint[] = [1n];
|
|
493
456
|
let d = this.mkMonic(this.set(first));
|
|
@@ -511,8 +474,6 @@ export class UpolynomialManager {
|
|
|
511
474
|
};
|
|
512
475
|
}
|
|
513
476
|
|
|
514
|
-
// Transformations.
|
|
515
|
-
|
|
516
477
|
hasZeroRoots(coeffs: Upolynomial) {
|
|
517
478
|
return coeffs.length > 0 && coeffs[0] === 0n;
|
|
518
479
|
}
|
|
@@ -523,7 +484,6 @@ export class UpolynomialManager {
|
|
|
523
484
|
return coeffs.slice(index);
|
|
524
485
|
}
|
|
525
486
|
|
|
526
|
-
// has_one_half_root: 2^n * p(1/2) = 0.
|
|
527
487
|
private hasOneHalfRoot(coeffs: Upolynomial) {
|
|
528
488
|
if (coeffs.length === 0) return true;
|
|
529
489
|
if (coeffs.length === 1) return false;
|
|
@@ -533,7 +493,6 @@ export class UpolynomialManager {
|
|
|
533
493
|
return result === 0n;
|
|
534
494
|
}
|
|
535
495
|
|
|
536
|
-
// descartes_bound_0_1: the sign changes of (x+1)^n p(1/(x+1)), stopping above 1.
|
|
537
496
|
private descartesBound01(coeffs: Upolynomial) {
|
|
538
497
|
if (coeffs.length <= 1) return 0;
|
|
539
498
|
const work = [...coeffs];
|
|
@@ -542,7 +501,7 @@ export class UpolynomialManager {
|
|
|
542
501
|
for (let index = 0; index < work.length; index++) {
|
|
543
502
|
let position = 1;
|
|
544
503
|
for (; position < work.length - index; position++) work[position] += work[position - 1];
|
|
545
|
-
const current =
|
|
504
|
+
const current = getSign(work[position - 1]);
|
|
546
505
|
if (current === 0) continue;
|
|
547
506
|
if (current !== previous && previous !== 0) {
|
|
548
507
|
changes++;
|
|
@@ -553,7 +512,6 @@ export class UpolynomialManager {
|
|
|
553
512
|
return changes;
|
|
554
513
|
}
|
|
555
514
|
|
|
556
|
-
// translate: p(x + 1).
|
|
557
515
|
translate(coeffs: Upolynomial) {
|
|
558
516
|
const result = [...coeffs];
|
|
559
517
|
const degree = result.length - 1;
|
|
@@ -563,7 +521,6 @@ export class UpolynomialManager {
|
|
|
563
521
|
return result;
|
|
564
522
|
}
|
|
565
523
|
|
|
566
|
-
// translate_q: den^n * p(x + q).
|
|
567
524
|
translateQ(coeffs: Upolynomial, value: Rational) {
|
|
568
525
|
if (coeffs.length <= 1) return [...coeffs];
|
|
569
526
|
const result = this.composeAnPxDivA(coeffs, value.den);
|
|
@@ -577,28 +534,23 @@ export class UpolynomialManager {
|
|
|
577
534
|
return result;
|
|
578
535
|
}
|
|
579
536
|
|
|
580
|
-
// compose_2n_p_x_div_2: 2^n * p(x/2).
|
|
581
537
|
private compose2nPxDiv2(coeffs: Upolynomial) {
|
|
582
538
|
const degree = coeffs.length - 1;
|
|
583
539
|
return coeffs.map((coeff, index) => coeff << BigInt(degree - index));
|
|
584
540
|
}
|
|
585
541
|
|
|
586
|
-
// p_minus_x: p(-x).
|
|
587
542
|
pMinusX(coeffs: Upolynomial) {
|
|
588
543
|
return coeffs.map((coeff, index) => (index % 2 === 1 && coeff !== 0n ? -coeff : coeff));
|
|
589
544
|
}
|
|
590
545
|
|
|
591
|
-
// p_1_div_x: x^n * p(1/x).
|
|
592
546
|
p1DivX(coeffs: Upolynomial) {
|
|
593
547
|
return [...coeffs].reverse();
|
|
594
548
|
}
|
|
595
549
|
|
|
596
|
-
// compose_p_2k_x: p(2^k * x).
|
|
597
550
|
private composeP2kX(coeffs: Upolynomial, k: number) {
|
|
598
551
|
return coeffs.map((coeff, index) => coeff << BigInt(k * index));
|
|
599
552
|
}
|
|
600
553
|
|
|
601
|
-
// compose_an_p_x_div_a: a^n * p(x/a).
|
|
602
554
|
private composeAnPxDivA(coeffs: Upolynomial, factor: bigint) {
|
|
603
555
|
const degree = coeffs.length - 1;
|
|
604
556
|
return coeffs.map((coeff, index) =>
|
|
@@ -606,7 +558,6 @@ export class UpolynomialManager {
|
|
|
606
558
|
);
|
|
607
559
|
}
|
|
608
560
|
|
|
609
|
-
// compose_p_q_x: c^n * p(b*x/c) for q = b/c.
|
|
610
561
|
composePQX(coeffs: Upolynomial, value: Rational) {
|
|
611
562
|
const degree = coeffs.length - 1;
|
|
612
563
|
return coeffs.map((coeff, index) =>
|
|
@@ -614,12 +565,9 @@ export class UpolynomialManager {
|
|
|
614
565
|
);
|
|
615
566
|
}
|
|
616
567
|
|
|
617
|
-
// Signs.
|
|
618
|
-
|
|
619
|
-
// eval_sign_at for a binary rational: the sign of (2^k)^n * p(b).
|
|
620
568
|
evalSignAtBq(coeffs: Upolynomial, value: Mpbq) {
|
|
621
569
|
if (coeffs.length === 0) return 0;
|
|
622
|
-
if (coeffs.length === 1) return
|
|
570
|
+
if (coeffs.length === 1) return getSign(coeffs[0]);
|
|
623
571
|
let result = coeffs[coeffs.length - 1];
|
|
624
572
|
let shift = value.k;
|
|
625
573
|
for (let index = coeffs.length - 2; index >= 0; index--, shift += value.k)
|
|
@@ -627,12 +575,12 @@ export class UpolynomialManager {
|
|
|
627
575
|
coeffs[index] === 0n
|
|
628
576
|
? result * value.num
|
|
629
577
|
: (coeffs[index] << BigInt(shift)) + result * value.num;
|
|
630
|
-
return
|
|
578
|
+
return getSign(result);
|
|
631
579
|
}
|
|
632
580
|
|
|
633
581
|
evalSignAtQ(coeffs: Upolynomial, value: Rational) {
|
|
634
582
|
if (coeffs.length === 0) return 0;
|
|
635
|
-
if (coeffs.length === 1) return
|
|
583
|
+
if (coeffs.length === 1) return getSign(coeffs[0]);
|
|
636
584
|
let result = coeffs[coeffs.length - 1];
|
|
637
585
|
let denominator = value.den;
|
|
638
586
|
for (let index = coeffs.length - 2; index >= 0; index--, denominator *= value.den)
|
|
@@ -640,20 +588,20 @@ export class UpolynomialManager {
|
|
|
640
588
|
coeffs[index] === 0n
|
|
641
589
|
? result * value.num
|
|
642
590
|
: coeffs[index] * denominator + result * value.num;
|
|
643
|
-
return
|
|
591
|
+
return getSign(result);
|
|
644
592
|
}
|
|
645
593
|
|
|
646
594
|
evalSignAtZero(coeffs: Upolynomial) {
|
|
647
|
-
return coeffs.length === 0 ? 0 :
|
|
595
|
+
return coeffs.length === 0 ? 0 : getSign(coeffs[0]);
|
|
648
596
|
}
|
|
649
597
|
|
|
650
598
|
evalSignAtPlusInf(coeffs: Upolynomial) {
|
|
651
|
-
return coeffs.length === 0 ? 0 :
|
|
599
|
+
return coeffs.length === 0 ? 0 : getSign(coeffs[coeffs.length - 1]);
|
|
652
600
|
}
|
|
653
601
|
|
|
654
602
|
evalSignAtMinusInf(coeffs: Upolynomial) {
|
|
655
603
|
if (coeffs.length === 0) return 0;
|
|
656
|
-
const leading =
|
|
604
|
+
const leading = getSign(coeffs[coeffs.length - 1]);
|
|
657
605
|
return (coeffs.length - 1) % 2 === 0 ? leading : -leading;
|
|
658
606
|
}
|
|
659
607
|
|
|
@@ -685,9 +633,6 @@ export class UpolynomialManager {
|
|
|
685
633
|
return this.countSignVariations(sequence.map((coeffs) => this.evalSignAtBq(coeffs, value)));
|
|
686
634
|
}
|
|
687
635
|
|
|
688
|
-
// Root bounds.
|
|
689
|
-
|
|
690
|
-
// knuth_positive_root_upper_bound: k with every positive root below 2^k.
|
|
691
636
|
knuthPositiveRootUpperBound(coeffs: Upolynomial) {
|
|
692
637
|
if (coeffs.length === 0) return 0;
|
|
693
638
|
let max = 0;
|
|
@@ -710,7 +655,6 @@ export class UpolynomialManager {
|
|
|
710
655
|
return this.knuthPositiveRootUpperBound(this.pMinusX(coeffs));
|
|
711
656
|
}
|
|
712
657
|
|
|
713
|
-
// nonzero_root_lower_bound: k with every nonzero root of absolute value above 1/2^k.
|
|
714
658
|
nonzeroRootLowerBound(coeffs: Upolynomial) {
|
|
715
659
|
const reversed = this.removeZeroRoots(coeffs).reverse();
|
|
716
660
|
return Math.max(
|
|
@@ -719,9 +663,6 @@ export class UpolynomialManager {
|
|
|
719
663
|
);
|
|
720
664
|
}
|
|
721
665
|
|
|
722
|
-
// Root isolation by Descartes' rule of signs.
|
|
723
|
-
|
|
724
|
-
// push_child_frames: the halves (0, 1/2) and (1/2, 1), as 2^n p(x/2) and its translation.
|
|
725
666
|
private pushChildFrames(coeffs: Upolynomial, frames: DrsFrame[]) {
|
|
726
667
|
const parent = frames.length - 1;
|
|
727
668
|
const left = this.normalize(this.compose2nPxDiv2(coeffs));
|
|
@@ -734,7 +675,6 @@ export class UpolynomialManager {
|
|
|
734
675
|
});
|
|
735
676
|
}
|
|
736
677
|
|
|
737
|
-
// The interval (0, 1), or the point 1/2, of the top frame mapped back through its ancestors.
|
|
738
678
|
private mapToRoot(frames: DrsFrame[], value: Mpbq) {
|
|
739
679
|
let result = value;
|
|
740
680
|
for (let index = frames.length - 1; index !== -1; index = frames[index].parent)
|
|
@@ -782,8 +722,6 @@ export class UpolynomialManager {
|
|
|
782
722
|
}
|
|
783
723
|
}
|
|
784
724
|
|
|
785
|
-
// drs_isolate_roots: the positive roots in (0, 2^k) and the negative ones in (-2^k', 0), each
|
|
786
|
-
// found as the roots in (0, 1) of p(2^k x) or p(-2^k' x) and scaled back.
|
|
787
725
|
private drsIsolateRoots(coeffs: Upolynomial, result: IsolatedRoots) {
|
|
788
726
|
const normalized = this.normalize(coeffs);
|
|
789
727
|
const negativeK = this.knuthNegativeRootUpperBound(coeffs);
|
|
@@ -812,8 +750,6 @@ export class UpolynomialManager {
|
|
|
812
750
|
}
|
|
813
751
|
}
|
|
814
752
|
|
|
815
|
-
// sqf_isolate_roots: the roots of a square-free polynomial, exact roots first when zero is one,
|
|
816
|
-
// then the isolating intervals of the others.
|
|
817
753
|
sqfIsolateRoots(coeffs: Upolynomial): IsolatedRoots {
|
|
818
754
|
const result: IsolatedRoots = { roots: [], lowers: [], uppers: [] };
|
|
819
755
|
if (this.hasZeroRoots(coeffs)) {
|
|
@@ -823,8 +759,6 @@ export class UpolynomialManager {
|
|
|
823
759
|
return result;
|
|
824
760
|
}
|
|
825
761
|
|
|
826
|
-
// Sturm sequences.
|
|
827
|
-
|
|
828
762
|
private sturmSeqCore(sequence: bigint[][]) {
|
|
829
763
|
while (true) {
|
|
830
764
|
const remainder = this.srem(sequence[sequence.length - 2], sequence[sequence.length - 1]);
|
|
@@ -841,10 +775,6 @@ export class UpolynomialManager {
|
|
|
841
775
|
return this.sturmSeqCore([[...first], this.mul(this.derivative(first), second)]);
|
|
842
776
|
}
|
|
843
777
|
|
|
844
|
-
// Refinement.
|
|
845
|
-
|
|
846
|
-
// isolating2refinable: an isolating interval of a square-free polynomial turned into one whose
|
|
847
|
-
// endpoint signs differ, or the root it contains.
|
|
848
778
|
isolating2refinable(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq): Refinement {
|
|
849
779
|
const signLower = this.evalSignAtBq(coeffs, lower);
|
|
850
780
|
const signUpper = this.evalSignAtBq(coeffs, upper);
|
|
@@ -897,7 +827,6 @@ export class UpolynomialManager {
|
|
|
897
827
|
}
|
|
898
828
|
}
|
|
899
829
|
|
|
900
|
-
// refine_core: one bisection of a refinable interval, or the root at its midpoint.
|
|
901
830
|
refineCore(coeffs: Upolynomial, signLower: number, lower: Mpbq, upper: Mpbq): Refinement {
|
|
902
831
|
const middle = lower.add(upper).div2();
|
|
903
832
|
const signMiddle = this.evalSignAtBq(coeffs, middle);
|
|
@@ -907,11 +836,6 @@ export class UpolynomialManager {
|
|
|
907
836
|
: { isInterval: true, lower, upper: middle };
|
|
908
837
|
}
|
|
909
838
|
|
|
910
|
-
refine(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq) {
|
|
911
|
-
return this.refineCore(coeffs, this.evalSignAtBq(coeffs, lower), lower, upper);
|
|
912
|
-
}
|
|
913
|
-
|
|
914
|
-
// refine_core with a precision: bisects until the interval is narrower than 1/2^k.
|
|
915
839
|
refineToPrecision(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, precision: number): Refinement {
|
|
916
840
|
const signLower = this.evalSignAtBq(coeffs, lower);
|
|
917
841
|
let current: Refinement = { isInterval: true, lower, upper };
|
|
@@ -922,8 +846,6 @@ export class UpolynomialManager {
|
|
|
922
846
|
}
|
|
923
847
|
}
|
|
924
848
|
|
|
925
|
-
// convert_q2bq_interval: a rational isolating interval (a, b) as a binary rational one (c, d), or
|
|
926
|
-
// the root itself in c.
|
|
927
849
|
convertQ2bqInterval(coeffs: Upolynomial, a: Rational, b: Rational): Refinement {
|
|
928
850
|
const signA = this.evalSignAtQ(coeffs, a);
|
|
929
851
|
const signB = this.evalSignAtQ(coeffs, b);
|
|
@@ -978,8 +900,6 @@ export class UpolynomialManager {
|
|
|
978
900
|
}
|
|
979
901
|
}
|
|
980
902
|
|
|
981
|
-
// normalize_interval_core: a refinable interval around zero shrunk to the side of zero holding
|
|
982
|
-
// the root, given the sign at its lower end. Null when zero is the root.
|
|
983
903
|
normalizeInterval(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, signLower: number) {
|
|
984
904
|
if (!(lower.isNeg && upper.isPos)) return { lower, upper };
|
|
985
905
|
if (this.hasZeroRoots(coeffs)) return null;
|
|
@@ -988,7 +908,6 @@ export class UpolynomialManager {
|
|
|
988
908
|
: { lower, upper: Mpbq.zero };
|
|
989
909
|
}
|
|
990
910
|
|
|
991
|
-
// get_root_id: the number of roots up to l.
|
|
992
911
|
getRootId(coeffs: Upolynomial, lower: Mpbq) {
|
|
993
912
|
const sequence = this.sturmSeq(coeffs);
|
|
994
913
|
return this.signVariationsAtMinusInf(sequence) - this.signVariationsAt(sequence, lower);
|
|
@@ -1,13 +1,7 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/normal_forms/nnf.cpp, name_exprs.cpp, defined_names.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt. Negation normal form in Z3's default NNF_SKOLEM mode: only subformulas that
|
|
3
|
-
// contain quantifiers are normalized, and existential quantifiers in positive positions become
|
|
4
|
-
// Skolem functions of the enclosing universal variables. A quantifier inside an atom gets a name, a
|
|
5
|
-
// fresh predicate over its free variables, with a definition that is normalized too. Like Z3, the
|
|
6
|
-
// frames, the result stack and the caches hold their expressions, so that expressions are created
|
|
7
|
-
// and deleted in Z3's order.
|
|
1
|
+
// Ported from Z3 (src/ast/normal_forms/nnf.cpp, name_exprs.cpp, defined_names.cpp), MIT license, see z3-license.txt.
|
|
8
2
|
import { ActCache } from "./act-cache";
|
|
9
3
|
import {
|
|
10
|
-
AstManager,
|
|
4
|
+
type AstManager,
|
|
11
5
|
KIND_APP,
|
|
12
6
|
KIND_QUANTIFIER,
|
|
13
7
|
KIND_VAR,
|
|
@@ -25,7 +19,6 @@ import { RefVector } from "./ref-vector";
|
|
|
25
19
|
import { RewriterTpl } from "./rewriter-tpl";
|
|
26
20
|
import { elimUnusedVars, getFreeVarSorts, VarSubst } from "./var-subst";
|
|
27
21
|
|
|
28
|
-
// defined_names: the name of each named expression. It holds the expressions and their names.
|
|
29
22
|
export class DefinedNames {
|
|
30
23
|
private names = new Map<number, number>();
|
|
31
24
|
private exprs: RefVector;
|
|
@@ -41,7 +34,6 @@ export class DefinedNames {
|
|
|
41
34
|
this.lims.push(this.exprs.size);
|
|
42
35
|
}
|
|
43
36
|
|
|
44
|
-
// pop_scope: forgets the names since the matching push, the last first.
|
|
45
37
|
pop() {
|
|
46
38
|
const size = this.lims[this.lims.length - 1];
|
|
47
39
|
this.lims.pop();
|
|
@@ -52,14 +44,10 @@ export class DefinedNames {
|
|
|
52
44
|
}
|
|
53
45
|
}
|
|
54
46
|
|
|
55
|
-
// mk_name: (n x1 ... xk) for the free variables x1 ... xk of the quantifier, with n => q and q => n
|
|
56
|
-
// as the definition, under a universal quantifier whose pattern is the name. The definition comes
|
|
57
|
-
// with a reference, and is -1 when the quantifier already has a name.
|
|
58
47
|
mkName(quantifier: number) {
|
|
59
48
|
const manager = this.manager;
|
|
60
49
|
const existing = this.names.get(quantifier);
|
|
61
50
|
if (existing !== undefined) return { name: existing, definition: -1 };
|
|
62
|
-
// gen_name: a variable that does not occur still takes a position, filled with true.
|
|
63
51
|
const freeVarSorts = getFreeVarSorts(manager, quantifier, manager.freeVarBounds[quantifier]);
|
|
64
52
|
const varSorts = freeVarSorts.map((sort) => sort ?? SORT_BOOL);
|
|
65
53
|
const name = manager.mkApp(
|
|
@@ -72,7 +60,6 @@ export class DefinedNames {
|
|
|
72
60
|
this.names.set(quantifier, name);
|
|
73
61
|
this.exprs.push(quantifier);
|
|
74
62
|
this.nameRefs.push(name);
|
|
75
|
-
// bound_vars: the variables are in reverse order in the quantifier.
|
|
76
63
|
const definition = manager.withTemporaries(() => {
|
|
77
64
|
const boundVars = (conjunct: number) =>
|
|
78
65
|
varSorts.length === 0
|
|
@@ -97,8 +84,6 @@ export class DefinedNames {
|
|
|
97
84
|
}
|
|
98
85
|
}
|
|
99
86
|
|
|
100
|
-
// name_quantifier_labels: a rewriter that replaces each quantifier by its name, and collects the
|
|
101
|
-
// definitions of the new names.
|
|
102
87
|
class QuantifierNamer extends RewriterTpl {
|
|
103
88
|
private definitions: RefVector | null = null;
|
|
104
89
|
|
|
@@ -119,15 +104,12 @@ class QuantifierNamer extends RewriterTpl {
|
|
|
119
104
|
return named.name;
|
|
120
105
|
}
|
|
121
106
|
|
|
122
|
-
// The result comes with a reference, which the caller releases.
|
|
123
107
|
name(expr: number, definitions: RefVector) {
|
|
124
108
|
this.definitions = definitions;
|
|
125
109
|
return this.rewrite(expr);
|
|
126
110
|
}
|
|
127
111
|
}
|
|
128
112
|
|
|
129
|
-
// skolemizer: the Skolem functions take the free variables of the quantifier. The function of the
|
|
130
|
-
// last variable comes first, and takes the variable's name.
|
|
131
113
|
class Skolemizer {
|
|
132
114
|
private cache: ActCache;
|
|
133
115
|
private subst: VarSubst;
|
|
@@ -137,7 +119,6 @@ class Skolemizer {
|
|
|
137
119
|
this.subst = new VarSubst(manager, true);
|
|
138
120
|
}
|
|
139
121
|
|
|
140
|
-
// The result comes with a reference, which the caller releases.
|
|
141
122
|
skolemize(quantifier: number) {
|
|
142
123
|
const manager = this.manager;
|
|
143
124
|
const cached = this.cache.find(quantifier, 0);
|
|
@@ -177,15 +158,12 @@ class Skolemizer {
|
|
|
177
158
|
return result;
|
|
178
159
|
}
|
|
179
160
|
|
|
180
|
-
// ~skolemizer: the cache goes first, then the substitution.
|
|
181
161
|
release() {
|
|
182
162
|
this.cache.reset();
|
|
183
163
|
this.subst.release();
|
|
184
164
|
}
|
|
185
165
|
}
|
|
186
166
|
|
|
187
|
-
// A normalization still to finish: its expression, the next child, its polarity, whether it is
|
|
188
|
-
// nested in a quantifier, whether to cache its result, and where its children's results start.
|
|
189
167
|
interface Frame {
|
|
190
168
|
curr: number;
|
|
191
169
|
index: number;
|
|
@@ -195,12 +173,9 @@ interface Frame {
|
|
|
195
173
|
spos: number;
|
|
196
174
|
}
|
|
197
175
|
|
|
198
|
-
// nnf: one object normalizes the formulas of a reduction, and keeps its caches until it is
|
|
199
|
-
// released.
|
|
200
176
|
export class Nnf {
|
|
201
177
|
private frames: Frame[] = [];
|
|
202
178
|
private results: RefVector;
|
|
203
|
-
// One cache per polarity and nesting in a quantifier, in Z3's order of get_cache_idx.
|
|
204
179
|
private caches: ActCache[];
|
|
205
180
|
private todoDefs: RefVector;
|
|
206
181
|
private skolemizer: Skolemizer;
|
|
@@ -217,16 +192,13 @@ export class Nnf {
|
|
|
217
192
|
this.namer = new QuantifierNamer(manager, names);
|
|
218
193
|
}
|
|
219
194
|
|
|
220
|
-
// operator(): pushes the normal forms of the definitions of the names it introduced, the last
|
|
221
|
-
// first, then returns the normal form of expr with a reference, which the caller releases.
|
|
222
195
|
apply(expr: number, definitions: RefVector) {
|
|
223
196
|
return this.manager.withoutTemporaries(() => {
|
|
224
197
|
this.reset();
|
|
225
198
|
const result = this.process(expr);
|
|
226
199
|
const start = definitions.size;
|
|
227
200
|
for (let index = 0; index < this.todoDefs.size; index++) {
|
|
228
|
-
|
|
229
|
-
definitions.pushOwned(definition);
|
|
201
|
+
definitions.pushOwned(this.process(this.todoDefs.items[index]));
|
|
230
202
|
}
|
|
231
203
|
const added = definitions.items.splice(start).reverse();
|
|
232
204
|
definitions.items.push(...added);
|
|
@@ -234,7 +206,6 @@ export class Nnf {
|
|
|
234
206
|
});
|
|
235
207
|
}
|
|
236
208
|
|
|
237
|
-
// ~nnf: the namer, then the skolemizer, the definitions and the caches, the last first.
|
|
238
209
|
release() {
|
|
239
210
|
this.manager.withoutTemporaries(() => {
|
|
240
211
|
this.namer.release();
|
|
@@ -281,7 +252,6 @@ export class Nnf {
|
|
|
281
252
|
this.results.push(isPositive ? expr : mkNot(this.manager, expr));
|
|
282
253
|
}
|
|
283
254
|
|
|
284
|
-
// visit: whether the result of expr is on the result stack. Otherwise it pushes a frame for expr.
|
|
285
255
|
private visit(expr: number, isPositive: boolean, isInQuantifier: boolean) {
|
|
286
256
|
const manager = this.manager;
|
|
287
257
|
if (!manager.hasQuantifierFlags[expr]) {
|
|
@@ -305,7 +275,6 @@ export class Nnf {
|
|
|
305
275
|
return false;
|
|
306
276
|
}
|
|
307
277
|
|
|
308
|
-
// process: the normal form of expr, with a reference.
|
|
309
278
|
private process(expr: number) {
|
|
310
279
|
const manager = this.manager;
|
|
311
280
|
if (!this.visit(expr, true, false))
|
|
@@ -339,7 +308,6 @@ export class Nnf {
|
|
|
339
308
|
return result;
|
|
340
309
|
}
|
|
341
310
|
|
|
342
|
-
// Visits the children from frame.index on, each with its polarity, and whether all are done.
|
|
343
311
|
private visitChildren(frame: Frame, children: [number, boolean][]) {
|
|
344
312
|
while (frame.index < children.length) {
|
|
345
313
|
const child = children[frame.index++];
|
|
@@ -348,7 +316,6 @@ export class Nnf {
|
|
|
348
316
|
return true;
|
|
349
317
|
}
|
|
350
318
|
|
|
351
|
-
// Replaces the results from spos on with result.
|
|
352
319
|
private setResult(spos: number, result: number) {
|
|
353
320
|
this.manager.incRef(result);
|
|
354
321
|
this.results.shrink(spos);
|
|
@@ -433,7 +400,6 @@ export class Nnf {
|
|
|
433
400
|
return true;
|
|
434
401
|
}
|
|
435
402
|
default: {
|
|
436
|
-
// process_default: the quantifiers of an atom get names.
|
|
437
403
|
const named = this.namer.name(expr, this.todoDefs);
|
|
438
404
|
if (isPositive) this.results.pushOwned(named);
|
|
439
405
|
else {
|
|
@@ -460,7 +426,6 @@ export class Nnf {
|
|
|
460
426
|
if (!isDone) return false;
|
|
461
427
|
}
|
|
462
428
|
}
|
|
463
|
-
// A skolemized quantifier's result is already on the stack.
|
|
464
429
|
if (!isUniversal) return true;
|
|
465
430
|
const body = this.results.items[this.results.size - 1];
|
|
466
431
|
this.setResult(this.results.size - 1, manager.mkQuantifier({ ...data, isForall: true, body }));
|