tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  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 +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,484 @@
1
+ // Z3 registers only the satisfiability mode as a tactic, so the elimination mode of mk_nlqe_tactic
2
+ // is not ported.
3
+ import { SmtTacticError } from "../../../errors";
4
+ import {
5
+ type AstManager,
6
+ FAMILY_ARITH,
7
+ FAMILY_BASIC,
8
+ KIND_QUANTIFIER,
9
+ KIND_VAR,
10
+ OP_ADD,
11
+ OP_AND,
12
+ OP_DIV,
13
+ OP_DIV0,
14
+ OP_EQ,
15
+ OP_GE,
16
+ OP_GT,
17
+ OP_ITE,
18
+ OP_LE,
19
+ OP_LT,
20
+ OP_MUL,
21
+ OP_OR,
22
+ OP_PATTERN,
23
+ OP_POWER,
24
+ OP_SUB,
25
+ OP_UMINUS,
26
+ SORT_BOOL,
27
+ SORT_REAL,
28
+ } from "./ast";
29
+ import { Goal } from "./goal";
30
+ import { goal2nlsat } from "./goal2nlsat";
31
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
32
+ import { Anum } from "./nlsat/algebraic";
33
+ import { ScopedLiterals, TRUE_LITERAL } from "./nlsat/atoms";
34
+ import { NlsatSolver } from "./nlsat/solver";
35
+ import { ProtoModel } from "./proto-model";
36
+ import { getFreeVars, getMaxLevel, type MaxLevel, mergeLevel, mkLevel, NO_LEVEL } from "./qsat";
37
+ import { QuantifierHoister } from "./quant-hoist";
38
+ import { Rational } from "./rational";
39
+ import { RefVector } from "./ref-vector";
40
+ import { RewriterTpl } from "./rewriter-tpl";
41
+ import type { Tactic } from "./tactic";
42
+
43
+ interface Div {
44
+ num: number;
45
+ den: number;
46
+ name: number;
47
+ }
48
+
49
+ const isExists = (level: number) => level % 2 === 0;
50
+
51
+ const isUnsignedPositive = (value: Rational) =>
52
+ value.isInt() && value.num > 0n && value.num < 2n ** 32n;
53
+
54
+ class DivRewriter extends RewriterTpl {
55
+ readonly divs: Div[] = [];
56
+
57
+ constructor(
58
+ manager: AstManager,
59
+ private trail: RefVector,
60
+ ) {
61
+ super(manager);
62
+ }
63
+
64
+ reduceApp(decl: number, args: number[]) {
65
+ const manager = this.manager;
66
+ if (decl !== OP_DIV || args.length !== 2) return -1;
67
+ const [num, den] = args;
68
+ if (
69
+ manager.isNumeral(num) &&
70
+ manager.isNumeral(den) &&
71
+ !manager.getRationalValue(den).isZero()
72
+ ) {
73
+ const result = manager.mkRealNumeral(
74
+ manager.getRationalValue(num).div(manager.getRationalValue(den)),
75
+ );
76
+ manager.incRef(result);
77
+ return result;
78
+ }
79
+ if (!manager.isGroundApp(num) || !manager.isGroundApp(den)) return -1;
80
+ const name = manager.mkFreshConst("div", SORT_REAL);
81
+ this.trail.push(name);
82
+ this.trail.push(num);
83
+ this.trail.push(den);
84
+ this.divs.push({ num, den, name });
85
+ manager.incRef(name);
86
+ return name;
87
+ }
88
+ }
89
+
90
+ class Nlqsat {
91
+ private solver: NlsatSolver;
92
+ private isTrue = TRUE_LITERAL;
93
+ private rmodel: (Anum | undefined)[] = [];
94
+ private bmodel: number[] = [];
95
+ private rmodel0: (Anum | undefined)[] = [];
96
+ private bmodel0: number[] = [];
97
+ private isValidModel = false;
98
+ private boundRvars: number[][] = [];
99
+ private boundBvars: number[][] = [];
100
+ private preds: ScopedLiterals[] = [];
101
+ private rvar2level: MaxLevel[] = [];
102
+ private bvar2level = new Map<number, MaxLevel>();
103
+ private a2b = new Map<number, number>();
104
+ private t2x = new Map<number, number>();
105
+ private b2a = new Map<number, number>();
106
+ private asms: number[] = [];
107
+ private cachedAsms: number[] = [];
108
+ private cachedAsmsLim: number[] = [];
109
+ private freeVars = new Set<number>();
110
+ private divs: Div[] = [];
111
+ private trail: RefVector;
112
+ private goals: Goal[] = [];
113
+
114
+ constructor(
115
+ private manager: AstManager,
116
+ seed: number,
117
+ private cnf: Tactic,
118
+ ) {
119
+ this.solver = new NlsatSolver(manager.limit);
120
+ this.solver.updtParams(seed, false);
121
+ this.trail = new RefVector(manager);
122
+ }
123
+
124
+ private pin(expr: number) {
125
+ this.trail.push(expr);
126
+ return expr;
127
+ }
128
+
129
+ private pinOwned(expr: number) {
130
+ this.trail.pushOwned(expr);
131
+ return expr;
132
+ }
133
+
134
+ private get level() {
135
+ return this.cachedAsmsLim.length;
136
+ }
137
+
138
+ private checkSat() {
139
+ for (;;) {
140
+ this.initAssumptions();
141
+ const result = this.solver.checkAssumptions(this.asms);
142
+ if (result === L_TRUE) {
143
+ this.saveModel(isExists(this.level));
144
+ this.push();
145
+ } else if (result === L_FALSE) {
146
+ if (this.level === 0) return L_FALSE;
147
+ if (this.level === 1) return L_TRUE;
148
+ this.project();
149
+ } else return result;
150
+ }
151
+ }
152
+
153
+ private initAssumptions() {
154
+ const level = this.level;
155
+ this.asms = [isExists(level) ? this.isTrue : this.isTrue ^ 1];
156
+ if (!this.isValidModel) {
157
+ this.asms.push(...this.cachedAsms);
158
+ return;
159
+ }
160
+ this.unsaveModel();
161
+ if (level === 0) return;
162
+ if (level <= this.preds.length)
163
+ for (const literal of this.preds[level - 1].literals)
164
+ this.addLiteral(this.cachedAsms, literal);
165
+ this.asms.push(...this.cachedAsms);
166
+ for (let index = level + 1; index < this.preds.length; index += 2)
167
+ for (const literal of this.preds[index].literals) {
168
+ const predLevel = this.bvar2level.get(literal >> 1) as MaxLevel;
169
+ const isUsed =
170
+ (predLevel.fa === index && (predLevel.ex === NO_LEVEL || predLevel.ex < level)) ||
171
+ (predLevel.ex === index && (predLevel.fa === NO_LEVEL || predLevel.fa < level));
172
+ if (isUsed) this.addLiteral(this.asms, literal);
173
+ }
174
+ this.saveModel(isExists(level));
175
+ }
176
+
177
+ private addLiteral(literals: number[], literal: number) {
178
+ literals.push(this.solver.value(literal) === L_FALSE ? literal ^ 1 : literal);
179
+ }
180
+
181
+ private saveModel(isExistential: boolean) {
182
+ this.rmodel = this.solver.getRvalues();
183
+ this.bmodel = this.solver.getBvalues(this.bvar2level.keys());
184
+ this.isValidModel = true;
185
+ if (!isExistential) return;
186
+ this.rmodel0 = this.rmodel;
187
+ this.bmodel0 = [...this.bmodel];
188
+ }
189
+
190
+ private unsaveModel() {
191
+ this.solver.setRvalues(this.rmodel);
192
+ this.solver.setBvalues(this.bmodel);
193
+ }
194
+
195
+ private clearModel() {
196
+ this.isValidModel = false;
197
+ this.rmodel = [];
198
+ this.bmodel = [];
199
+ this.solver.setRvalues(this.rmodel);
200
+ }
201
+
202
+ private mbp(level: number, result: ScopedLiterals) {
203
+ const vars: number[] = [];
204
+ const fvars = new Set<number>();
205
+ for (let index = 0; index < this.boundRvars.length; index++) {
206
+ if (index < level) for (const boolVar of this.boundBvars[index]) fvars.add(boolVar);
207
+ else vars.push(...this.boundRvars[index]);
208
+ }
209
+ this.unsaveModel();
210
+ const projected = new ScopedLiterals(this.solver.atoms);
211
+ result.reset();
212
+ for (const literal of this.asms)
213
+ if (!this.b2a.has(literal >> 1) || fvars.has(literal >> 1)) result.push(literal);
214
+ for (let index = vars.length - 1; index >= 0; index--) {
215
+ this.solver.explain.projectVariable(vars[index], result.literals, projected);
216
+ result.reset();
217
+ result.literals = projected.literals;
218
+ projected.literals = [];
219
+ }
220
+ for (let index = 0; index < result.size; index++) result.set(index, result.literals[index] ^ 1);
221
+ }
222
+
223
+ private getClauseLevel(clause: readonly number[]) {
224
+ const level = mkLevel();
225
+ for (const literal of clause) mergeLevel(level, this.getLevel(literal));
226
+ return level;
227
+ }
228
+
229
+ private getLevel(literal: number) {
230
+ const known = this.bvar2level.get(literal >> 1);
231
+ if (known !== undefined) return known;
232
+ const level = mkLevel();
233
+ for (const variable of this.solver.vars(literal))
234
+ mergeLevel(level, this.rvar2level[variable] ?? mkLevel());
235
+ if (level.ex === NO_LEVEL && level.fa === NO_LEVEL)
236
+ throw new SmtTacticError("level not in NRA");
237
+ this.setLevel(literal >> 1, level);
238
+ return level;
239
+ }
240
+
241
+ private setLevel(boolVar: number, level: MaxLevel) {
242
+ const max = getMaxLevel(level);
243
+ while (this.preds.length <= max) this.preds.push(new ScopedLiterals(this.solver.atoms));
244
+ this.preds[max].push(2 * boolVar);
245
+ this.solver.atoms.incRef(2 * boolVar);
246
+ this.bvar2level.set(boolVar, level);
247
+ }
248
+
249
+ private project() {
250
+ if (!this.isValidModel) {
251
+ this.pop(1);
252
+ return;
253
+ }
254
+ const clause = new ScopedLiterals(this.solver.atoms);
255
+ this.mbp(this.level - 1, clause);
256
+ const clauseLevel = getMaxLevel(this.getClauseLevel(clause.literals));
257
+ clause.push(isExists(this.level) ? this.isTrue ^ 1 : this.isTrue);
258
+ this.solver.mkExternalClause(clause.literals, null);
259
+ clause.reset();
260
+ // Past the last case, the projection has auxiliary variables from root objects.
261
+ this.pop(
262
+ clauseLevel === NO_LEVEL
263
+ ? 2 * Math.floor(this.level / 2)
264
+ : clauseLevel + 2 <= this.level
265
+ ? this.level - clauseLevel
266
+ : 2,
267
+ );
268
+ }
269
+
270
+ private push() {
271
+ this.cachedAsmsLim.push(this.cachedAsms.length);
272
+ }
273
+
274
+ private pop(numScopes: number) {
275
+ this.clearModel();
276
+ const level = this.level - numScopes;
277
+ this.cachedAsms.length = this.cachedAsmsLim[level];
278
+ this.cachedAsmsLim.length = level;
279
+ }
280
+
281
+ private checkPure(formula: number) {
282
+ const manager = this.manager;
283
+ let hasDivs = false;
284
+ const visited = new Set<number>();
285
+ const todo = [formula];
286
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
287
+ if (visited.has(current)) continue;
288
+ visited.add(current);
289
+ const kind = manager.kinds[current];
290
+ if (kind === KIND_VAR) {
291
+ if (!manager.isReal(current) && !manager.isBool(current))
292
+ throw new SmtTacticError("not NRA");
293
+ continue;
294
+ }
295
+ if (kind === KIND_QUANTIFIER) {
296
+ const data = manager.getQuantifier(current);
297
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
298
+ continue;
299
+ }
300
+ manager.pushArgs(current, todo);
301
+ const op = manager.getOp(current);
302
+ if (manager.getFamily(current) === FAMILY_BASIC && op !== OP_PATTERN) continue;
303
+ if (
304
+ manager.isUninterpretedConst(current) &&
305
+ (manager.isReal(current) || manager.isBool(current))
306
+ )
307
+ continue;
308
+ if (manager.getFamily(current) === FAMILY_ARITH) {
309
+ if ([OP_MUL, OP_ADD, OP_SUB, OP_UMINUS, OP_LE, OP_GE, OP_LT, OP_GT].includes(op)) continue;
310
+ if (manager.isNumeral(current)) continue;
311
+ const exponent = op === OP_POWER ? manager.getArg(current, 1) : -1;
312
+ if (
313
+ exponent !== -1 &&
314
+ manager.isNumeral(exponent) &&
315
+ isUnsignedPositive(manager.getRationalValue(exponent))
316
+ )
317
+ continue;
318
+ if (op === OP_DIV && manager.isGroundApp(current)) {
319
+ hasDivs = true;
320
+ continue;
321
+ }
322
+ }
323
+ throw new SmtTacticError("not NRA");
324
+ }
325
+ return hasDivs;
326
+ }
327
+
328
+ private ackermanizeDiv(formula: number, paxioms: RefVector) {
329
+ const manager = this.manager;
330
+ if (!this.checkPure(formula)) return formula;
331
+ const rewriter = new DivRewriter(manager, this.trail);
332
+ const rewritten = this.pinOwned(rewriter.rewrite(formula));
333
+ rewriter.release();
334
+ this.divs = rewriter.divs;
335
+ const zero = this.pin(manager.mkRealNumeral(Rational.zero));
336
+ const mk = (op: number, args: number[], sort = SORT_BOOL) =>
337
+ this.pin(manager.mkApp(op, args, sort));
338
+ for (const [index, div] of this.divs.entries()) {
339
+ const isDenZero = mk(OP_EQ, [div.den, zero]);
340
+ paxioms.push(
341
+ mk(OP_OR, [isDenZero, mk(OP_EQ, [div.num, mk(OP_MUL, [div.den, div.name], SORT_REAL)])]),
342
+ );
343
+ for (const other of this.divs.slice(index + 1)) {
344
+ const isDiffDen = this.pin(manager.mkNot(mk(OP_EQ, [div.den, other.den])));
345
+ const isDiffNum = this.pin(manager.mkNot(mk(OP_EQ, [div.num, other.num])));
346
+ paxioms.push(mk(OP_OR, [isDiffDen, isDiffNum, mk(OP_EQ, [div.name, other.name])]));
347
+ }
348
+ }
349
+ return rewritten;
350
+ }
351
+
352
+ private getDiv0Body() {
353
+ const manager = this.manager;
354
+ const first = this.pin(manager.mkVar(0, SORT_REAL));
355
+ const second = this.pin(manager.mkVar(1, SORT_REAL));
356
+ return this.divs.reduce(
357
+ (body, div) => {
358
+ const isSameNum = this.pin(manager.mkApp(OP_EQ, [first, div.num], SORT_BOOL));
359
+ const isSameDen = this.pin(manager.mkApp(OP_EQ, [second, div.den], SORT_BOOL));
360
+ const isSame = this.pin(manager.mkApp(OP_AND, [isSameNum, isSameDen], SORT_BOOL));
361
+ return this.pin(manager.mkApp(OP_ITE, [isSame, div.name, body], SORT_REAL));
362
+ },
363
+ this.pin(manager.mkRealNumeral(Rational.zero)),
364
+ );
365
+ }
366
+
367
+ private hoist(input: number) {
368
+ const manager = this.manager;
369
+ const paxioms = new RefVector(manager);
370
+ let formula = this.ackermanizeDiv(input, paxioms);
371
+ const hoister = new QuantifierHoister(manager);
372
+ const qvars: RefVector[] = [];
373
+ const freeVars = new RefVector(manager);
374
+ getFreeVars(
375
+ manager,
376
+ this.pin(manager.mkAnd([formula, this.pin(manager.mkAnd(paxioms.items))])),
377
+ freeVars,
378
+ );
379
+ for (const freeVar of freeVars.items) this.freeVars.add(freeVar);
380
+ qvars.push(freeVars);
381
+ let isForall = false;
382
+ formula = this.pinOwned(hoister.pullQuantifier(isForall, formula, freeVars));
383
+ for (;;) {
384
+ isForall = !isForall;
385
+ const vars = new RefVector(manager);
386
+ formula = this.pinOwned(hoister.pullQuantifier(isForall, formula, vars));
387
+ qvars.push(vars);
388
+ if (vars.size === 0) break;
389
+ }
390
+ hoister.release();
391
+ for (const vars of qvars)
392
+ for (const variable of vars.items) {
393
+ this.pin(variable);
394
+ if (manager.isBool(variable)) this.a2b.set(variable, this.solver.mkBoolVar());
395
+ else this.t2x.set(variable, this.solver.mkVar(false));
396
+ }
397
+ const isTrue = this.pin(manager.mkFreshConst("is_true", SORT_BOOL));
398
+ const goal = new Goal(manager);
399
+ goal.assert(this.pin(manager.mkEq(isTrue, formula)));
400
+ for (const paxiom of paxioms.items) goal.assert(paxiom);
401
+ paxioms.reset();
402
+ const [cnfGoal] = this.cnf(goal);
403
+ this.goals.push(goal, cnfGoal);
404
+ goal2nlsat(manager, cnfGoal.forms.items, this.solver, this.t2x, this.a2b, null);
405
+ for (const [index, vars] of qvars.entries()) {
406
+ const boundBvars: number[] = [];
407
+ const boundRvars: number[] = [];
408
+ this.boundBvars.push(boundBvars);
409
+ this.boundRvars.push(boundRvars);
410
+ for (const variable of vars.items) {
411
+ const level = isExists(index) ? { ex: index, fa: NO_LEVEL } : { ex: NO_LEVEL, fa: index };
412
+ const boolVar = this.a2b.get(variable);
413
+ const realVar = this.t2x.get(variable);
414
+ if (boolVar !== undefined) {
415
+ boundBvars.push(boolVar);
416
+ this.setLevel(boolVar, level);
417
+ } else if (realVar !== undefined) {
418
+ boundRvars.push(realVar);
419
+ this.rvar2level[realVar] = level;
420
+ }
421
+ }
422
+ vars.reset();
423
+ }
424
+ for (const [term, boolVar] of this.a2b) this.b2a.set(boolVar, term);
425
+ this.isTrue = 2 * (this.a2b.get(isTrue) as number);
426
+ for (const [boolVar, atom] of this.solver.atoms.atoms.entries())
427
+ if (atom !== null) this.getLevel(2 * boolVar);
428
+ }
429
+
430
+ private mkModel() {
431
+ const manager = this.manager;
432
+ const model = new ProtoModel(manager);
433
+ for (const [term, variable] of this.t2x) {
434
+ if (!manager.isUninterpretedConst(term) || !this.freeVars.has(term)) continue;
435
+ const value = this.rmodel0[variable] ?? new Anum(Rational.zero);
436
+ model.registerConst(manager.decls[term], manager.mkAlgebraicNumeral(value, SORT_REAL));
437
+ }
438
+ for (const [atom, boolVar] of this.a2b) {
439
+ if (
440
+ !manager.isUninterpretedConst(atom) ||
441
+ boolVar === this.isTrue >> 1 ||
442
+ !this.freeVars.has(atom)
443
+ )
444
+ continue;
445
+ const value = this.bmodel0[boolVar] ?? L_UNDEF;
446
+ if (value === L_UNDEF) continue;
447
+ model.registerConst(
448
+ manager.decls[atom],
449
+ value === L_TRUE ? manager.trueExpr : manager.falseExpr,
450
+ );
451
+ }
452
+ return model;
453
+ }
454
+
455
+ apply(goal: Goal) {
456
+ const manager = this.manager;
457
+ this.hoist(this.pin(manager.mkAnd(goal.forms.items)));
458
+ const result = this.checkSat();
459
+ if (result === L_UNDEF) throw new SmtTacticError("search failed");
460
+ goal.reset();
461
+ goal.depth++;
462
+ if (result === L_FALSE) {
463
+ goal.assert(manager.falseExpr);
464
+ return [goal];
465
+ }
466
+ goal.model = this.mkModel();
467
+ if (this.divs.length > 0) goal.addDefinitions([{ decl: OP_DIV0, def: this.getDiv0Body() }]);
468
+ return [goal];
469
+ }
470
+
471
+ release() {
472
+ for (const goal of this.goals) goal.reset();
473
+ this.trail.reset();
474
+ }
475
+ }
476
+
477
+ export const runNlqsat = (manager: AstManager, seed: number, cnf: Tactic) => (goal: Goal) => {
478
+ const nlqsat = new Nlqsat(manager, seed, cnf);
479
+ try {
480
+ return nlqsat.apply(goal);
481
+ } finally {
482
+ nlqsat.release();
483
+ }
484
+ };
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/polynomial/algebraic_numbers.cpp, src/util/basic_interval.h,
2
- // src/util/mpbq.cpp, src/util/index_sort_with_mutations.h), MIT license, see z3-license.txt.
3
1
  import { SmtInvariantError } from "../../../../errors";
4
2
  import { Rational } from "../rational";
5
3
  import { getLog2, Mpbq } from "./mpbq";
@@ -81,6 +79,14 @@ interface SignedRoots {
81
79
  const getMinBq = (first: Mpbq, second: Mpbq) => (second.compare(first) < 0 ? second : first);
82
80
  const getMaxBq = (first: Mpbq, second: Mpbq) => (second.compare(first) > 0 ? second : first);
83
81
 
82
+ const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
83
+ const lower = base.lower.power(exponent);
84
+ const upper = base.upper.power(exponent);
85
+ if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
86
+ if (base.upper.isNeg) return { lower: upper, upper: lower };
87
+ return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
88
+ };
89
+
84
90
  const INTERVAL_OPS: ValueOps<BqInterval> = {
85
91
  fromInteger: (value) => ({ lower: Mpbq.of(value), upper: Mpbq.of(value) }),
86
92
  add: (first, second) => ({
@@ -96,15 +102,7 @@ const INTERVAL_OPS: ValueOps<BqInterval> = {
96
102
  ];
97
103
  return { lower: products.reduce(getMinBq), upper: products.reduce(getMaxBq) };
98
104
  },
99
- power: (base, exponent) => getIntervalPower(base, exponent),
100
- };
101
-
102
- const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
103
- const lower = base.lower.power(exponent);
104
- const upper = base.upper.power(exponent);
105
- if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
106
- if (base.upper.isNeg) return { lower: upper, upper: lower };
107
- return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
105
+ power: getIntervalPower,
108
106
  };
109
107
 
110
108
  const containsZero = (interval: BqInterval) => interval.lower.isNeg && interval.upper.isPos;
@@ -169,6 +167,37 @@ const getExtended = (values: readonly (Anum | undefined)[], variable: number, an
169
167
  return extended;
170
168
  };
171
169
 
170
+ const getSmt2Numeral = (value: bigint) => (value < 0n ? `(- ${-value})` : `${value}`);
171
+
172
+ const getSmt2Monomial = (coeff: bigint, degree: number) => {
173
+ if (degree === 0) return getSmt2Numeral(coeff);
174
+ const power = degree === 1 ? "x" : `(^ x ${degree})`;
175
+ return coeff === 1n ? power : `(* ${getSmt2Numeral(coeff)} ${power})`;
176
+ };
177
+
178
+ const getUpolynomialSmt2 = (p: Upolynomial) => {
179
+ if (p.length === 0) return "0";
180
+ const nonzero = p.flatMap((coeff, degree) => (coeff === 0n ? [] : [degree]));
181
+ if (nonzero.length === 1) return getSmt2Monomial(p[nonzero[0]], nonzero[0]);
182
+ return `(+ ${nonzero
183
+ .reverse()
184
+ .map((degree) => getSmt2Monomial(p[degree], degree))
185
+ .join(" ")})`;
186
+ };
187
+
188
+ const getRationalDecimal = (value: Rational, precision: number) => {
189
+ const magnitude = value.num < 0n ? -value.num : value.num;
190
+ const sign = value.num < 0n ? "-" : "";
191
+ let remainder = magnitude % value.den;
192
+ if (remainder === 0n) return `${sign}${magnitude / value.den}`;
193
+ const digits: string[] = [];
194
+ for (let index = 0; index < precision && remainder !== 0n; index++) {
195
+ digits.push(`${(remainder * 10n) / value.den}`);
196
+ remainder = (remainder * 10n) % value.den;
197
+ }
198
+ return `${sign}${magnitude / value.den}.${digits.join("")}${remainder === 0n ? "" : "?"}`;
199
+ };
200
+
172
201
  const hasSameCoeffs = (first: Upolynomial, second: Upolynomial) =>
173
202
  first.length === second.length && first.every((coeff, index) => coeff === second[index]);
174
203
 
@@ -213,6 +242,16 @@ export class AlgebraicManager {
213
242
  return anum.value instanceof Rational ? 1 : anum.value.p.length - 1;
214
243
  }
215
244
 
245
+ isNeg(anum: Anum) {
246
+ return anum.value instanceof Rational ? anum.value.isNegative() : !anum.value.upper.isPos;
247
+ }
248
+
249
+ toRational(anum: Anum) {
250
+ if (!this.isRational(anum) || !(anum.value instanceof Rational))
251
+ throw new SmtInvariantError("expected a rational algebraic number");
252
+ return anum.value;
253
+ }
254
+
216
255
  copy(anum: Anum) {
217
256
  return new Anum(anum.value instanceof Rational ? anum.value : anum.value.clone());
218
257
  }
@@ -347,7 +386,7 @@ export class AlgebraicManager {
347
386
  return factorUpolynomial(this.um, p, FACTOR_PARAMS);
348
387
  }
349
388
 
350
- private isolateUnivariateRoots(coeffs: Upolynomial) {
389
+ isolateUnivariateRoots(coeffs: Upolynomial) {
351
390
  const roots: Anum[] = [];
352
391
  if (coeffs.length === 0) return roots;
353
392
  const hasZeroRoot = this.um.hasZeroRoots(coeffs);
@@ -827,6 +866,80 @@ export class AlgebraicManager {
827
866
  return this.mkPower(anum, exponent);
828
867
  }
829
868
 
869
+ root(anum: Anum, k: number): Anum {
870
+ if (k === 0) throw new SmtInvariantError("0-th root is indeterminate");
871
+ if (k === 1 || this.isZero(anum)) return this.copy(anum);
872
+ if (this.isNeg(anum) && k % 2 === 0)
873
+ throw new SmtInvariantError("even root of negative number is not real");
874
+ if (anum.value instanceof Rational) return this.rootRational(anum.value, k);
875
+ return this.mkRoot(anum, k);
876
+ }
877
+
878
+ private rootRational(value: Rational, k: number) {
879
+ const exact = value.root(k);
880
+ if (exact !== undefined) return new Anum(exact);
881
+ const p = [-value.num, ...Array.from({ length: k - 1 }, () => 0n), value.den];
882
+ const converted = Mpbq.fromRational(value);
883
+ const bound = converted.isExact ? converted.value : converted.value.mul2k(1);
884
+ return value.isNegative()
885
+ ? this.mkAnum(p, bound.sub(Mpbq.one), Mpbq.zero, false)
886
+ : this.mkAnum(p, Mpbq.zero, bound.add(Mpbq.one), false);
887
+ }
888
+
889
+ // Res_y(x^k - y, p(y)) has a^(1/k) as a root.
890
+ private mkRoot(anum: Anum, k: number): Anum {
891
+ const cell = getCell(anum);
892
+ const x = this.pm.sub(this.pm.mkVar(X, k), this.pm.mkVar(Y));
893
+ const factored = this.factor(
894
+ this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y)),
895
+ );
896
+ const factors = factored.factors.factors;
897
+ const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
898
+ const saved = this.saveInterval(anum);
899
+ while (true) {
900
+ const interval = { lower: cell.lower.rootLower(k), upper: cell.upper.rootUpper(k) };
901
+ const found = this.findIsolatingFactor(factors, sequences, interval);
902
+ if (found !== null) {
903
+ this.restoreIfTooSmall(saved);
904
+ return this.setCore(found, interval, factored.isComplete);
905
+ }
906
+ if (!this.refine(anum)) {
907
+ this.restoreIfTooSmall(saved);
908
+ return this.root(anum, k);
909
+ }
910
+ }
911
+ }
912
+
913
+ getPolynomial(anum: Anum) {
914
+ return anum.value instanceof Rational ? [-anum.value.num, anum.value.den] : [...anum.value.p];
915
+ }
916
+
917
+ getIsolatingInterval(anum: Anum): [Rational, Rational] {
918
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
919
+ return [anum.value.lower.toRational(), anum.value.upper.toRational()];
920
+ }
921
+
922
+ getInterval(anum: Anum, precision: number): [Rational, Rational] {
923
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
924
+ const cell = anum.value;
925
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
926
+ return [refined.lower.toRational(), refined.upper.toRational()];
927
+ }
928
+
929
+ displayRootSmt2(anum: Anum) {
930
+ if (this.isZero(anum)) return "(root-obj x 1)";
931
+ if (anum.value instanceof Rational)
932
+ return `(root-obj ${getUpolynomialSmt2([-anum.value.num, anum.value.den])} 1)`;
933
+ return `(root-obj ${getUpolynomialSmt2(anum.value.p)} ${this.getRootIndex(anum)})`;
934
+ }
935
+
936
+ displayDecimal(anum: Anum, precision: number) {
937
+ if (anum.value instanceof Rational) return getRationalDecimal(anum.value, precision);
938
+ const cell = anum.value;
939
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
940
+ return (refined.isInterval ? refined.upper : refined.lower).toDecimal(precision);
941
+ }
942
+
830
943
  private getSumPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
831
944
  const composed = this.pm.composeXMinusY(this.pm.fromCoeffs(first.p, X), Y);
832
945
  return this.pm.toCoeffs(this.pm.resultant(composed, this.pm.fromCoeffs(second.p, Y), Y));