tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) 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 +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  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 +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  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 +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  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 +120 -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 +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -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 +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -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 +829 -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 +22 -25
  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 +262 -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 +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  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 +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -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 +2107 -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 +995 -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 +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -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 +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -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 +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  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 +2176 -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 +1210 -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 +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -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 +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,634 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_ACOS,
7
+ OP_ADD,
8
+ OP_AND,
9
+ OP_ASIN,
10
+ OP_ATAN,
11
+ OP_COS,
12
+ OP_DIV,
13
+ OP_DIV0,
14
+ OP_EQ,
15
+ OP_GE,
16
+ OP_GT,
17
+ OP_IDIV,
18
+ OP_IDIV0,
19
+ OP_IMPLIES,
20
+ OP_ITE,
21
+ OP_LE,
22
+ OP_LT,
23
+ OP_MOD,
24
+ OP_MOD0,
25
+ OP_MUL,
26
+ OP_NEG_ROOT,
27
+ OP_NOT,
28
+ OP_OR,
29
+ OP_POWER,
30
+ OP_POWER0,
31
+ OP_SIN,
32
+ OP_TAN,
33
+ OP_TO_INT,
34
+ OP_TO_REAL,
35
+ OP_U_ACOS,
36
+ OP_U_ASIN,
37
+ OP_UMINUS,
38
+ SORT_BOOL,
39
+ SORT_INT,
40
+ SORT_REAL,
41
+ } from "./ast";
42
+ import type { Definition, Goal } from "./goal";
43
+ import { ObjMap } from "./hashtable";
44
+ import { Rational } from "./rational";
45
+ import { RefVector } from "./ref-vector";
46
+ import { RewriterTpl } from "./rewriter-tpl";
47
+
48
+ interface BinDef {
49
+ x: number;
50
+ y: number;
51
+ d: number;
52
+ }
53
+
54
+ interface PurifyOptions {
55
+ isElimRootObjects: boolean;
56
+ isElimInverses: boolean;
57
+ isComplete: boolean;
58
+ }
59
+
60
+ class PurifyState {
61
+ readonly pinned: RefVector;
62
+ readonly unsafe = new Set<number>();
63
+ isUnsafeFound = false;
64
+ readonly sinCos: ObjMap<[number, number]>;
65
+ readonly cannotPurify = new Set<number>();
66
+ readonly appToFresh: ObjMap<number>;
67
+ readonly newConstraints: number[] = [];
68
+ readonly divs: BinDef[] = [];
69
+ readonly idivs: BinDef[] = [];
70
+ readonly mods: BinDef[] = [];
71
+ ipower0 = -1;
72
+ rpower0 = -1;
73
+
74
+ constructor(
75
+ readonly manager: AstManager,
76
+ readonly goal: Goal,
77
+ readonly options: PurifyOptions,
78
+ ) {
79
+ this.pinned = new RefVector(manager);
80
+ this.sinCos = new ObjMap((expr) => manager.hashes[expr]);
81
+ this.appToFresh = new ObjMap((expr) => manager.hashes[expr]);
82
+ this.initCannotPurify();
83
+ }
84
+
85
+ pin(expr: number) {
86
+ this.pinned.push(expr);
87
+ return expr;
88
+ }
89
+
90
+ private forEachApp(visit: (expr: number) => void) {
91
+ const manager = this.manager;
92
+ const seen = new Set<number>();
93
+ for (const form of this.goal.forms.items) {
94
+ const todo = [form];
95
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
96
+ if (seen.has(expr)) continue;
97
+ seen.add(expr);
98
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
99
+ todo.push(manager.getQuantifier(expr).body);
100
+ continue;
101
+ }
102
+ if (manager.kinds[expr] !== KIND_APP) continue;
103
+ visit(expr);
104
+ manager.pushArgs(expr, todo);
105
+ }
106
+ }
107
+ }
108
+
109
+ private initCannotPurify() {
110
+ const manager = this.manager;
111
+ this.forEachApp((expr) => {
112
+ if (manager.getArgs(expr).some((arg) => !manager.isGroundApp(arg)))
113
+ this.cannotPurify.add(manager.decls[expr]);
114
+ });
115
+ }
116
+
117
+ private findUnsafe() {
118
+ if (this.isUnsafeFound) return;
119
+ const manager = this.manager;
120
+ this.forEachApp((expr) => {
121
+ const op = manager.getFamily(expr) === FAMILY_ARITH ? manager.getOp(expr) : -1;
122
+ if (op === OP_SIN || op === OP_COS) return;
123
+ for (const arg of manager.getArgs(expr)) this.unsafe.add(arg);
124
+ });
125
+ this.isUnsafeFound = true;
126
+ }
127
+
128
+ convertBasis(theta: number): [number, number] | undefined {
129
+ const manager = this.manager;
130
+ if (manager.kinds[theta] !== KIND_APP || !manager.isUninterpretedConst(theta)) return undefined;
131
+ this.findUnsafe();
132
+ if (this.unsafe.has(theta)) return undefined;
133
+ const existing = this.sinCos.get(theta);
134
+ if (existing !== undefined) return existing;
135
+ const pair: [number, number] = [
136
+ this.pin(manager.mkFreshConst(null, SORT_REAL)),
137
+ this.pin(manager.mkFreshConst(null, SORT_REAL)),
138
+ ];
139
+ this.sinCos.set(theta, pair);
140
+ this.pin(theta);
141
+ return pair;
142
+ }
143
+ }
144
+
145
+ class PurifyRewriter extends RewriterTpl {
146
+ constructor(
147
+ manager: AstManager,
148
+ private state: PurifyState,
149
+ ) {
150
+ super(manager);
151
+ }
152
+
153
+ private mk(op: number, args: number[], sort = SORT_BOOL) {
154
+ return this.state.pin(this.manager.mkApp(op, args, sort));
155
+ }
156
+
157
+ private mkNumeral(value: Rational, isInt: boolean) {
158
+ return this.state.pin(this.manager.mkNumeralOfSort(value, isInt ? SORT_INT : SORT_REAL));
159
+ }
160
+
161
+ private mkFreshVar(isInt: boolean) {
162
+ return this.state.pin(this.manager.mkFreshConst(null, isInt ? SORT_INT : SORT_REAL));
163
+ }
164
+
165
+ private cacheResult(expr: number, result: number) {
166
+ this.state.appToFresh.set(this.state.pin(expr), this.state.pin(result));
167
+ }
168
+
169
+ private pushConstraint(constraint: number) {
170
+ this.state.newConstraints.push(constraint);
171
+ }
172
+
173
+ private processDiv(decl: number, args: number[]) {
174
+ const state = this.state;
175
+ const expr = this.mk(decl, args, SORT_REAL);
176
+ const processed = state.appToFresh.get(expr);
177
+ if (processed !== undefined) return processed;
178
+ const fresh = this.mkFreshVar(false);
179
+ this.cacheResult(expr, fresh);
180
+ const [x, y] = args;
181
+ const yIsZero = this.mk(OP_EQ, [y, this.mkNumeral(Rational.zero, false)]);
182
+ this.pushConstraint(
183
+ this.mk(OP_OR, [yIsZero, this.mk(OP_EQ, [this.mk(OP_MUL, [y, fresh], SORT_REAL), x])]),
184
+ );
185
+ if (state.options.isComplete)
186
+ this.pushConstraint(
187
+ this.mk(OP_OR, [
188
+ this.mk(OP_NOT, [yIsZero]),
189
+ this.mk(OP_EQ, [
190
+ fresh,
191
+ this.mk(OP_DIV, [x, this.mkNumeral(Rational.zero, false)], SORT_REAL),
192
+ ]),
193
+ ]),
194
+ );
195
+ state.divs.push({ x, y, d: fresh });
196
+ return fresh;
197
+ }
198
+
199
+ private processIdiv(decl: number, args: number[]) {
200
+ const manager = this.manager;
201
+ const state = this.state;
202
+ const divApp = this.mk(decl, args, SORT_INT);
203
+ const processed = state.appToFresh.get(divApp);
204
+ if (processed !== undefined) return processed;
205
+ const quotient = this.mkFreshVar(true);
206
+ this.cacheResult(divApp, quotient);
207
+ const remainder = this.mkFreshVar(true);
208
+ const [x, y] = args;
209
+ const modApp = this.mk(OP_MOD, [x, y], SORT_INT);
210
+ this.cacheResult(modApp, remainder);
211
+ state.mods.push({ x, y, d: remainder });
212
+ const zero = this.mkNumeral(Rational.zero, true);
213
+ const yIsZero = this.mk(OP_EQ, [y, zero]);
214
+ const product = this.mk(OP_MUL, [quotient, y], SORT_INT);
215
+ this.pushConstraint(
216
+ this.mk(OP_OR, [
217
+ yIsZero,
218
+ this.mk(OP_EQ, [x, this.mk(OP_ADD, [product, remainder], SORT_INT)]),
219
+ ]),
220
+ );
221
+ this.pushConstraint(this.mk(OP_OR, [yIsZero, this.mk(OP_LE, [zero, remainder])]));
222
+ this.pushConstraint(
223
+ this.mk(OP_OR, [this.mk(OP_LE, [y, zero]), this.mk(OP_LT, [remainder, y])]),
224
+ );
225
+ const negated = this.mk(OP_MUL, [this.mkNumeral(Rational.minusOne, true), y], SORT_INT);
226
+ this.pushConstraint(
227
+ this.mk(OP_OR, [this.mk(OP_GE, [y, zero]), this.mk(OP_LT, [remainder, negated])]),
228
+ );
229
+ if (
230
+ state.options.isComplete &&
231
+ (!manager.isNumeral(y) || manager.getRationalValue(y).isZero())
232
+ ) {
233
+ const yIsNonzero = this.mk(OP_NOT, [yIsZero]);
234
+ this.pushConstraint(
235
+ this.mk(OP_OR, [
236
+ yIsNonzero,
237
+ this.mk(OP_EQ, [quotient, this.mk(OP_IDIV, [x, zero], SORT_INT)]),
238
+ ]),
239
+ );
240
+ this.pushConstraint(
241
+ this.mk(OP_OR, [
242
+ yIsNonzero,
243
+ this.mk(OP_EQ, [remainder, this.mk(OP_MOD, [x, zero], SORT_INT)]),
244
+ ]),
245
+ );
246
+ }
247
+ state.idivs.push({ x, y, d: quotient });
248
+ return quotient;
249
+ }
250
+
251
+ private processMod(decl: number, args: number[]) {
252
+ const expr = this.mk(decl, args, SORT_INT);
253
+ const processed = this.state.appToFresh.get(expr);
254
+ if (processed !== undefined) return processed;
255
+ this.processIdiv(decl, args);
256
+ return this.state.appToFresh.get(expr) as number;
257
+ }
258
+
259
+ private processToInt(decl: number, args: number[]) {
260
+ const expr = this.mk(decl, args, SORT_INT);
261
+ const processed = this.state.appToFresh.get(expr);
262
+ if (processed !== undefined) return processed;
263
+ const fresh = this.mkFreshVar(true);
264
+ this.cacheResult(expr, fresh);
265
+ const minusOne = this.mkNumeral(Rational.minusOne, false);
266
+ const realFresh = this.mk(OP_TO_REAL, [fresh], SORT_REAL);
267
+ const diff = this.mk(
268
+ OP_ADD,
269
+ [args[0], this.mk(OP_MUL, [minusOne, realFresh], SORT_REAL)],
270
+ SORT_REAL,
271
+ );
272
+ this.pushConstraint(this.mk(OP_GE, [diff, this.mkNumeral(Rational.zero, false)]));
273
+ this.pushConstraint(
274
+ this.mk(OP_NOT, [this.mk(OP_GE, [diff, this.mkNumeral(Rational.one, false)])]),
275
+ );
276
+ return fresh;
277
+ }
278
+
279
+ private processPower(decl: number, args: number[]) {
280
+ const manager = this.manager;
281
+ const state = this.state;
282
+ if (!manager.isNumeral(args[1])) return -1;
283
+ const exponent = manager.getRationalValue(args[1]);
284
+ if (exponent.isInt() && !exponent.isZero()) return -1;
285
+ const expr = this.mk(decl, args, SORT_REAL);
286
+ const processed = state.appToFresh.get(expr);
287
+ if (processed !== undefined) return processed;
288
+ const x = args[0];
289
+ const isInt = manager.sorts[x] === SORT_INT;
290
+ const fresh = this.mkFreshVar(false);
291
+ this.cacheResult(expr, fresh);
292
+ const zero = this.mkNumeral(Rational.zero, isInt);
293
+ const one = this.mkNumeral(Rational.one, isInt);
294
+ if (exponent.isZero()) {
295
+ if (isInt && state.ipower0 === -1) state.ipower0 = this.mkFreshVar(false);
296
+ if (!isInt && state.rpower0 === -1) state.rpower0 = this.mkFreshVar(false);
297
+ const power0 = isInt ? state.ipower0 : state.rpower0;
298
+ const xIsZero = this.mk(OP_EQ, [x, zero]);
299
+ this.pushConstraint(this.mk(OP_OR, [xIsZero, this.mk(OP_EQ, [fresh, one])]));
300
+ this.pushConstraint(
301
+ this.mk(OP_OR, [this.mk(OP_NOT, [xIsZero]), this.mk(OP_EQ, [fresh, power0])]),
302
+ );
303
+ return fresh;
304
+ }
305
+ // Z3 leaves a root of an integer, though it keeps the fresh constant it cached for it.
306
+ if (isInt) return -1;
307
+ const degree = this.mkNumeral(Rational.of(exponent.den), false);
308
+ const rootEq = this.mk(OP_EQ, [x, this.mk(OP_POWER, [fresh, degree], SORT_REAL)]);
309
+ if (exponent.den % 2n !== 0n) {
310
+ this.pushConstraint(rootEq);
311
+ return fresh;
312
+ }
313
+ const xGeZero = this.mk(OP_GE, [x, zero]);
314
+ this.pushConstraint(
315
+ this.mk(OP_OR, [
316
+ this.mk(OP_NOT, [xGeZero]),
317
+ this.mk(OP_AND, [rootEq, this.mk(OP_GE, [fresh, zero])]),
318
+ ]),
319
+ );
320
+ this.pushConstraint(
321
+ this.mk(OP_OR, [
322
+ xGeZero,
323
+ this.mk(OP_EQ, [fresh, this.mk(OP_NEG_ROOT, [x, degree], SORT_REAL)]),
324
+ ]),
325
+ );
326
+ return fresh;
327
+ }
328
+
329
+ private processIrrational(expr: number) {
330
+ const manager = this.manager;
331
+ const state = this.state;
332
+ const processed = state.appToFresh.get(expr);
333
+ if (processed !== undefined) return processed;
334
+ const fresh = this.mkFreshVar(false);
335
+ this.cacheResult(expr, fresh);
336
+ const am = manager.am;
337
+ const value = manager.getAlgebraicValue(expr);
338
+ const terms = am.getPolynomial(value).flatMap((coeff, degree) => {
339
+ if (coeff === 0n) return [];
340
+ const numeral = this.mkNumeral(Rational.of(coeff), false);
341
+ if (degree === 0) return [numeral];
342
+ const power =
343
+ degree === 1
344
+ ? fresh
345
+ : this.mk(
346
+ OP_POWER,
347
+ [fresh, this.mkNumeral(Rational.of(BigInt(degree)), false)],
348
+ SORT_REAL,
349
+ );
350
+ return [this.mk(OP_MUL, [numeral, power], SORT_REAL)];
351
+ });
352
+ const interval = am.getIsolatingInterval(value);
353
+ this.pushConstraint(
354
+ this.mk(OP_EQ, [this.mk(OP_ADD, terms, SORT_REAL), this.mkNumeral(Rational.zero, false)]),
355
+ );
356
+ this.pushConstraint(this.mk(OP_LT, [this.mkNumeral(interval[0], false), fresh]));
357
+ this.pushConstraint(this.mk(OP_LT, [fresh, this.mkNumeral(interval[1], false)]));
358
+ return fresh;
359
+ }
360
+
361
+ private processSinCos(isSin: boolean, decl: number, theta: number) {
362
+ const pair = this.state.convertBasis(theta);
363
+ const one = this.mkNumeral(Rational.one, false);
364
+ if (pair !== undefined) {
365
+ const result = isSin ? pair[0] : pair[1];
366
+ this.cacheResult(this.mk(decl, [theta], SORT_REAL), result);
367
+ const squares = pair.map((value) => this.mk(OP_MUL, [value, value], SORT_REAL));
368
+ this.pushConstraint(this.mk(OP_EQ, [one, this.mk(OP_ADD, squares, SORT_REAL)]));
369
+ return result;
370
+ }
371
+ const squares = [OP_SIN, OP_COS].map((op) => {
372
+ const value = this.mk(op, [theta], SORT_REAL);
373
+ return this.mk(OP_MUL, [value, value], SORT_REAL);
374
+ });
375
+ this.pushConstraint(this.mk(OP_EQ, [one, this.mk(OP_ADD, squares, SORT_REAL)]));
376
+ return -1;
377
+ }
378
+
379
+ // Inside [-1, 1], k is asin on its principal range. Outside it, k is asin-u when the
380
+ // purification is complete.
381
+ private processAsin(decl: number, x: number) {
382
+ const state = this.state;
383
+ if (!state.options.isElimInverses) return -1;
384
+ const expr = this.mk(decl, [x], SORT_REAL);
385
+ const processed = state.appToFresh.get(expr);
386
+ if (processed !== undefined) return processed;
387
+ const fresh = this.mkFreshVar(false);
388
+ this.cacheResult(expr, fresh);
389
+ const one = this.mkNumeral(Rational.one, false);
390
+ const minusOne = this.mkNumeral(Rational.minusOne, false);
391
+ const halfPi = this.mkHalfPi(1n);
392
+ const minusHalfPi = this.mkHalfPi(-1n);
393
+ const xGeMinusOne = this.mk(OP_GE, [x, minusOne]);
394
+ const xLtMinusOne = this.mk(OP_NOT, [xGeMinusOne]);
395
+ const xLeOne = this.mk(OP_LE, [x, one]);
396
+ const outside = this.mk(OP_OR, [xLtMinusOne, this.mk(OP_NOT, [xLeOne])]);
397
+ const sinEq = this.mk(OP_EQ, [x, this.mk(OP_SIN, [fresh], SORT_REAL)]);
398
+ const freshGeMinusHalfPi = this.mk(OP_GE, [fresh, minusHalfPi]);
399
+ this.pushConstraint(
400
+ this.mk(OP_OR, [
401
+ outside,
402
+ this.mk(OP_AND, [
403
+ sinEq,
404
+ this.mk(OP_AND, [freshGeMinusHalfPi, this.mk(OP_LE, [fresh, halfPi])]),
405
+ ]),
406
+ ]),
407
+ );
408
+ if (state.options.isComplete) {
409
+ const unspecified = this.mk(OP_U_ASIN, [x], SORT_REAL);
410
+ this.pushConstraint(this.mk(OP_OR, [xGeMinusOne, this.mk(OP_EQ, [fresh, unspecified])]));
411
+ this.pushConstraint(this.mk(OP_OR, [xLeOne, this.mk(OP_EQ, [fresh, unspecified])]));
412
+ }
413
+ return fresh;
414
+ }
415
+
416
+ // Inside [-1, 1], k is acos on its principal range. Outside it, k is acos-u when the
417
+ // purification is complete.
418
+ private processAcos(decl: number, x: number) {
419
+ const state = this.state;
420
+ if (!state.options.isElimInverses) return -1;
421
+ const expr = this.mk(decl, [x], SORT_REAL);
422
+ const processed = state.appToFresh.get(expr);
423
+ if (processed !== undefined) return processed;
424
+ const fresh = this.mkFreshVar(false);
425
+ this.cacheResult(expr, fresh);
426
+ const one = this.mkNumeral(Rational.one, false);
427
+ const minusOne = this.mkNumeral(Rational.minusOne, false);
428
+ const pi = this.manager.piExpr;
429
+ const zero = this.mkNumeral(Rational.zero, false);
430
+ const xGeMinusOne = this.mk(OP_GE, [x, minusOne]);
431
+ const xLtMinusOne = this.mk(OP_NOT, [xGeMinusOne]);
432
+ const xLeOne = this.mk(OP_LE, [x, one]);
433
+ const outside = this.mk(OP_OR, [xLtMinusOne, this.mk(OP_NOT, [xLeOne])]);
434
+ const cosEq = this.mk(OP_EQ, [x, this.mk(OP_COS, [fresh], SORT_REAL)]);
435
+ const freshGeZero = this.mk(OP_GE, [fresh, zero]);
436
+ this.pushConstraint(
437
+ this.mk(OP_OR, [
438
+ outside,
439
+ this.mk(OP_AND, [cosEq, this.mk(OP_AND, [freshGeZero, this.mk(OP_LE, [fresh, pi])])]),
440
+ ]),
441
+ );
442
+ if (state.options.isComplete) {
443
+ const unspecified = this.mk(OP_U_ACOS, [x], SORT_REAL);
444
+ this.pushConstraint(this.mk(OP_OR, [xGeMinusOne, this.mk(OP_EQ, [fresh, unspecified])]));
445
+ this.pushConstraint(this.mk(OP_OR, [xLeOne, this.mk(OP_EQ, [fresh, unspecified])]));
446
+ }
447
+ return fresh;
448
+ }
449
+
450
+ private mkHalfPi(sign: bigint) {
451
+ return this.mk(
452
+ OP_MUL,
453
+ [this.mkNumeral(Rational.of(sign, 2n), false), this.manager.piExpr],
454
+ SORT_REAL,
455
+ );
456
+ }
457
+
458
+ private processAtan(decl: number, x: number) {
459
+ const state = this.state;
460
+ if (!state.options.isElimInverses) return -1;
461
+ const expr = this.mk(decl, [x], SORT_REAL);
462
+ const processed = state.appToFresh.get(expr);
463
+ if (processed !== undefined) return processed;
464
+ const fresh = this.mkFreshVar(false);
465
+ this.cacheResult(expr, fresh);
466
+ const halfPi = this.mkHalfPi(1n);
467
+ const minusHalfPi = this.mkHalfPi(-1n);
468
+ const tanEq = this.mk(OP_EQ, [x, this.mk(OP_TAN, [fresh], SORT_REAL)]);
469
+ this.pushConstraint(
470
+ this.mk(OP_AND, [
471
+ tanEq,
472
+ this.mk(OP_AND, [this.mk(OP_GT, [fresh, minusHalfPi]), this.mk(OP_LT, [fresh, halfPi])]),
473
+ ]),
474
+ );
475
+ return fresh;
476
+ }
477
+
478
+ private reduce(decl: number, args: number[]) {
479
+ const manager = this.manager;
480
+ const state = this.state;
481
+ const funcDecl = manager.funcDecls[decl];
482
+ if (funcDecl.family !== FAMILY_ARITH || state.cannotPurify.has(decl)) return -1;
483
+ switch (funcDecl.op) {
484
+ case OP_DIV:
485
+ return this.processDiv(decl, args);
486
+ case OP_IDIV:
487
+ return state.cannotPurify.size > 0 ? -1 : this.processIdiv(decl, args);
488
+ case OP_MOD:
489
+ return state.cannotPurify.size > 0 ? -1 : this.processMod(decl, args);
490
+ case OP_TO_INT:
491
+ return this.processToInt(decl, args);
492
+ case OP_POWER:
493
+ return this.processPower(decl, args);
494
+ case OP_ASIN:
495
+ return this.processAsin(decl, args[0]);
496
+ case OP_ACOS:
497
+ return this.processAcos(decl, args[0]);
498
+ case OP_SIN:
499
+ return this.processSinCos(true, decl, args[0]);
500
+ case OP_COS:
501
+ return this.processSinCos(false, decl, args[0]);
502
+ case OP_ATAN:
503
+ return this.processAtan(decl, args[0]);
504
+ default:
505
+ return -1;
506
+ }
507
+ }
508
+
509
+ reduceApp(decl: number, args: number[]) {
510
+ const result = this.reduce(decl, args);
511
+ if (result !== -1) this.manager.incRef(result);
512
+ return result;
513
+ }
514
+
515
+ getSubst(expr: number) {
516
+ const manager = this.manager;
517
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
518
+ const nested = new PurifyRewriter(manager, this.state);
519
+ const data = manager.getQuantifier(expr);
520
+ const body = nested.engine.rewrite(data.body);
521
+ nested.release();
522
+ const result = this.state.pin(manager.mkQuantifier({ ...data, body }));
523
+ manager.decRef(body);
524
+ return result;
525
+ }
526
+ if (manager.isAlgebraicNumeral(expr) && this.state.options.isElimRootObjects)
527
+ return this.processIrrational(expr);
528
+ return undefined;
529
+ }
530
+ }
531
+
532
+ const mkCongruence = (state: PurifyState, defs: BinDef[], goal: Goal) => {
533
+ const manager = state.manager;
534
+ for (const [index, first] of defs.entries())
535
+ for (const second of defs.slice(index + 1)) {
536
+ const sameX = state.pin(manager.mkApp(OP_EQ, [first.x, second.x], SORT_BOOL));
537
+ const sameY = state.pin(manager.mkApp(OP_EQ, [first.y, second.y], SORT_BOOL));
538
+ const sameArgs = state.pin(manager.mkApp(OP_AND, [sameX, sameY], SORT_BOOL));
539
+ const sameD = state.pin(manager.mkApp(OP_EQ, [first.d, second.d], SORT_BOOL));
540
+ goal.assert(state.pin(manager.mkApp(OP_IMPLIES, [sameArgs, sameD], SORT_BOOL)));
541
+ }
542
+ };
543
+
544
+ // The interpretation of an unspecified operator that maps the arguments of each purified
545
+ // application to its fresh constant.
546
+ const mkTable = (state: PurifyState, defs: BinDef[], sort: number) => {
547
+ const manager = state.manager;
548
+ const pin = (expr: number) => state.pin(expr);
549
+ const first = pin(manager.mkVar(0, sort));
550
+ const second = pin(manager.mkVar(1, sort));
551
+ return defs.reduce(
552
+ (body, def) => {
553
+ const sameX = pin(manager.mkApp(OP_EQ, [first, def.x], SORT_BOOL));
554
+ const sameArgs = pin(
555
+ manager.mkApp(
556
+ OP_AND,
557
+ [sameX, pin(manager.mkApp(OP_EQ, [second, def.y], SORT_BOOL))],
558
+ SORT_BOOL,
559
+ ),
560
+ );
561
+ return pin(manager.mkApp(OP_ITE, [sameArgs, def.d, body], sort));
562
+ },
563
+ pin(manager.mkNumeralOfSort(Rational.zero, sort)),
564
+ );
565
+ };
566
+
567
+ export const purifyArith = (manager: AstManager, goal: Goal, options: PurifyOptions) => {
568
+ const state = new PurifyState(manager, goal, options);
569
+ const rewriter = new PurifyRewriter(manager, state);
570
+ const pin = (expr: number) => state.pin(expr);
571
+ for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
572
+ const rewritten = rewriter.engine.rewrite(goal.forms.items[index]);
573
+ goal.update(index, rewritten, goal.getDependency(index));
574
+ manager.decRef(rewritten);
575
+ }
576
+ rewriter.release();
577
+ for (const constraint of state.newConstraints) goal.assert(constraint);
578
+ mkCongruence(state, state.divs, goal);
579
+ mkCongruence(state, state.mods, goal);
580
+ mkCongruence(state, state.idivs, goal);
581
+ if (goal.isModelsEnabled) {
582
+ const definitions: Definition[] = [...state.appToFresh.entries()].map((entry) => ({
583
+ decl: manager.decls[entry[1]],
584
+ def: -1,
585
+ }));
586
+ if (state.divs.length > 0)
587
+ definitions.push({ decl: OP_DIV0, def: mkTable(state, state.divs, SORT_REAL) });
588
+ if (state.mods.length > 0) {
589
+ const body = mkTable(state, state.mods, SORT_INT);
590
+ definitions.push({ decl: OP_MOD0, def: body });
591
+ const isNonneg = pin(
592
+ manager.mkApp(
593
+ OP_GE,
594
+ [pin(manager.mkVar(1, SORT_INT)), pin(manager.mkNumeralOfSort(Rational.zero, SORT_INT))],
595
+ SORT_BOOL,
596
+ ),
597
+ );
598
+ const negated = pin(manager.mkApp(OP_UMINUS, [body], SORT_INT));
599
+ definitions.push({
600
+ decl: OP_MOD0,
601
+ def: pin(manager.mkApp(OP_ITE, [isNonneg, body, negated], SORT_INT)),
602
+ });
603
+ }
604
+ if (state.idivs.length > 0)
605
+ definitions.push({ decl: OP_IDIV0, def: mkTable(state, state.idivs, SORT_INT) });
606
+ if (state.ipower0 !== -1) definitions.push({ decl: OP_POWER0, def: state.ipower0 });
607
+ if (state.rpower0 !== -1) definitions.push({ decl: OP_POWER0, def: state.rpower0 });
608
+ goal.addDefinitions(definitions);
609
+ if (state.sinCos.size > 0) {
610
+ const zero = pin(manager.mkRealNumeral(Rational.zero));
611
+ goal.addDefinitions(
612
+ [...state.sinCos.entries()].map((entry) => {
613
+ const [sin, cos] = entry[1];
614
+ const isNonneg = pin(manager.mkApp(OP_GE, [sin, zero], SORT_BOOL));
615
+ const acos = pin(manager.mkApp(OP_ACOS, [cos], SORT_REAL));
616
+ const negated = pin(manager.mkApp(OP_UMINUS, [cos], SORT_REAL));
617
+ const shifted = pin(
618
+ manager.mkApp(
619
+ OP_ADD,
620
+ [pin(manager.mkApp(OP_ACOS, [negated], SORT_REAL)), manager.piExpr],
621
+ SORT_REAL,
622
+ ),
623
+ );
624
+ return {
625
+ decl: manager.decls[entry[0]],
626
+ def: pin(manager.mkApp(OP_ITE, [isNonneg, acos, shifted], SORT_REAL)),
627
+ };
628
+ }),
629
+ );
630
+ }
631
+ }
632
+ goal.depth++;
633
+ state.pinned.reset();
634
+ };
@@ -0,0 +1,37 @@
1
+ import { OP_ITE, SORT_BOOL } from "./ast";
2
+ import { RewriterTpl } from "./rewriter-tpl";
3
+
4
+ export class NgPushAppIteRw extends RewriterTpl {
5
+ isRewritingPatterns() {
6
+ return false;
7
+ }
8
+
9
+ private isTarget(decl: number, args: number[]) {
10
+ const manager = this.manager;
11
+ if (decl === OP_ITE) return false;
12
+ let hasTermIte = false;
13
+ for (let index = 0; index < args.length; index++)
14
+ if (manager.getOp(args[index]) === OP_ITE && manager.sorts[args[index]] !== SORT_BOOL) {
15
+ if (hasTermIte) return false;
16
+ hasTermIte = true;
17
+ }
18
+ if (!hasTermIte) return false;
19
+ for (let index = 0; index < args.length; index++)
20
+ if (!manager.isGroundApp(args[index])) return true;
21
+ return false;
22
+ }
23
+
24
+ reduceApp(decl: number, args: number[], sort: number) {
25
+ const manager = this.manager;
26
+ if (!this.isTarget(decl, args)) return -1;
27
+ let index = 0;
28
+ while (manager.getOp(args[index]) !== OP_ITE) index++;
29
+ const ite = args[index];
30
+ const expr = manager.withTemporaries(() => {
31
+ const thenApp = manager.mkApp(decl, args.with(index, manager.getArg(ite, 1)), sort);
32
+ const elseApp = manager.mkApp(decl, args.with(index, manager.getArg(ite, 2)), sort);
33
+ return manager.mkApp(OP_ITE, [manager.getArg(ite, 0), thenApp, elseApp], sort);
34
+ });
35
+ return { expr, depth: 2 };
36
+ }
37
+ }