tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,16 +1,11 @@
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. Univariate
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.
6
- import { SmtInvariantError } from "../../../../errors";
1
+ import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
7
2
  import { getGcd, Rational } from "../rational";
3
+ import type { ResourceLimit } from "../rlimit";
8
4
  import { getLog2, Mpbq, refineLower, refineUpper } from "./mpbq";
9
5
 
10
6
  export type Upolynomial = readonly bigint[];
11
7
 
12
- // g_big_primes: the primes mod_gcd tries, in order.
13
- const BIG_PRIMES = [
8
+ export const BIG_PRIMES = [
14
9
  39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217,
15
10
  39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359,
16
11
  39367, 39371, 39373, 39383, 39397, 39409, 39419, 39439, 39443, 39451, 39461, 39499, 39503, 39509,
@@ -30,16 +25,14 @@ const BIG_PRIMES = [
30
25
  41507, 41513, 41519, 41521, 41539, 41543, 41549,
31
26
  ].map(BigInt);
32
27
 
33
- const sign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
28
+ const getSign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
34
29
 
35
- // mpz div: rounds toward minus infinity.
36
30
  const floorDiv = (dividend: bigint, divisor: bigint) => {
37
31
  const quotient = dividend / divisor;
38
32
  return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
39
33
  };
40
34
 
41
- // mpz gcd(a, b, x, y, g): a*x + b*y = g.
42
- const getExtendedGcd = (first: bigint, second: bigint) => {
35
+ export const getExtendedGcd = (first: bigint, second: bigint) => {
43
36
  let [oldR, r] = [first, second];
44
37
  let [oldS, s] = [1n, 0n];
45
38
  let [oldT, t] = [0n, 1n];
@@ -65,7 +58,6 @@ interface IsolatedRoots {
65
58
  uppers: Mpbq[];
66
59
  }
67
60
 
68
- // An interval (a, b) refined around the root of a square-free polynomial, or the root itself.
69
61
  interface Refinement {
70
62
  isInterval: boolean;
71
63
  lower: Mpbq;
@@ -80,35 +72,32 @@ interface DrsFrame {
80
72
  }
81
73
 
82
74
  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
75
  private isPrimeModulus = true;
86
76
 
87
- constructor(private modulus: bigint | null = null) {}
77
+ constructor(
78
+ readonly limit: ResourceLimit,
79
+ private modulus: bigint | null = null,
80
+ ) {}
88
81
 
89
82
  get zp() {
90
83
  return this.modulus;
91
84
  }
92
85
 
93
- // field: Z_p for a prime p. Over a prime power, division falls back to pseudo-division.
94
86
  private get isField() {
95
87
  return this.modulus !== null && this.isPrimeModulus;
96
88
  }
97
89
 
98
- // set_zp
99
90
  setZp(prime: bigint) {
100
91
  this.modulus = prime;
101
92
  this.isPrimeModulus = true;
102
93
  }
103
94
 
104
- // set_p_sq: from Z_m to Z_(m^2).
105
95
  squareModulus() {
106
96
  if (this.modulus === null) throw new SmtInvariantError("squaring the modulus of Z");
107
97
  this.modulus *= this.modulus;
108
98
  this.isPrimeModulus = false;
109
99
  }
110
100
 
111
- // scoped_set_zp
112
101
  withZp<T>(prime: bigint, body: () => T) {
113
102
  const savedModulus = this.modulus;
114
103
  const savedIsPrime = this.isPrimeModulus;
@@ -119,9 +108,6 @@ export class UpolynomialManager {
119
108
  return result;
120
109
  }
121
110
 
122
- // Numerals.
123
-
124
- // p_normalize
125
111
  normalizeNumeral(value: bigint) {
126
112
  const modulus = this.modulus;
127
113
  if (modulus === null) return value;
@@ -137,7 +123,6 @@ export class UpolynomialManager {
137
123
  return this.normalizeNumeral(getExtendedGcd(this.normalizeNumeral(value), modulus).x);
138
124
  }
139
125
 
140
- // mpzzp div: exact over Z (rounding toward minus infinity), multiplication by the inverse over Z_p.
141
126
  private divNumeral(dividend: bigint, divisor: bigint) {
142
127
  return this.modulus === null
143
128
  ? floorDiv(dividend, divisor)
@@ -149,13 +134,10 @@ export class UpolynomialManager {
149
134
  return divisor === 0n ? dividend === 0n : dividend % divisor === 0n;
150
135
  }
151
136
 
152
- // set: the coefficients reduced to the current ring.
153
137
  set(coeffs: Upolynomial) {
154
138
  return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff)));
155
139
  }
156
140
 
157
- // Core operations.
158
-
159
141
  getContent(coeffs: Upolynomial) {
160
142
  let content = 0n;
161
143
  for (const coeff of coeffs) content = getGcd(content, coeff);
@@ -192,12 +174,15 @@ export class UpolynomialManager {
192
174
  mul(first: Upolynomial, second: Upolynomial) {
193
175
  if (first.length === 0 || second.length === 0) return [];
194
176
  const result = Array.from({ length: first.length + second.length - 1 }, () => 0n);
195
- for (let index = 0; index < first.length; index++) {
196
- if (first[index] === 0n) continue;
197
- for (let other = 0; other < second.length; other++)
198
- if (second[other] !== 0n)
177
+ const outer = first.length < second.length ? second : first;
178
+ const inner = first.length < second.length ? first : second;
179
+ for (let index = 0; index < outer.length; index++) {
180
+ this.limit.checkpoint();
181
+ if (outer[index] === 0n) continue;
182
+ for (let other = 0; other < inner.length; other++)
183
+ if (inner[other] !== 0n)
199
184
  result[index + other] = this.normalizeNumeral(
200
- result[index + other] + first[index] * second[other],
185
+ result[index + other] + outer[index] * inner[other],
201
186
  );
202
187
  }
203
188
  return trim(result);
@@ -208,7 +193,6 @@ export class UpolynomialManager {
208
193
  return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff * factor)));
209
194
  }
210
195
 
211
- // div(p, b): each coefficient divided by b, which divides it.
212
196
  divConst(coeffs: Upolynomial, divisor: bigint) {
213
197
  if (divisor === 1n) return [...coeffs];
214
198
  return trim(coeffs.map((coeff) => this.divNumeral(coeff, divisor)));
@@ -221,7 +205,6 @@ export class UpolynomialManager {
221
205
  );
222
206
  }
223
207
 
224
- // normalize: the coefficients divided by their gcd, or the sign of a constant.
225
208
  normalize(coeffs: Upolynomial) {
226
209
  if (coeffs.length === 0) return [];
227
210
  if (coeffs.length === 1) return [coeffs[0] > 0n ? 1n : this.normalizeNumeral(-1n)];
@@ -234,7 +217,6 @@ export class UpolynomialManager {
234
217
  return coeffs.length > 0 && coeffs[coeffs.length - 1] < 0n ? this.neg(coeffs) : [...coeffs];
235
218
  }
236
219
 
237
- // mk_monic: the polynomial divided by its leading coefficient, over Z_p.
238
220
  mkMonic(coeffs: Upolynomial) {
239
221
  if (coeffs.length === 0 || coeffs[coeffs.length - 1] === 1n) return [...coeffs];
240
222
  const inverse = this.inv(coeffs[coeffs.length - 1]);
@@ -243,7 +225,6 @@ export class UpolynomialManager {
243
225
  );
244
226
  }
245
227
 
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
228
  divRem(dividend: Upolynomial, divisor: Upolynomial) {
248
229
  const isField = this.isField;
249
230
  if (divisor.length === 1) {
@@ -257,8 +238,10 @@ export class UpolynomialManager {
257
238
  const quotient = Array.from({ length: quotientSize }, () => 0n);
258
239
  const leading = divisor[divisor.length - 1];
259
240
  let power = 0;
260
- while (remainder.length >= divisor.length) {
241
+ while (true) {
242
+ this.limit.checkpoint();
261
243
  const size = remainder.length;
244
+ if (size < divisor.length) return { quotient: trim(quotient), remainder, power };
262
245
  const shift = size - divisor.length;
263
246
  if (isField) {
264
247
  const ratio = this.divNumeral(remainder[size - 1], leading);
@@ -283,14 +266,12 @@ export class UpolynomialManager {
283
266
  remainder.length = size - 1;
284
267
  trim(remainder);
285
268
  }
286
- return { quotient: trim(quotient), remainder, power };
287
269
  }
288
270
 
289
271
  div(dividend: Upolynomial, divisor: Upolynomial) {
290
272
  return this.divRem(dividend, divisor).quotient;
291
273
  }
292
274
 
293
- // rem: the pseudo-remainder, with the number of pseudo-division steps.
294
275
  remWithPower(dividend: Upolynomial, divisor: Upolynomial) {
295
276
  if (divisor.length === 1) return { remainder: [] as bigint[], power: 0 };
296
277
  const remainder = this.set(dividend);
@@ -298,8 +279,9 @@ export class UpolynomialManager {
298
279
  const isField = this.isField;
299
280
  const leading = divisor[divisor.length - 1];
300
281
  let power = 0;
301
- while (remainder.length >= divisor.length) {
282
+ while (this.limit.inc()) {
302
283
  const size = remainder.length;
284
+ if (size < divisor.length) break;
303
285
  const shift = size - divisor.length;
304
286
  if (isField) {
305
287
  const ratio = this.divNumeral(remainder[size - 1], leading);
@@ -327,8 +309,6 @@ export class UpolynomialManager {
327
309
  return this.remWithPower(dividend, divisor).remainder;
328
310
  }
329
311
 
330
- // srem: the signed pseudo-remainder, negated unless an odd number of steps by a negative leading
331
- // coefficient already flipped it.
332
312
  srem(dividend: Upolynomial, divisor: Upolynomial) {
333
313
  const result = this.remWithPower(dividend, divisor);
334
314
  return result.power % 2 === 0 || (divisor.length > 0 && divisor[divisor.length - 1] > 0n)
@@ -336,7 +316,6 @@ export class UpolynomialManager {
336
316
  : result.remainder;
337
317
  }
338
318
 
339
- // divides: whether divisor divides dividend, checking only the leading coefficients.
340
319
  divides(dividend: Upolynomial, divisor: Upolynomial) {
341
320
  if (divisor.length === 0) return false;
342
321
  if (dividend.length === 0) return true;
@@ -356,7 +335,6 @@ export class UpolynomialManager {
356
335
  return true;
357
336
  }
358
337
 
359
- // exact_div: dividend / divisor when the division is exact, else null.
360
338
  exactDiv(dividend: Upolynomial, divisor: Upolynomial): bigint[] | null {
361
339
  if (divisor.length === 0) return null;
362
340
  if (dividend.length === 0) return [];
@@ -383,23 +361,23 @@ export class UpolynomialManager {
383
361
  return trim(result);
384
362
  }
385
363
 
386
- // GCD.
387
-
388
364
  private euclidGcd(first: Upolynomial, second: Upolynomial) {
389
365
  if (first.length === 0) return this.flipSignIfLmNeg(this.set(second));
390
366
  if (second.length === 0) return this.flipSignIfLmNeg(this.set(first));
391
367
  let a = this.set(first);
392
368
  let b = this.set(second);
393
- while (b.length > 0) {
369
+ while (this.limit.inc()) {
370
+ if (b.length === 0) {
371
+ const normalized = this.normalize(a);
372
+ return this.isField ? this.mkMonic(normalized) : this.flipSignIfLmNeg(normalized);
373
+ }
394
374
  const remainder = this.normalize(this.rem(a, b));
395
375
  a = b;
396
376
  b = remainder;
397
377
  }
398
- const normalized = this.normalize(a);
399
- return this.isField ? this.mkMonic(normalized) : this.flipSignIfLmNeg(normalized);
378
+ throw new SmtCanceledError();
400
379
  }
401
380
 
402
- // CRA_combine_images: the image modulo bound * prime, in the symmetric range.
403
381
  private combineImages(image: Upolynomial, prime: bigint, combined: Upolynomial, bound: bigint) {
404
382
  const inverses = getExtendedGcd(prime, bound);
405
383
  const mod = (value: bigint, modulus: bigint) => ((value % modulus) + modulus) % modulus;
@@ -421,7 +399,6 @@ export class UpolynomialManager {
421
399
  return { coeffs: result, bound: newBound };
422
400
  }
423
401
 
424
- // mod_gcd: the gcd over Z from images modulo big primes, combined by the Chinese remainder theorem.
425
402
  private modGcd(first: Upolynomial, second: Upolynomial) {
426
403
  const contentU = this.getContent(first);
427
404
  const contentV = this.getContent(second);
@@ -442,8 +419,6 @@ export class UpolynomialManager {
442
419
  });
443
420
  if (image === null) continue;
444
421
  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
422
  if (image.length < combined.length || bound % 2n === 0n) {
448
423
  combined = image;
449
424
  bound = prime;
@@ -469,7 +444,6 @@ export class UpolynomialManager {
469
444
  return this.modulus === null ? this.modGcd(first, second) : this.euclidGcd(first, second);
470
445
  }
471
446
 
472
- // square_free: p divided by gcd(p, p'), normalized.
473
447
  squareFree(coeffs: Upolynomial) {
474
448
  if (coeffs.length <= 1) return this.set(coeffs);
475
449
  const common = this.gcd(coeffs, this.derivative(coeffs));
@@ -487,7 +461,6 @@ export class UpolynomialManager {
487
461
  return result;
488
462
  }
489
463
 
490
- // ext_gcd over Z_p: u, v and the monic d with a*u + b*v = d.
491
464
  extGcd(first: Upolynomial, second: Upolynomial) {
492
465
  let u: bigint[] = [1n];
493
466
  let d = this.mkMonic(this.set(first));
@@ -511,8 +484,6 @@ export class UpolynomialManager {
511
484
  };
512
485
  }
513
486
 
514
- // Transformations.
515
-
516
487
  hasZeroRoots(coeffs: Upolynomial) {
517
488
  return coeffs.length > 0 && coeffs[0] === 0n;
518
489
  }
@@ -523,7 +494,6 @@ export class UpolynomialManager {
523
494
  return coeffs.slice(index);
524
495
  }
525
496
 
526
- // has_one_half_root: 2^n * p(1/2) = 0.
527
497
  private hasOneHalfRoot(coeffs: Upolynomial) {
528
498
  if (coeffs.length === 0) return true;
529
499
  if (coeffs.length === 1) return false;
@@ -533,16 +503,16 @@ export class UpolynomialManager {
533
503
  return result === 0n;
534
504
  }
535
505
 
536
- // descartes_bound_0_1: the sign changes of (x+1)^n p(1/(x+1)), stopping above 1.
537
506
  private descartesBound01(coeffs: Upolynomial) {
538
507
  if (coeffs.length <= 1) return 0;
539
508
  const work = [...coeffs];
540
509
  let previous = 0;
541
510
  let changes = 0;
542
511
  for (let index = 0; index < work.length; index++) {
512
+ this.limit.checkpoint();
543
513
  let position = 1;
544
514
  for (; position < work.length - index; position++) work[position] += work[position - 1];
545
- const current = sign(work[position - 1]);
515
+ const current = getSign(work[position - 1]);
546
516
  if (current === 0) continue;
547
517
  if (current !== previous && previous !== 0) {
548
518
  changes++;
@@ -553,22 +523,23 @@ export class UpolynomialManager {
553
523
  return changes;
554
524
  }
555
525
 
556
- // translate: p(x + 1).
557
526
  translate(coeffs: Upolynomial) {
558
527
  const result = [...coeffs];
559
528
  const degree = result.length - 1;
560
- for (let step = 1; step <= degree; step++)
529
+ for (let step = 1; step <= degree; step++) {
530
+ this.limit.checkpoint();
561
531
  for (let index = degree - step; index <= degree - 1; index++)
562
532
  result[index] += result[index + 1];
533
+ }
563
534
  return result;
564
535
  }
565
536
 
566
- // translate_q: den^n * p(x + q).
567
537
  translateQ(coeffs: Upolynomial, value: Rational) {
568
538
  if (coeffs.length <= 1) return [...coeffs];
569
539
  const result = this.composeAnPxDivA(coeffs, value.den);
570
540
  const degree = result.length - 1;
571
541
  for (let step = 1; step <= degree; step++) {
542
+ this.limit.checkpoint();
572
543
  result[degree - step] += value.num * result[degree - step + 1];
573
544
  for (let index = degree - step + 1; index <= degree - 1; index++)
574
545
  result[index] = result[index] * value.den + value.num * result[index + 1];
@@ -577,28 +548,23 @@ export class UpolynomialManager {
577
548
  return result;
578
549
  }
579
550
 
580
- // compose_2n_p_x_div_2: 2^n * p(x/2).
581
551
  private compose2nPxDiv2(coeffs: Upolynomial) {
582
552
  const degree = coeffs.length - 1;
583
553
  return coeffs.map((coeff, index) => coeff << BigInt(degree - index));
584
554
  }
585
555
 
586
- // p_minus_x: p(-x).
587
556
  pMinusX(coeffs: Upolynomial) {
588
557
  return coeffs.map((coeff, index) => (index % 2 === 1 && coeff !== 0n ? -coeff : coeff));
589
558
  }
590
559
 
591
- // p_1_div_x: x^n * p(1/x).
592
560
  p1DivX(coeffs: Upolynomial) {
593
561
  return [...coeffs].reverse();
594
562
  }
595
563
 
596
- // compose_p_2k_x: p(2^k * x).
597
564
  private composeP2kX(coeffs: Upolynomial, k: number) {
598
565
  return coeffs.map((coeff, index) => coeff << BigInt(k * index));
599
566
  }
600
567
 
601
- // compose_an_p_x_div_a: a^n * p(x/a).
602
568
  private composeAnPxDivA(coeffs: Upolynomial, factor: bigint) {
603
569
  const degree = coeffs.length - 1;
604
570
  return coeffs.map((coeff, index) =>
@@ -606,7 +572,6 @@ export class UpolynomialManager {
606
572
  );
607
573
  }
608
574
 
609
- // compose_p_q_x: c^n * p(b*x/c) for q = b/c.
610
575
  composePQX(coeffs: Upolynomial, value: Rational) {
611
576
  const degree = coeffs.length - 1;
612
577
  return coeffs.map((coeff, index) =>
@@ -614,12 +579,9 @@ export class UpolynomialManager {
614
579
  );
615
580
  }
616
581
 
617
- // Signs.
618
-
619
- // eval_sign_at for a binary rational: the sign of (2^k)^n * p(b).
620
582
  evalSignAtBq(coeffs: Upolynomial, value: Mpbq) {
621
583
  if (coeffs.length === 0) return 0;
622
- if (coeffs.length === 1) return sign(coeffs[0]);
584
+ if (coeffs.length === 1) return getSign(coeffs[0]);
623
585
  let result = coeffs[coeffs.length - 1];
624
586
  let shift = value.k;
625
587
  for (let index = coeffs.length - 2; index >= 0; index--, shift += value.k)
@@ -627,12 +589,12 @@ export class UpolynomialManager {
627
589
  coeffs[index] === 0n
628
590
  ? result * value.num
629
591
  : (coeffs[index] << BigInt(shift)) + result * value.num;
630
- return sign(result);
592
+ return getSign(result);
631
593
  }
632
594
 
633
595
  evalSignAtQ(coeffs: Upolynomial, value: Rational) {
634
596
  if (coeffs.length === 0) return 0;
635
- if (coeffs.length === 1) return sign(coeffs[0]);
597
+ if (coeffs.length === 1) return getSign(coeffs[0]);
636
598
  let result = coeffs[coeffs.length - 1];
637
599
  let denominator = value.den;
638
600
  for (let index = coeffs.length - 2; index >= 0; index--, denominator *= value.den)
@@ -640,20 +602,20 @@ export class UpolynomialManager {
640
602
  coeffs[index] === 0n
641
603
  ? result * value.num
642
604
  : coeffs[index] * denominator + result * value.num;
643
- return sign(result);
605
+ return getSign(result);
644
606
  }
645
607
 
646
608
  evalSignAtZero(coeffs: Upolynomial) {
647
- return coeffs.length === 0 ? 0 : sign(coeffs[0]);
609
+ return coeffs.length === 0 ? 0 : getSign(coeffs[0]);
648
610
  }
649
611
 
650
612
  evalSignAtPlusInf(coeffs: Upolynomial) {
651
- return coeffs.length === 0 ? 0 : sign(coeffs[coeffs.length - 1]);
613
+ return coeffs.length === 0 ? 0 : getSign(coeffs[coeffs.length - 1]);
652
614
  }
653
615
 
654
616
  evalSignAtMinusInf(coeffs: Upolynomial) {
655
617
  if (coeffs.length === 0) return 0;
656
- const leading = sign(coeffs[coeffs.length - 1]);
618
+ const leading = getSign(coeffs[coeffs.length - 1]);
657
619
  return (coeffs.length - 1) % 2 === 0 ? leading : -leading;
658
620
  }
659
621
 
@@ -685,9 +647,6 @@ export class UpolynomialManager {
685
647
  return this.countSignVariations(sequence.map((coeffs) => this.evalSignAtBq(coeffs, value)));
686
648
  }
687
649
 
688
- // Root bounds.
689
-
690
- // knuth_positive_root_upper_bound: k with every positive root below 2^k.
691
650
  knuthPositiveRootUpperBound(coeffs: Upolynomial) {
692
651
  if (coeffs.length === 0) return 0;
693
652
  let max = 0;
@@ -710,7 +669,6 @@ export class UpolynomialManager {
710
669
  return this.knuthPositiveRootUpperBound(this.pMinusX(coeffs));
711
670
  }
712
671
 
713
- // nonzero_root_lower_bound: k with every nonzero root of absolute value above 1/2^k.
714
672
  nonzeroRootLowerBound(coeffs: Upolynomial) {
715
673
  const reversed = this.removeZeroRoots(coeffs).reverse();
716
674
  return Math.max(
@@ -719,9 +677,6 @@ export class UpolynomialManager {
719
677
  );
720
678
  }
721
679
 
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
680
  private pushChildFrames(coeffs: Upolynomial, frames: DrsFrame[]) {
726
681
  const parent = frames.length - 1;
727
682
  const left = this.normalize(this.compose2nPxDiv2(coeffs));
@@ -734,7 +689,6 @@ export class UpolynomialManager {
734
689
  });
735
690
  }
736
691
 
737
- // The interval (0, 1), or the point 1/2, of the top frame mapped back through its ancestors.
738
692
  private mapToRoot(frames: DrsFrame[], value: Mpbq) {
739
693
  let result = value;
740
694
  for (let index = frames.length - 1; index !== -1; index = frames[index].parent)
@@ -758,6 +712,7 @@ export class UpolynomialManager {
758
712
  this.pushChildFrames(this.div(coeffs, twoXMinusOne), frames);
759
713
  } else this.pushChildFrames(coeffs, frames);
760
714
  while (frames.length > 0) {
715
+ this.limit.checkpoint();
761
716
  const frame = frames[frames.length - 1];
762
717
  if (!frame.isFirst) {
763
718
  frames.pop();
@@ -782,8 +737,6 @@ export class UpolynomialManager {
782
737
  }
783
738
  }
784
739
 
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
740
  private drsIsolateRoots(coeffs: Upolynomial, result: IsolatedRoots) {
788
741
  const normalized = this.normalize(coeffs);
789
742
  const negativeK = this.knuthNegativeRootUpperBound(coeffs);
@@ -812,8 +765,6 @@ export class UpolynomialManager {
812
765
  }
813
766
  }
814
767
 
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
768
  sqfIsolateRoots(coeffs: Upolynomial): IsolatedRoots {
818
769
  const result: IsolatedRoots = { roots: [], lowers: [], uppers: [] };
819
770
  if (this.hasZeroRoots(coeffs)) {
@@ -823,14 +774,13 @@ export class UpolynomialManager {
823
774
  return result;
824
775
  }
825
776
 
826
- // Sturm sequences.
827
-
828
777
  private sturmSeqCore(sequence: bigint[][]) {
829
- while (true) {
778
+ while (this.limit.inc()) {
830
779
  const remainder = this.srem(sequence[sequence.length - 2], sequence[sequence.length - 1]);
831
780
  if (remainder.length === 0) return sequence;
832
781
  sequence.push(this.normalize(remainder));
833
782
  }
783
+ return sequence;
834
784
  }
835
785
 
836
786
  sturmSeq(coeffs: Upolynomial) {
@@ -841,11 +791,8 @@ export class UpolynomialManager {
841
791
  return this.sturmSeqCore([[...first], this.mul(this.derivative(first), second)]);
842
792
  }
843
793
 
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
794
  isolating2refinable(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq): Refinement {
795
+ this.limit.checkpoint();
849
796
  const signLower = this.evalSignAtBq(coeffs, lower);
850
797
  const signUpper = this.evalSignAtBq(coeffs, upper);
851
798
  if (signLower !== 0 && signUpper !== 0) return { isInterval: true, lower, upper };
@@ -854,6 +801,7 @@ export class UpolynomialManager {
854
801
  let b = upper;
855
802
  let newA = a.add(b).div2();
856
803
  while (true) {
804
+ this.limit.checkpoint();
857
805
  const signNewA = this.evalSignAtBq(coeffs, newA);
858
806
  if (signNewA !== signUpper) return { isInterval: signNewA !== 0, lower: newA, upper: b };
859
807
  b = newA;
@@ -865,6 +813,7 @@ export class UpolynomialManager {
865
813
  let b = upper;
866
814
  let newB = a.add(b).div2();
867
815
  while (true) {
816
+ this.limit.checkpoint();
868
817
  const signNewB = this.evalSignAtBq(coeffs, newB);
869
818
  if (signNewB !== signLower)
870
819
  return signNewB === 0
@@ -884,6 +833,7 @@ export class UpolynomialManager {
884
833
  let newA1 = a1.add(b1).div2();
885
834
  let newB2 = a2.add(b2).div2();
886
835
  while (true) {
836
+ this.limit.checkpoint();
887
837
  const signNewA1 = this.evalSignAtBq(coeffs, newA1);
888
838
  if (signNewA1 === 0) return { isInterval: false, lower: newA1, upper };
889
839
  if (signNewA1 === -signB1) return { isInterval: true, lower: newA1, upper: b1 };
@@ -897,7 +847,6 @@ export class UpolynomialManager {
897
847
  }
898
848
  }
899
849
 
900
- // refine_core: one bisection of a refinable interval, or the root at its midpoint.
901
850
  refineCore(coeffs: Upolynomial, signLower: number, lower: Mpbq, upper: Mpbq): Refinement {
902
851
  const middle = lower.add(upper).div2();
903
852
  const signMiddle = this.evalSignAtBq(coeffs, middle);
@@ -907,23 +856,17 @@ export class UpolynomialManager {
907
856
  : { isInterval: true, lower, upper: middle };
908
857
  }
909
858
 
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
859
  refineToPrecision(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, precision: number): Refinement {
916
860
  const signLower = this.evalSignAtBq(coeffs, lower);
917
861
  let current: Refinement = { isInterval: true, lower, upper };
918
862
  while (true) {
863
+ this.limit.checkpoint();
919
864
  if (current.upper.sub(current.lower).isLessThanOneDiv2k(precision)) return current;
920
865
  current = this.refineCore(coeffs, signLower, current.lower, current.upper);
921
866
  if (!current.isInterval) return current;
922
867
  }
923
868
  }
924
869
 
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
870
  convertQ2bqInterval(coeffs: Upolynomial, a: Rational, b: Rational): Refinement {
928
871
  const signA = this.evalSignAtQ(coeffs, a);
929
872
  const signB = this.evalSignAtQ(coeffs, b);
@@ -978,8 +921,6 @@ export class UpolynomialManager {
978
921
  }
979
922
  }
980
923
 
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
924
  normalizeInterval(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, signLower: number) {
984
925
  if (!(lower.isNeg && upper.isPos)) return { lower, upper };
985
926
  if (this.hasZeroRoots(coeffs)) return null;
@@ -988,7 +929,6 @@ export class UpolynomialManager {
988
929
  : { lower, upper: Mpbq.zero };
989
930
  }
990
931
 
991
- // get_root_id: the number of roots up to l.
992
932
  getRootId(coeffs: Upolynomial, lower: Mpbq) {
993
933
  const sequence = this.sturmSeq(coeffs);
994
934
  return this.signVariationsAtMinusInf(sequence) - this.signVariationsAt(sequence, lower);
@@ -0,0 +1,82 @@
1
+ import { SmtTacticError, SmtUnsupportedError } from "../../../errors";
2
+ import { type AstManager, FAMILY_ARITH, KIND_APP, OP_ATAN2, OP_PI, SORT_INT } from "./ast";
3
+ import type { Goal } from "./goal";
4
+ import { goal2nlsat } from "./goal2nlsat";
5
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
6
+ import { NlsatSolver } from "./nlsat/solver";
7
+ import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
8
+ import { ProtoModel } from "./proto-model";
9
+
10
+ const isSupportedTranscendental = (manager: AstManager, term: number) =>
11
+ manager.kinds[term] === KIND_APP &&
12
+ manager.getFamily(term) === FAMILY_ARITH &&
13
+ (TRANSCENDENTAL_OPS.has(manager.getOp(term)) ||
14
+ manager.getOp(term) === OP_ATAN2 ||
15
+ manager.getOp(term) === OP_PI);
16
+
17
+ const containsUnsupported = (
18
+ manager: AstManager,
19
+ t2x: ReadonlyMap<number, number>,
20
+ a2b: ReadonlyMap<number, number>,
21
+ ) =>
22
+ [...t2x.keys()].some(
23
+ (term) => !manager.isUninterpretedConst(term) && !isSupportedTranscendental(manager, term),
24
+ ) || [...a2b.keys()].some((atom) => !manager.isUninterpretedConst(atom));
25
+
26
+ // Undefined when nlsat assigns a fraction to an integer variable.
27
+ const mkModel = (
28
+ manager: AstManager,
29
+ solver: NlsatSolver,
30
+ t2x: ReadonlyMap<number, number>,
31
+ a2b: ReadonlyMap<number, number>,
32
+ ) => {
33
+ const model = new ProtoModel(manager).mkModel();
34
+ for (const [term, variable] of t2x) {
35
+ if (!manager.isUninterpretedConst(term)) continue;
36
+ const value = solver.getValue(variable);
37
+ if (manager.sorts[term] === SORT_INT && !solver.am.isInt(value)) return undefined;
38
+ model.registerConst(
39
+ manager.decls[term],
40
+ manager.mkAlgebraicNumeral(value, manager.sorts[term]),
41
+ );
42
+ }
43
+ for (const [atom, boolVar] of a2b) {
44
+ const value = solver.getBoolValue(boolVar);
45
+ if (value === L_UNDEF) continue;
46
+ model.registerConst(
47
+ manager.decls[atom],
48
+ value === L_TRUE ? manager.trueExpr : manager.falseExpr,
49
+ );
50
+ }
51
+ return model;
52
+ };
53
+
54
+ export interface NlsatOptions {
55
+ seed: number;
56
+ isFactoring: boolean;
57
+ isShufflingVars: boolean;
58
+ variableOrderingStrategy: number;
59
+ }
60
+
61
+ export const runNlsat = (manager: AstManager, options: NlsatOptions) => (goal: Goal) => {
62
+ if (goal.isDecided()) return [goal];
63
+ if (goal.isProofsEnabled) throw new SmtTacticError("nlsat does not support proof production");
64
+ const solver = new NlsatSolver(manager.limit);
65
+ solver.updtParams(options.seed, options.isFactoring);
66
+ const t2x = new Map<number, number>();
67
+ const a2b = new Map<number, number>();
68
+ goal2nlsat(manager, goal.forms.items, solver, t2x, a2b, null, options.isFactoring);
69
+ if (options.isShufflingVars || options.variableOrderingStrategy !== 0)
70
+ throw new SmtUnsupportedError("nlsat's shuffle_vars and variable_ordering_strategy");
71
+ const status = solver.check();
72
+ if (status === L_TRUE && !containsUnsupported(manager, t2x, a2b)) {
73
+ const model = mkModel(manager, solver, t2x, a2b);
74
+ if (model !== undefined) {
75
+ goal.reset();
76
+ goal.model = model;
77
+ }
78
+ }
79
+ if (status === L_FALSE) goal.assert(manager.falseExpr);
80
+ goal.depth++;
81
+ return [goal];
82
+ };