tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (551) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  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 +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/nlsat/nlsat_types.h, src/nlsat/nlsat_clause.h), MIT license, see
2
- // z3-license.txt.
3
1
  import type { Dependency } from "../lp/dependency";
4
2
  import type { Polynomial } from "./polynomial";
5
3
 
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/polynomial/upolynomial_factorization{.cpp,_int.h}, the factorization
2
- // in src/math/polynomial/upolynomial.cpp, src/util/prime_generator.cpp and mpz_manager::root),
3
- // MIT license, see z3-license.txt.
4
1
  import { type Upolynomial, UpolynomialManager } from "./upolynomial";
5
2
 
6
3
  const UINT_MAX = 4294967295;
@@ -224,7 +221,7 @@ const henselLiftOnce = (
224
221
  r: bigint,
225
222
  polynomials: { u: Upolynomial; a: Upolynomial; v: Upolynomial; b: Upolynomial; c: Upolynomial },
226
223
  ) => {
227
- const zr = new UpolynomialManager(r);
224
+ const zr = new UpolynomialManager(z.limit, r);
228
225
  const f = zr.set(z.divConst(z.sub(polynomials.c, z.mul(polynomials.a, polynomials.b)), b));
229
226
  const division = zr.divRem(zr.mul(polynomials.v, f), polynomials.a);
230
227
  const t = zr.add(zr.mul(polynomials.u, f), zr.mul(polynomials.b, division.quotient));
@@ -242,13 +239,14 @@ const henselLiftQuadratic = (
242
239
  b: Upolynomial,
243
240
  e: number,
244
241
  ) => {
245
- const zp = new UpolynomialManager(zpe.zp);
242
+ const zp = new UpolynomialManager(z.limit, zpe.zp);
246
243
  const ext = zp.extGcd(a, b);
247
244
  let u = ext.u;
248
245
  let v = ext.v;
249
246
  let currentA = [...a];
250
247
  let currentB = [...b];
251
248
  for (let k = 1; k < e; k *= 2) {
249
+ z.limit.checkpoint();
252
250
  const modulus = zpe.zp as bigint;
253
251
  const lifted = henselLiftOnce(z, modulus, modulus, {
254
252
  u,
@@ -454,12 +452,13 @@ export const factorSquareFree = (
454
452
  fPp = fPp.map((coeff) => -coeff);
455
453
  if (k % 2 === 1) fs.constant = -fs.constant;
456
454
  }
457
- const zp = new UpolynomialManager(2n);
455
+ const zp = new UpolynomialManager(z.limit, 2n);
458
456
  let zpFs = mkFactors();
459
457
  let zpFsPrime = 2n;
460
458
  let degreeSet = [true];
461
459
  const getNextPrime = mkPrimeIterator();
462
460
  for (let trials = 0; trials <= params.primeTrials;) {
461
+ z.limit.checkpoint();
463
462
  const nextPrime = getNextPrime();
464
463
  if (nextPrime > params.maxPrime) {
465
464
  pushFactor(z, fs, fPp, k);
@@ -491,7 +490,7 @@ export const factorSquareFree = (
491
490
  }
492
491
  }
493
492
  zp.setZp(zpFsPrime);
494
- const zpe = new UpolynomialManager(zpFsPrime);
493
+ const zpe = new UpolynomialManager(z.limit, zpFsPrime);
495
494
  const zpeFs = henselLiftFactors(z, fPp, zp, zpFs, getMignotteBound(fPp, zpFsPrime), zpe);
496
495
  let leading = zpe.normalizeNumeral(fPp[fPp.length - 1]);
497
496
  fPp = z.mulConst(fPp, leading);
@@ -500,6 +499,7 @@ export const factorSquareFree = (
500
499
  let result = true;
501
500
  let isRemoving = false;
502
501
  for (let counter = 1; iterator.next(isRemoving); counter++) {
502
+ z.limit.checkpoint();
503
503
  if (counter > params.maxSearchSize) {
504
504
  result = false;
505
505
  break;
@@ -587,6 +587,7 @@ export const factorUpolynomial = (
587
587
  let isComplete = true;
588
588
  let product = z.exactDiv(primitive, square) as bigint[];
589
589
  for (let multiplicity = 1; product.length > 1; multiplicity++) {
590
+ z.limit.checkpoint();
590
591
  const next = z.gcd(product, square);
591
592
  const factor = z.exactDiv(product, next) as bigint[];
592
593
  if (factor.length > 1) {
@@ -1,12 +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.
3
- import { SmtInvariantError } from "../../../../errors";
1
+ import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
4
2
  import { getGcd, Rational } from "../rational";
3
+ import type { ResourceLimit } from "../rlimit";
5
4
  import { getLog2, Mpbq, refineLower, refineUpper } from "./mpbq";
6
5
 
7
6
  export type Upolynomial = readonly bigint[];
8
7
 
9
- const BIG_PRIMES = [
8
+ export const BIG_PRIMES = [
10
9
  39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217,
11
10
  39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359,
12
11
  39367, 39371, 39373, 39383, 39397, 39409, 39419, 39439, 39443, 39451, 39461, 39499, 39503, 39509,
@@ -28,12 +27,12 @@ const BIG_PRIMES = [
28
27
 
29
28
  const getSign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
30
29
 
31
- export const floorDiv = (dividend: bigint, divisor: bigint) => {
30
+ const floorDiv = (dividend: bigint, divisor: bigint) => {
32
31
  const quotient = dividend / divisor;
33
32
  return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
34
33
  };
35
34
 
36
- const getExtendedGcd = (first: bigint, second: bigint) => {
35
+ export const getExtendedGcd = (first: bigint, second: bigint) => {
37
36
  let [oldR, r] = [first, second];
38
37
  let [oldS, s] = [1n, 0n];
39
38
  let [oldT, t] = [0n, 1n];
@@ -75,7 +74,10 @@ interface DrsFrame {
75
74
  export class UpolynomialManager {
76
75
  private isPrimeModulus = true;
77
76
 
78
- constructor(private modulus: bigint | null = null) {}
77
+ constructor(
78
+ readonly limit: ResourceLimit,
79
+ private modulus: bigint | null = null,
80
+ ) {}
79
81
 
80
82
  get zp() {
81
83
  return this.modulus;
@@ -172,12 +174,15 @@ export class UpolynomialManager {
172
174
  mul(first: Upolynomial, second: Upolynomial) {
173
175
  if (first.length === 0 || second.length === 0) return [];
174
176
  const result = Array.from({ length: first.length + second.length - 1 }, () => 0n);
175
- for (let index = 0; index < first.length; index++) {
176
- if (first[index] === 0n) continue;
177
- for (let other = 0; other < second.length; other++)
178
- 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)
179
184
  result[index + other] = this.normalizeNumeral(
180
- result[index + other] + first[index] * second[other],
185
+ result[index + other] + outer[index] * inner[other],
181
186
  );
182
187
  }
183
188
  return trim(result);
@@ -233,8 +238,10 @@ export class UpolynomialManager {
233
238
  const quotient = Array.from({ length: quotientSize }, () => 0n);
234
239
  const leading = divisor[divisor.length - 1];
235
240
  let power = 0;
236
- while (remainder.length >= divisor.length) {
241
+ while (true) {
242
+ this.limit.checkpoint();
237
243
  const size = remainder.length;
244
+ if (size < divisor.length) return { quotient: trim(quotient), remainder, power };
238
245
  const shift = size - divisor.length;
239
246
  if (isField) {
240
247
  const ratio = this.divNumeral(remainder[size - 1], leading);
@@ -259,7 +266,6 @@ export class UpolynomialManager {
259
266
  remainder.length = size - 1;
260
267
  trim(remainder);
261
268
  }
262
- return { quotient: trim(quotient), remainder, power };
263
269
  }
264
270
 
265
271
  div(dividend: Upolynomial, divisor: Upolynomial) {
@@ -273,8 +279,9 @@ export class UpolynomialManager {
273
279
  const isField = this.isField;
274
280
  const leading = divisor[divisor.length - 1];
275
281
  let power = 0;
276
- while (remainder.length >= divisor.length) {
282
+ while (this.limit.inc()) {
277
283
  const size = remainder.length;
284
+ if (size < divisor.length) break;
278
285
  const shift = size - divisor.length;
279
286
  if (isField) {
280
287
  const ratio = this.divNumeral(remainder[size - 1], leading);
@@ -359,13 +366,16 @@ export class UpolynomialManager {
359
366
  if (second.length === 0) return this.flipSignIfLmNeg(this.set(first));
360
367
  let a = this.set(first);
361
368
  let b = this.set(second);
362
- 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
+ }
363
374
  const remainder = this.normalize(this.rem(a, b));
364
375
  a = b;
365
376
  b = remainder;
366
377
  }
367
- const normalized = this.normalize(a);
368
- return this.isField ? this.mkMonic(normalized) : this.flipSignIfLmNeg(normalized);
378
+ throw new SmtCanceledError();
369
379
  }
370
380
 
371
381
  private combineImages(image: Upolynomial, prime: bigint, combined: Upolynomial, bound: bigint) {
@@ -499,6 +509,7 @@ export class UpolynomialManager {
499
509
  let previous = 0;
500
510
  let changes = 0;
501
511
  for (let index = 0; index < work.length; index++) {
512
+ this.limit.checkpoint();
502
513
  let position = 1;
503
514
  for (; position < work.length - index; position++) work[position] += work[position - 1];
504
515
  const current = getSign(work[position - 1]);
@@ -515,9 +526,11 @@ export class UpolynomialManager {
515
526
  translate(coeffs: Upolynomial) {
516
527
  const result = [...coeffs];
517
528
  const degree = result.length - 1;
518
- for (let step = 1; step <= degree; step++)
529
+ for (let step = 1; step <= degree; step++) {
530
+ this.limit.checkpoint();
519
531
  for (let index = degree - step; index <= degree - 1; index++)
520
532
  result[index] += result[index + 1];
533
+ }
521
534
  return result;
522
535
  }
523
536
 
@@ -526,6 +539,7 @@ export class UpolynomialManager {
526
539
  const result = this.composeAnPxDivA(coeffs, value.den);
527
540
  const degree = result.length - 1;
528
541
  for (let step = 1; step <= degree; step++) {
542
+ this.limit.checkpoint();
529
543
  result[degree - step] += value.num * result[degree - step + 1];
530
544
  for (let index = degree - step + 1; index <= degree - 1; index++)
531
545
  result[index] = result[index] * value.den + value.num * result[index + 1];
@@ -698,6 +712,7 @@ export class UpolynomialManager {
698
712
  this.pushChildFrames(this.div(coeffs, twoXMinusOne), frames);
699
713
  } else this.pushChildFrames(coeffs, frames);
700
714
  while (frames.length > 0) {
715
+ this.limit.checkpoint();
701
716
  const frame = frames[frames.length - 1];
702
717
  if (!frame.isFirst) {
703
718
  frames.pop();
@@ -760,11 +775,12 @@ export class UpolynomialManager {
760
775
  }
761
776
 
762
777
  private sturmSeqCore(sequence: bigint[][]) {
763
- while (true) {
778
+ while (this.limit.inc()) {
764
779
  const remainder = this.srem(sequence[sequence.length - 2], sequence[sequence.length - 1]);
765
780
  if (remainder.length === 0) return sequence;
766
781
  sequence.push(this.normalize(remainder));
767
782
  }
783
+ return sequence;
768
784
  }
769
785
 
770
786
  sturmSeq(coeffs: Upolynomial) {
@@ -776,6 +792,7 @@ export class UpolynomialManager {
776
792
  }
777
793
 
778
794
  isolating2refinable(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq): Refinement {
795
+ this.limit.checkpoint();
779
796
  const signLower = this.evalSignAtBq(coeffs, lower);
780
797
  const signUpper = this.evalSignAtBq(coeffs, upper);
781
798
  if (signLower !== 0 && signUpper !== 0) return { isInterval: true, lower, upper };
@@ -784,6 +801,7 @@ export class UpolynomialManager {
784
801
  let b = upper;
785
802
  let newA = a.add(b).div2();
786
803
  while (true) {
804
+ this.limit.checkpoint();
787
805
  const signNewA = this.evalSignAtBq(coeffs, newA);
788
806
  if (signNewA !== signUpper) return { isInterval: signNewA !== 0, lower: newA, upper: b };
789
807
  b = newA;
@@ -795,6 +813,7 @@ export class UpolynomialManager {
795
813
  let b = upper;
796
814
  let newB = a.add(b).div2();
797
815
  while (true) {
816
+ this.limit.checkpoint();
798
817
  const signNewB = this.evalSignAtBq(coeffs, newB);
799
818
  if (signNewB !== signLower)
800
819
  return signNewB === 0
@@ -814,6 +833,7 @@ export class UpolynomialManager {
814
833
  let newA1 = a1.add(b1).div2();
815
834
  let newB2 = a2.add(b2).div2();
816
835
  while (true) {
836
+ this.limit.checkpoint();
817
837
  const signNewA1 = this.evalSignAtBq(coeffs, newA1);
818
838
  if (signNewA1 === 0) return { isInterval: false, lower: newA1, upper };
819
839
  if (signNewA1 === -signB1) return { isInterval: true, lower: newA1, upper: b1 };
@@ -840,6 +860,7 @@ export class UpolynomialManager {
840
860
  const signLower = this.evalSignAtBq(coeffs, lower);
841
861
  let current: Refinement = { isInterval: true, lower, upper };
842
862
  while (true) {
863
+ this.limit.checkpoint();
843
864
  if (current.upper.sub(current.lower).isLessThanOneDiv2k(precision)) return current;
844
865
  current = this.refineCore(coeffs, signLower, current.lower, current.upper);
845
866
  if (!current.isInterval) return current;
@@ -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);
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
+ };
@@ -1,7 +1,7 @@
1
- // Ported from Z3 (src/ast/normal_forms/nnf.cpp, name_exprs.cpp, defined_names.cpp), MIT license, see z3-license.txt.
2
1
  import { ActCache } from "./act-cache";
3
2
  import {
4
3
  type AstManager,
4
+ FAMILY_BASIC,
5
5
  KIND_APP,
6
6
  KIND_QUANTIFIER,
7
7
  KIND_VAR,
@@ -9,10 +9,12 @@ import {
9
9
  OP_EQ,
10
10
  OP_IMPLIES,
11
11
  OP_ITE,
12
+ OP_LABEL,
12
13
  OP_NOT,
13
14
  OP_OR,
14
15
  OP_XOR,
15
16
  SORT_BOOL,
17
+ QUANTIFIER_FORALL,
16
18
  } from "./ast";
17
19
  import { mkNot } from "./ast-util";
18
20
  import { RefVector } from "./ref-vector";
@@ -44,21 +46,36 @@ export class DefinedNames {
44
46
  }
45
47
  }
46
48
 
47
- mkName(quantifier: number) {
49
+ get numNames() {
50
+ return this.nameRefs.size;
51
+ }
52
+
53
+ getNameDecl(index: number) {
54
+ return this.manager.decls[this.nameRefs.items[index]];
55
+ }
56
+
57
+ release() {
58
+ this.nameRefs.reset();
59
+ this.exprs.reset();
60
+ }
61
+
62
+ mkName(expr: number) {
48
63
  const manager = this.manager;
49
- const existing = this.names.get(quantifier);
64
+ const existing = this.names.get(expr);
50
65
  if (existing !== undefined) return { name: existing, definition: -1 };
51
- const freeVarSorts = getFreeVarSorts(manager, quantifier, manager.freeVarBounds[quantifier]);
66
+ // A variable that does not occur still takes a position, filled with true.
67
+ const freeVarSorts = getFreeVarSorts(manager, expr, manager.freeVarBounds[expr]);
52
68
  const varSorts = freeVarSorts.map((sort) => sort ?? SORT_BOOL);
69
+ const sort = manager.sorts[expr];
53
70
  const name = manager.mkApp(
54
- manager.mkFreshFuncDecl("z3name", varSorts, SORT_BOOL),
55
- freeVarSorts.map((sort, index) =>
56
- sort === undefined ? manager.trueExpr : manager.mkVar(index, sort),
71
+ manager.mkFreshFuncDecl("z3name", varSorts, sort),
72
+ freeVarSorts.map((varSort, index) =>
73
+ varSort === undefined ? manager.trueExpr : manager.mkVar(index, varSort),
57
74
  ),
58
- SORT_BOOL,
75
+ sort,
59
76
  );
60
- this.names.set(quantifier, name);
61
- this.exprs.push(quantifier);
77
+ this.names.set(expr, name);
78
+ this.exprs.push(expr);
62
79
  this.nameRefs.push(name);
63
80
  const definition = manager.withTemporaries(() => {
64
81
  const boundVars = (conjunct: number) =>
@@ -67,35 +84,57 @@ export class DefinedNames {
67
84
  : elimUnusedVars(
68
85
  manager,
69
86
  manager.mkQuantifier({
70
- isForall: true,
87
+ kind: QUANTIFIER_FORALL,
71
88
  sorts: varSorts.toReversed(),
72
89
  names: varSorts.map((_sort, index) => varSorts.length - 1 - index),
73
90
  body: conjunct,
74
91
  patterns: [manager.mkPattern([name])],
92
+ noPatterns: [],
75
93
  weight: 1,
76
94
  qid: "",
77
95
  }),
78
96
  );
79
- const first = boundVars(manager.mkOr([manager.mkNot(name), quantifier]));
80
- const second = boundVars(manager.mkOr([name, manager.mkNot(quantifier)]));
97
+ if (manager.isBool(expr)) {
98
+ const first = boundVars(manager.mkOr([manager.mkNot(name), expr]));
99
+ const second = boundVars(manager.mkOr([name, manager.mkNot(expr)]));
100
+ return manager.mkAnd([first, second]);
101
+ }
102
+ if (manager.getOp(expr) !== OP_ITE) return boundVars(manager.mkEq(expr, name));
103
+ const notCondition = manager.mkNot(manager.getArg(expr, 0));
104
+ const thenEq = manager.mkEq(name, manager.getArg(expr, 1));
105
+ const first = boundVars(manager.mkOr([notCondition, thenEq]));
106
+ const elseEq = manager.mkEq(name, manager.getArg(expr, 2));
107
+ const second = boundVars(manager.mkOr([manager.getArg(expr, 0), elseEq]));
81
108
  return manager.mkAnd([first, second]);
82
109
  });
83
110
  return { name, definition };
84
111
  }
85
112
  }
86
113
 
87
- class QuantifierNamer extends RewriterTpl {
114
+ // The nested formula namer also names each application of a Boolean operator below the root.
115
+ class ExprNamer extends RewriterTpl {
88
116
  private definitions: RefVector | null = null;
117
+ private root = -1;
89
118
 
90
119
  constructor(
91
120
  manager: AstManager,
92
121
  private names: DefinedNames,
122
+ private isNamingFormulas: boolean,
93
123
  ) {
94
124
  super(manager);
95
125
  }
96
126
 
97
127
  getSubst(expr: number) {
98
- if (this.manager.kinds[expr] !== KIND_QUANTIFIER) return undefined;
128
+ const manager = this.manager;
129
+ const isNamed =
130
+ (manager.kinds[expr] === KIND_QUANTIFIER && !manager.isLambda(expr)) ||
131
+ (manager.kinds[expr] === KIND_APP && manager.getOp(expr) === OP_LABEL) ||
132
+ (this.isNamingFormulas &&
133
+ manager.kinds[expr] === KIND_APP &&
134
+ manager.funcDecls[manager.decls[expr]].family === FAMILY_BASIC &&
135
+ manager.getNumArgs(expr) > 0 &&
136
+ expr !== this.root);
137
+ if (!isNamed) return undefined;
99
138
  const named = this.names.mkName(expr);
100
139
  if (named.definition !== -1) {
101
140
  this.definitions?.push(named.definition);
@@ -106,6 +145,7 @@ class QuantifierNamer extends RewriterTpl {
106
145
 
107
146
  name(expr: number, definitions: RefVector) {
108
147
  this.definitions = definitions;
148
+ this.root = expr;
109
149
  return this.rewrite(expr);
110
150
  }
111
151
  }
@@ -144,7 +184,11 @@ class Skolemizer {
144
184
  for (let index = count - 1; index >= 0; index--) {
145
185
  const sort = data.sorts[index];
146
186
  substitution.push(
147
- manager.mkApp(manager.mkFreshFuncDecl(data.names[index], argSorts, sort), args.items, sort),
187
+ manager.mkApp(
188
+ manager.mkFreshFuncDecl(data.names[index], argSorts, sort, true, data.skid),
189
+ args.items,
190
+ sort,
191
+ ),
148
192
  );
149
193
  }
150
194
  freeVarSorts.forEach((sort, index) =>
@@ -173,23 +217,31 @@ interface Frame {
173
217
  spos: number;
174
218
  }
175
219
 
220
+ export const NNF_SKOLEM = 0;
221
+ export const NNF_QUANT = 1;
222
+ export const NNF_FULL = 2;
223
+
176
224
  export class Nnf {
177
225
  private frames: Frame[] = [];
178
226
  private results: RefVector;
179
227
  private caches: ActCache[];
180
228
  private todoDefs: RefVector;
181
229
  private skolemizer: Skolemizer;
182
- private namer: QuantifierNamer;
230
+ private namer: ExprNamer;
231
+ private nestedNamer: ExprNamer;
183
232
 
184
233
  constructor(
185
234
  private manager: AstManager,
186
235
  names: DefinedNames,
236
+ private mode = NNF_SKOLEM,
237
+ private isIgnoringLabels = false,
187
238
  ) {
188
239
  this.results = new RefVector(manager);
189
240
  this.caches = Array.from({ length: 4 }, () => new ActCache(manager, manager.getNumAsts()));
190
241
  this.todoDefs = new RefVector(manager);
191
242
  this.skolemizer = new Skolemizer(manager);
192
- this.namer = new QuantifierNamer(manager, names);
243
+ this.namer = new ExprNamer(manager, names, false);
244
+ this.nestedNamer = new ExprNamer(manager, names, true);
193
245
  }
194
246
 
195
247
  apply(expr: number, definitions: RefVector) {
@@ -208,6 +260,7 @@ export class Nnf {
208
260
 
209
261
  release() {
210
262
  this.manager.withoutTemporaries(() => {
263
+ this.nestedNamer.release();
211
264
  this.namer.release();
212
265
  this.skolemizer.release();
213
266
  this.todoDefs.reset();
@@ -254,7 +307,8 @@ export class Nnf {
254
307
 
255
308
  private visit(expr: number, isPositive: boolean, isInQuantifier: boolean) {
256
309
  const manager = this.manager;
257
- if (!manager.hasQuantifierFlags[expr]) {
310
+ const isSkipping = this.mode === NNF_SKOLEM || (this.mode === NNF_QUANT && !isInQuantifier);
311
+ if (isSkipping && !manager.hasQuantifierFlags[expr] && !manager.hasLabelFlags[expr]) {
258
312
  this.skip(expr, isPositive);
259
313
  return true;
260
314
  }
@@ -399,8 +453,29 @@ export class Nnf {
399
453
  this.setResult(frame.spos, manager.mkApp(OP_AND, [first, second], SORT_BOOL));
400
454
  return true;
401
455
  }
456
+ case OP_LABEL: {
457
+ if (!this.visitChildren(frame, [[manager.getArg(expr, 0), isPositive]])) return false;
458
+ const decl = manager.decls[expr];
459
+ if (this.isIgnoringLabels || isPositive !== manager.isLabelPositive(decl)) return true;
460
+ const arg = this.results.items[this.results.size - 1];
461
+ const literal = manager.mkLabelLit(manager.getLabelNames(decl));
462
+ this.setResult(frame.spos, manager.mkApp(OP_AND, [arg, literal], SORT_BOOL));
463
+ return true;
464
+ }
402
465
  default: {
403
- const named = this.namer.name(expr, this.todoDefs);
466
+ if (
467
+ this.mode !== NNF_FULL &&
468
+ !manager.hasQuantifierFlags[expr] &&
469
+ !manager.hasLabelFlags[expr]
470
+ ) {
471
+ this.skip(expr, isPositive);
472
+ return true;
473
+ }
474
+ const namer =
475
+ this.mode === NNF_FULL || (this.mode !== NNF_SKOLEM && frame.isInQuantifier)
476
+ ? this.nestedNamer
477
+ : this.namer;
478
+ const named = namer.name(expr, this.todoDefs);
404
479
  if (isPositive) this.results.pushOwned(named);
405
480
  else {
406
481
  this.results.push(mkNot(manager, named));
@@ -414,21 +489,28 @@ export class Nnf {
414
489
  private processQuantifier(quantifier: number, frame: Frame) {
415
490
  const manager = this.manager;
416
491
  const data = manager.getQuantifier(quantifier);
417
- const isUniversal = data.isForall === frame.isPositive;
492
+ const isUniversal = (data.kind === QUANTIFIER_FORALL) === frame.isPositive;
418
493
  if (frame.index === 0) {
419
494
  frame.index = 1;
420
495
  if (isUniversal) {
421
496
  if (!this.visit(data.body, frame.isPositive, true)) return false;
422
497
  } else {
423
498
  const skolemized = this.skolemizer.skolemize(quantifier);
424
- const isDone = this.visit(skolemized, !data.isForall, frame.isInQuantifier);
499
+ const isDone = this.visit(
500
+ skolemized,
501
+ data.kind !== QUANTIFIER_FORALL,
502
+ frame.isInQuantifier,
503
+ );
425
504
  manager.decRef(skolemized);
426
505
  if (!isDone) return false;
427
506
  }
428
507
  }
429
508
  if (!isUniversal) return true;
430
509
  const body = this.results.items[this.results.size - 1];
431
- this.setResult(this.results.size - 1, manager.mkQuantifier({ ...data, isForall: true, body }));
510
+ this.setResult(
511
+ this.results.size - 1,
512
+ manager.mkQuantifier({ ...data, kind: QUANTIFIER_FORALL, body }),
513
+ );
432
514
  return true;
433
515
  }
434
516
  }
@@ -0,0 +1,53 @@
1
+ import { type AstManager, OP_ADD, SORT_INT } from "./ast";
2
+ import { BoundManager } from "./bound-manager";
3
+ import type { Definition, Goal } from "./goal";
4
+ import { RefVector } from "./ref-vector";
5
+ import { Rewriter, type RewriterOptions } from "./rewriter";
6
+
7
+ export const normalizeBounds = (
8
+ manager: AstManager,
9
+ goal: Goal,
10
+ options: RewriterOptions,
11
+ isIntOnly: boolean,
12
+ ) => {
13
+ const bounds = new BoundManager(manager);
14
+ if (!goal.isProofsEnabled) for (const form of goal.forms.items) bounds.add(form);
15
+ const getLower = (variable: number) => {
16
+ const lower = bounds.lowers.get(variable);
17
+ return manager.isUninterpretedConst(variable) &&
18
+ (!isIntOnly || manager.sorts[variable] === SORT_INT) &&
19
+ lower !== undefined &&
20
+ !lower.value.isZero()
21
+ ? lower.value
22
+ : undefined;
23
+ };
24
+ if (!bounds.boundedVars.some((variable) => getLower(variable) !== undefined)) return;
25
+ const terms = new RefVector(manager);
26
+ const definitions: Definition[] = [];
27
+ const substitution = new Map<number, number>();
28
+ for (const variable of bounds.boundedVars) {
29
+ const lower = getLower(variable);
30
+ if (lower === undefined) continue;
31
+ const sort = manager.sorts[variable];
32
+ const fresh = manager.mkFreshConst(null, sort);
33
+ terms.push(fresh);
34
+ const def = manager.mkApp(OP_ADD, [fresh, manager.mkNumeralOfSort(lower, sort)], sort);
35
+ terms.push(def);
36
+ substitution.set(variable, def);
37
+ definitions.push(
38
+ { decl: manager.decls[fresh], def: -1 },
39
+ { decl: manager.decls[variable], def },
40
+ );
41
+ }
42
+ const rewriter = new Rewriter(manager, options);
43
+ rewriter.setSubstitution(substitution);
44
+ for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
45
+ const rewritten = rewriter.rewrite(goal.forms.items[index]);
46
+ goal.update(index, rewritten);
47
+ manager.decRef(rewritten);
48
+ }
49
+ rewriter.release();
50
+ goal.addDefinitions(definitions);
51
+ terms.reset();
52
+ goal.depth++;
53
+ };