tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b

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 (574) 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 +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +43 -42
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +43 -40
  19. package/dist/transfer.js +42 -39
  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 -36
  24. package/src/bags.ts +47 -28
  25. package/src/builtins.ts +4 -13
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +476 -590
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/shared.ts +1 -1
  32. package/src/cli/tlapm.ts +433 -70
  33. package/src/cli/tlc-arguments.ts +224 -212
  34. package/src/cli/tlc-output.ts +686 -0
  35. package/src/cli/tlc-usage.ts +1 -2
  36. package/src/cli/tlc.ts +60 -708
  37. package/src/cli/xml-exporter.ts +23 -33
  38. package/src/codegen.ts +5 -10
  39. package/src/coverage.ts +3 -10
  40. package/src/dependencies.ts +30 -14
  41. package/src/dfid.ts +25 -18
  42. package/src/environment-config.ts +315 -0
  43. package/src/environment.ts +73 -338
  44. package/src/errors.ts +33 -5
  45. package/src/evaluate.ts +14 -7
  46. package/src/exit-codes.ts +3 -0
  47. package/src/fingerprints.ts +65 -1
  48. package/src/instances.ts +47 -10
  49. package/src/java-hash.ts +7 -0
  50. package/src/json.ts +4 -7
  51. package/src/levels.ts +42 -44
  52. package/src/lexer.ts +5 -3
  53. package/src/liveness-checker.ts +597 -240
  54. package/src/liveness.ts +94 -86
  55. package/src/obligations/action.ts +14 -17
  56. package/src/obligations/anonymize.ts +37 -16
  57. package/src/obligations/enabled-axioms.ts +218 -0
  58. package/src/obligations/equality.ts +1 -3
  59. package/src/obligations/expression.ts +36 -8
  60. package/src/obligations/format.ts +0 -2
  61. package/src/obligations/generate.ts +66 -54
  62. package/src/obligations/index.ts +38 -8
  63. package/src/obligations/levels.ts +24 -11
  64. package/src/obligations/module.ts +28 -41
  65. package/src/obligations/normalize.ts +26 -14
  66. package/src/obligations/operators.ts +0 -2
  67. package/src/obligations/pragma.ts +53 -16
  68. package/src/obligations/printer.ts +43 -13
  69. package/src/obligations/proof.ts +3 -2
  70. package/src/obligations/regroup.ts +0 -2
  71. package/src/obligations/simplify.ts +55 -50
  72. package/src/obligations/source.ts +118 -74
  73. package/src/obligations/subexpression.ts +45 -18
  74. package/src/obligations/substitution.ts +1 -3
  75. package/src/obligations/temporal.ts +5 -7
  76. package/src/obligations/tuples.ts +0 -2
  77. package/src/parallel-worker.ts +17 -31
  78. package/src/parallel.ts +29 -47
  79. package/src/parser.ts +652 -220
  80. package/src/pretty-print.ts +1 -1
  81. package/src/prover/decide-pool.ts +3 -3
  82. package/src/prover/deciders.ts +12 -9
  83. package/src/prover/isabelle/decide.ts +3 -25
  84. package/src/prover/isabelle/encode.ts +72 -42
  85. package/src/prover/isabelle/isar/attrib.ts +250 -0
  86. package/src/prover/isabelle/isar/context.ts +335 -0
  87. package/src/prover/isabelle/isar/induct.ts +382 -0
  88. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  89. package/src/prover/isabelle/isar/method.ts +509 -212
  90. package/src/prover/isabelle/isar/proof.ts +570 -14
  91. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  92. package/src/prover/isabelle/isar/theory.ts +487 -76
  93. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  94. package/src/prover/isabelle/isar/type-check.ts +89 -14
  95. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  96. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  99. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  101. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  102. package/src/prover/isabelle/provers/classical.ts +45 -20
  103. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  104. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  105. package/src/prover/isabelle/pure/consts.ts +0 -2
  106. package/src/prover/isabelle/pure/conv.ts +2 -10
  107. package/src/prover/isabelle/pure/drule.ts +72 -6
  108. package/src/prover/isabelle/pure/envir.ts +0 -2
  109. package/src/prover/isabelle/pure/goal.ts +1 -3
  110. package/src/prover/isabelle/pure/logic.ts +1 -3
  111. package/src/prover/isabelle/pure/name.ts +0 -2
  112. package/src/prover/isabelle/pure/net.ts +0 -2
  113. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  114. package/src/prover/isabelle/pure/pattern.ts +0 -2
  115. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  116. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  117. package/src/prover/isabelle/pure/search.ts +0 -2
  118. package/src/prover/isabelle/pure/seq.ts +0 -2
  119. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  120. package/src/prover/isabelle/pure/table.ts +2 -3
  121. package/src/prover/isabelle/pure/tactic.ts +0 -2
  122. package/src/prover/isabelle/pure/tactical.ts +42 -37
  123. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  124. package/src/prover/isabelle/pure/term.ts +0 -2
  125. package/src/prover/isabelle/pure/thm.ts +14 -13
  126. package/src/prover/isabelle/pure/type.ts +0 -2
  127. package/src/prover/isabelle/pure/unify.ts +0 -2
  128. package/src/prover/isabelle/pure/variable.ts +0 -2
  129. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  130. package/src/prover/isabelle/tla/context.ts +58 -11
  131. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  132. package/src/prover/isabelle/tla/logic.ts +49 -21
  133. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  134. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  135. package/src/prover/ocaml.ts +4 -1
  136. package/src/prover/prep/action.ts +30 -31
  137. package/src/prover/prep/enabled-axioms.ts +11 -2
  138. package/src/prover/prep/fingerprint.ts +2 -5
  139. package/src/prover/prep/methods.ts +181 -51
  140. package/src/prover/prep/normalize.ts +38 -9
  141. package/src/prover/prove.ts +395 -94
  142. package/src/prover/ptl/decide.ts +95 -50
  143. package/src/prover/ptl/encode.ts +2 -3
  144. package/src/prover/ptl/tableau.ts +28 -2
  145. package/src/prover/smt/arithmetic.ts +310 -0
  146. package/src/prover/smt/axioms.ts +12 -8
  147. package/src/prover/smt/context.ts +43 -8
  148. package/src/prover/smt/data.ts +498 -379
  149. package/src/prover/smt/encode.ts +148 -57
  150. package/src/prover/smt/extensionality.ts +5 -3
  151. package/src/prover/smt/flatten.ts +4 -6
  152. package/src/prover/smt/format.ts +28 -4
  153. package/src/prover/smt/instances.ts +7 -1
  154. package/src/prover/smt/layout.ts +91 -0
  155. package/src/prover/smt/rewrite.ts +1021 -618
  156. package/src/prover/smt/simplify.ts +441 -0
  157. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  158. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  159. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  160. package/src/prover/smt/solver/act-cache.ts +0 -1
  161. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  162. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  163. package/src/prover/smt/solver/aig.ts +889 -0
  164. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  165. package/src/prover/smt/solver/arith-terms.ts +121 -0
  166. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  167. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  168. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  169. package/src/prover/smt/solver/ast-lt.ts +166 -12
  170. package/src/prover/smt/solver/ast-util.ts +160 -2
  171. package/src/prover/smt/solver/ast.ts +1427 -41
  172. package/src/prover/smt/solver/auf-solver.ts +2 -6
  173. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  174. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  175. package/src/prover/smt/solver/bound-manager.ts +196 -0
  176. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  177. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  178. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  179. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  180. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  181. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  182. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  183. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  184. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  185. package/src/prover/smt/solver/card2bv.ts +110 -0
  186. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  187. package/src/prover/smt/solver/cg-table.ts +39 -25
  188. package/src/prover/smt/solver/check-logic.ts +330 -0
  189. package/src/prover/smt/solver/clause.ts +0 -1
  190. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  191. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  192. package/src/prover/smt/solver/context.ts +536 -117
  193. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  194. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  195. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  196. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  197. package/src/prover/smt/solver/demodulator.ts +786 -0
  198. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  199. package/src/prover/smt/solver/der.ts +38 -10
  200. package/src/prover/smt/solver/diff-neq.ts +206 -0
  201. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  202. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  203. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  204. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  205. package/src/prover/smt/solver/e-matching.ts +7 -8
  206. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  207. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  208. package/src/prover/smt/solver/enode.ts +100 -3
  209. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  210. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  211. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  212. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  213. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  214. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  215. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  216. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  217. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  218. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  219. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  220. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  221. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  222. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  223. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  224. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  225. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  226. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  227. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  228. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  229. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  230. package/src/prover/smt/solver/expr-ref.ts +0 -1
  231. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  232. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  233. package/src/prover/smt/solver/factor.ts +163 -0
  234. package/src/prover/smt/solver/fd-solver.ts +267 -0
  235. package/src/prover/smt/solver/fingerprints.ts +15 -15
  236. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  237. package/src/prover/smt/solver/flat-literals.ts +0 -1
  238. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  239. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  240. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  241. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  242. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  243. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  244. package/src/prover/smt/solver/goal.ts +177 -15
  245. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  246. package/src/prover/smt/solver/guard-set.ts +219 -0
  247. package/src/prover/smt/solver/hash.ts +0 -1
  248. package/src/prover/smt/solver/hashtable.ts +30 -16
  249. package/src/prover/smt/solver/inf-eps.ts +63 -0
  250. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  251. package/src/prover/smt/solver/internalizer.ts +110 -38
  252. package/src/prover/smt/solver/lackr.ts +381 -0
  253. package/src/prover/smt/solver/lbool.ts +0 -1
  254. package/src/prover/smt/solver/lia2card.ts +268 -0
  255. package/src/prover/smt/solver/lia2pb.ts +154 -0
  256. package/src/prover/smt/solver/literal.ts +0 -1
  257. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  258. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  259. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  260. package/src/prover/smt/solver/lp/containers.ts +7 -2
  261. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  262. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  263. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  264. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  265. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  266. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  267. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  268. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  269. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  270. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  271. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  272. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  273. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  274. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  275. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  276. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  277. package/src/prover/smt/solver/lp/nex.ts +2 -2
  278. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  280. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  281. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  285. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  292. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  295. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  297. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  298. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  300. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  301. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  302. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  303. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  304. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  305. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  306. package/src/prover/smt/solver/macro-finder.ts +530 -0
  307. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  308. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  309. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  310. package/src/prover/smt/solver/max-cliques.ts +105 -0
  311. package/src/prover/smt/solver/maxcore.ts +309 -0
  312. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  313. package/src/prover/smt/solver/maxlex.ts +115 -0
  314. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  315. package/src/prover/smt/solver/maxsmt.ts +92 -0
  316. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  317. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  318. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  319. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  320. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  321. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  322. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  323. package/src/prover/smt/solver/model-checker.ts +18 -27
  324. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  325. package/src/prover/smt/solver/model-finder.ts +12 -18
  326. package/src/prover/smt/solver/model-generator.ts +56 -29
  327. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  328. package/src/prover/smt/solver/model-printer.ts +214 -0
  329. package/src/prover/smt/solver/mpf.ts +711 -0
  330. package/src/prover/smt/solver/mus.ts +51 -0
  331. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  332. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  333. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  334. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  335. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  336. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  337. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  338. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  339. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  340. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  341. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  342. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  343. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  344. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  345. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  346. package/src/prover/smt/solver/muz/spacer-context.ts +1407 -0
  347. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  348. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  349. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  350. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  351. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  352. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  353. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  354. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  355. package/src/prover/smt/solver/nlqsat.ts +484 -0
  356. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
  357. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  358. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  359. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  360. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  361. package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
  362. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  363. package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
  364. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  365. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  366. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  367. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  368. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  369. package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
  370. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  371. package/src/prover/smt/solver/nnf.ts +105 -23
  372. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  373. package/src/prover/smt/solver/occf.ts +97 -0
  374. package/src/prover/smt/solver/opt-context.ts +792 -0
  375. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  376. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  377. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  378. package/src/prover/smt/solver/opt-solver.ts +311 -0
  379. package/src/prover/smt/solver/opt-value.ts +55 -0
  380. package/src/prover/smt/solver/optsmt.ts +692 -0
  381. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  382. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  383. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  384. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  385. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  386. package/src/prover/smt/solver/probes.ts +512 -0
  387. package/src/prover/smt/solver/propagate-values.ts +37 -21
  388. package/src/prover/smt/solver/proto-model.ts +648 -19
  389. package/src/prover/smt/solver/pull-quant.ts +28 -12
  390. package/src/prover/smt/solver/purify-arith.ts +632 -0
  391. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  392. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  393. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  394. package/src/prover/smt/solver/qe-lite.ts +37 -17
  395. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  396. package/src/prover/smt/solver/qe.ts +1498 -0
  397. package/src/prover/smt/solver/qel.ts +25 -0
  398. package/src/prover/smt/solver/qi-queue.ts +0 -1
  399. package/src/prover/smt/solver/qsat.ts +814 -0
  400. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  401. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  402. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  403. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  404. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  405. package/src/prover/smt/solver/random-gen.ts +0 -1
  406. package/src/prover/smt/solver/rational.ts +45 -1
  407. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  408. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  409. package/src/prover/smt/solver/reduce-args.ts +225 -0
  410. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  411. package/src/prover/smt/solver/ref-vector.ts +0 -1
  412. package/src/prover/smt/solver/relevancy.ts +1 -2
  413. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  414. package/src/prover/smt/solver/rewriter.ts +475 -36
  415. package/src/prover/smt/solver/rlimit.ts +38 -2
  416. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  417. package/src/prover/smt/solver/sat/big.ts +177 -0
  418. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  419. package/src/prover/smt/solver/sat/clause.ts +203 -0
  420. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  421. package/src/prover/smt/solver/sat/config.ts +122 -0
  422. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  423. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  424. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  425. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  426. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  427. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  428. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  429. package/src/prover/smt/solver/sat/probing.ts +170 -0
  430. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  431. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  432. package/src/prover/smt/solver/sat/scc.ts +142 -0
  433. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  434. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  435. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  436. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  437. package/src/prover/smt/solver/search-tree.ts +284 -0
  438. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  439. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  440. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  441. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  442. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  443. package/src/prover/smt/solver/seq-factory.ts +89 -0
  444. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  445. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  446. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  447. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  448. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  449. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  450. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  451. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  452. package/src/prover/smt/solver/seq-subset.ts +165 -0
  453. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  454. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  455. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  456. package/src/prover/smt/solver/smt-logics.ts +66 -0
  457. package/src/prover/smt/solver/smt-setup.ts +496 -0
  458. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  459. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  460. package/src/prover/smt/solver/smtlib-script.ts +1704 -0
  461. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  462. package/src/prover/smt/solver/solver.ts +113 -22
  463. package/src/prover/smt/solver/static-features.ts +314 -0
  464. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  465. package/src/prover/smt/solver/tactic.ts +1995 -0
  466. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  467. package/src/prover/smt/solver/theory-array.ts +1240 -0
  468. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  469. package/src/prover/smt/solver/theory-char.ts +355 -0
  470. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  471. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  472. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  473. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  474. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  475. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  476. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  477. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  478. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  479. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  480. package/src/prover/smt/solver/theory-lra.ts +188 -1
  481. package/src/prover/smt/solver/theory-pb.ts +934 -0
  482. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  483. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  484. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  485. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  486. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  487. package/src/prover/smt/solver/theory-seq.ts +961 -0
  488. package/src/prover/smt/solver/theory.ts +189 -0
  489. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  490. package/src/prover/smt/solver/var-subst.ts +36 -14
  491. package/src/prover/smt/table.ts +3 -2
  492. package/src/prover/smt/types.ts +146 -0
  493. package/src/prover/tlapm/cache.ts +50 -19
  494. package/src/prover/tlapm/tlapm.ts +15 -9
  495. package/src/prover/tlapm-library.ts +3208 -0
  496. package/src/prover/verdict.ts +9 -0
  497. package/src/prover/zenon/check/check.ts +1 -2
  498. package/src/prover/zenon/check/records.ts +1 -1
  499. package/src/prover/zenon/check/relations.ts +2 -1
  500. package/src/prover/zenon/check/rewrites.ts +2 -15
  501. package/src/prover/zenon/check/sets.ts +40 -58
  502. package/src/prover/zenon/check/terms.ts +1 -2
  503. package/src/prover/zenon/decide.ts +10 -7
  504. package/src/prover/zenon/encode.ts +0 -2
  505. package/src/prover/zenon/eqrel.ts +2 -2
  506. package/src/prover/zenon/equality-rules.ts +24 -2
  507. package/src/prover/zenon/expr.ts +28 -2
  508. package/src/prover/zenon/index-table.ts +11 -21
  509. package/src/prover/zenon/isar-case.ts +0 -2
  510. package/src/prover/zenon/isar.ts +35 -37
  511. package/src/prover/zenon/llproof.ts +2 -13
  512. package/src/prover/zenon/mltoll.ts +12 -30
  513. package/src/prover/zenon/node.ts +20 -5
  514. package/src/prover/zenon/parse.ts +9 -8
  515. package/src/prover/zenon/phrase.ts +0 -2
  516. package/src/prover/zenon/proof.ts +0 -2
  517. package/src/prover/zenon/propositional-rules.ts +0 -2
  518. package/src/prover/zenon/rules.ts +2 -3
  519. package/src/prover/zenon/search.ts +11 -19
  520. package/src/prover/zenon/tla/functions.ts +2 -4
  521. package/src/prover/zenon/tla/llproof.ts +9 -13
  522. package/src/prover/zenon/tla/records.ts +1 -8
  523. package/src/prover/zenon/tla/rewrites.ts +0 -2
  524. package/src/prover/zenon/tla/sets.ts +22 -22
  525. package/src/prover/zenon/tla/terms.ts +0 -2
  526. package/src/prover/zenon/tla/tla.ts +7 -8
  527. package/src/resolve.ts +127 -108
  528. package/src/runtime.ts +6 -0
  529. package/src/sany/generation.ts +382 -0
  530. package/src/sany/generator-def-entries.ts +210 -0
  531. package/src/sany/generator-definitions.ts +686 -0
  532. package/src/sany/generator-expressions.ts +1092 -0
  533. package/src/sany/generator-proofs.ts +662 -0
  534. package/src/sany/generator.ts +155 -2625
  535. package/src/sany/levels.ts +0 -2
  536. package/src/sany/lexer.ts +17 -16
  537. package/src/sany/linter.ts +0 -2
  538. package/src/sany/nodes.ts +6 -13
  539. package/src/sany/report.ts +3 -6
  540. package/src/sany/selectors.ts +35 -38
  541. package/src/sany/xml.ts +23 -55
  542. package/src/search.ts +243 -52
  543. package/src/simulate.ts +160 -133
  544. package/src/spec-description.ts +33 -48
  545. package/src/standard-definitions.ts +4 -0
  546. package/src/standard-modules.ts +16 -32
  547. package/src/state-graph.ts +2 -9
  548. package/src/subexpressions.ts +3 -1
  549. package/src/substitution-levels.ts +5 -4
  550. package/src/successors.ts +6 -8
  551. package/src/symmetry.ts +2 -2
  552. package/src/tableau.ts +2 -2
  553. package/src/tlc/fingerprint.ts +81 -9
  554. package/src/tlc/jar-data.ts +12 -0
  555. package/src/tlc/messages.ts +20 -15
  556. package/src/tlc/order.ts +16 -12
  557. package/src/tlc/random.ts +4 -4
  558. package/src/tlc/replay.ts +8 -15
  559. package/src/tlc/summary.ts +29 -14
  560. package/src/tlc/tlc-operators.ts +2 -3
  561. package/src/tlc/tlcext-operators.ts +61 -16
  562. package/src/tlc/trace-spec.ts +26 -47
  563. package/src/typed-tier.ts +6535 -0
  564. package/src/typescript/actions.ts +2 -4
  565. package/src/typescript/collections.ts +34 -20
  566. package/src/typescript/compile.ts +1 -3
  567. package/src/typescript/formula.ts +5 -3
  568. package/src/typescript/model.ts +4 -5
  569. package/src/typescript/steps.ts +20 -18
  570. package/src/values.ts +63 -158
  571. package/src/prover/isabelle/isar/statement.ts +0 -52
  572. package/src/prover/smt/solver/z3-license.txt +0 -10
  573. package/src/prover/tlaps-module.ts +0 -510
  574. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,243 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_USER,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ KIND_VAR,
7
+ OP_AND,
8
+ OP_EQ,
9
+ OP_ITE,
10
+ SORT_BOOL,
11
+ type SmtSymbol,
12
+ QUANTIFIER_FORALL,
13
+ } from "./ast";
14
+ import type { Goal } from "./goal";
15
+ import { MacroManager } from "./macro-finder";
16
+ import { hasSubterm } from "./recfun-decl-plugin";
17
+ import { RefVector } from "./ref-vector";
18
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
19
+
20
+ interface QuasiMacro {
21
+ head: number;
22
+ def: number;
23
+ }
24
+
25
+ const isNonGroundUninterp = (manager: AstManager, expr: number) =>
26
+ !manager.isGroundApp(expr) &&
27
+ manager.kinds[expr] === KIND_APP &&
28
+ manager.funcDecls[manager.decls[expr]].family === FAMILY_USER;
29
+
30
+ const isFullyDependingOn = (manager: AstManager, app: number, numDecls: number) => {
31
+ const isUsed = Array.from({ length: numDecls }, () => false);
32
+ for (const arg of manager.getArgs(app))
33
+ if (manager.kinds[arg] === KIND_VAR) isUsed[manager.values[arg]] = true;
34
+ return isUsed.every(Boolean);
35
+ };
36
+
37
+ class QuasiMacros {
38
+ private occurrences = new Map<number, number>();
39
+ private rewriter: Rewriter;
40
+ private newVars: RefVector;
41
+ private newEqs: RefVector;
42
+
43
+ constructor(
44
+ private manager: AstManager,
45
+ private macros: MacroManager,
46
+ ) {
47
+ this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
48
+ this.newVars = new RefVector(manager);
49
+ this.newEqs = new RefVector(manager);
50
+ }
51
+
52
+ // A term reached a second time counts again, and a third time not.
53
+ private findOccurrences(expr: number) {
54
+ const manager = this.manager;
55
+ const visitedOnce = new Set<number>();
56
+ const visitedMore = new Set<number>();
57
+ const todo = [expr];
58
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
59
+ if (visitedMore.has(current)) continue;
60
+ if (visitedOnce.has(current)) visitedMore.add(current);
61
+ visitedOnce.add(current);
62
+ if (manager.kinds[current] === KIND_QUANTIFIER)
63
+ todo.push(manager.getQuantifier(current).body);
64
+ if (manager.kinds[current] !== KIND_APP) continue;
65
+ if (isNonGroundUninterp(manager, current)) {
66
+ const decl = manager.decls[current];
67
+ this.occurrences.set(decl, (this.occurrences.get(decl) ?? 0) + 1);
68
+ }
69
+ for (let index = manager.getNumArgs(current); index > 0; index--)
70
+ todo.push(manager.getArg(current, index - 1));
71
+ }
72
+ }
73
+
74
+ private isUnique(decl: number) {
75
+ return this.occurrences.get(decl) === 1;
76
+ }
77
+
78
+ private isQuasiDef(numDecls: number, lhs: number, rhs: number) {
79
+ const manager = this.manager;
80
+ return (
81
+ isNonGroundUninterp(manager, lhs) &&
82
+ this.isUnique(manager.decls[lhs]) &&
83
+ !hasSubterm(
84
+ manager,
85
+ [rhs],
86
+ (expr) => manager.kinds[expr] === KIND_APP && manager.decls[expr] === manager.decls[lhs],
87
+ false,
88
+ ) &&
89
+ isFullyDependingOn(manager, lhs, numDecls)
90
+ );
91
+ }
92
+
93
+ private getQuasiMacro(expr: number): QuasiMacro | undefined {
94
+ const manager = this.manager;
95
+ if (
96
+ manager.kinds[expr] !== KIND_QUANTIFIER ||
97
+ manager.getQuantifier(expr).kind !== QUANTIFIER_FORALL
98
+ )
99
+ return undefined;
100
+ const numDecls = manager.getQuantifier(expr).sorts.length;
101
+ const body = manager.getQuantifier(expr).body;
102
+ const isUniqueUninterp = (term: number) =>
103
+ isNonGroundUninterp(manager, term) && this.isUnique(manager.decls[term]);
104
+ if (manager.getOp(body) === OP_EQ) {
105
+ const lhs = manager.getArg(body, 0);
106
+ const rhs = manager.getArg(body, 1);
107
+ if (this.isQuasiDef(numDecls, lhs, rhs)) return { head: lhs, def: rhs };
108
+ if (this.isQuasiDef(numDecls, rhs, lhs)) return { head: rhs, def: lhs };
109
+ return undefined;
110
+ }
111
+ if (manager.isNot(body) && isUniqueUninterp(manager.getArg(body, 0)))
112
+ return { head: manager.getArg(body, 0), def: manager.falseExpr };
113
+ if (isUniqueUninterp(body)) return { head: body, def: manager.trueExpr };
114
+ if (!manager.isNot(body)) return undefined;
115
+ const eq = manager.getArg(body, 0);
116
+ if (manager.getOp(eq) !== OP_EQ || !manager.isBool(manager.getArg(eq, 0))) return undefined;
117
+ const lhs = manager.getArg(eq, 0);
118
+ const rhs = manager.getArg(eq, 1);
119
+ if (this.isQuasiDef(numDecls, lhs, rhs)) return { head: lhs, def: manager.mkNot(rhs) };
120
+ if (this.isQuasiDef(numDecls, rhs, lhs)) return { head: rhs, def: manager.mkNot(lhs) };
121
+ return undefined;
122
+ }
123
+
124
+ // The macro comes with a reference, which the caller releases, and -1 is no macro.
125
+ private toMacro(quantifier: number, macro: QuasiMacro) {
126
+ const manager = this.manager;
127
+ const data = manager.getQuantifier(quantifier);
128
+ const funcDecl = manager.funcDecls[manager.decls[macro.head]];
129
+ const newNames: SmtSymbol[] = [];
130
+ const newSorts: number[] = [];
131
+ this.newVars.reset();
132
+ this.newEqs.reset();
133
+ const isSeen = Array.from({ length: data.sorts.length }, () => false);
134
+ let numSeen = 0;
135
+ for (const [index, arg] of manager.getArgs(macro.head).entries()) {
136
+ const isVar = manager.kinds[arg] === KIND_VAR;
137
+ if (!isVar && !manager.isGroundApp(arg)) return -1;
138
+ if (isVar && !isSeen[manager.values[arg]]) {
139
+ this.newVars.push(arg);
140
+ isSeen[manager.values[arg]] = true;
141
+ numSeen++;
142
+ continue;
143
+ }
144
+ const sort = funcDecl.domain[index];
145
+ newNames.push(`X${newNames.length}`);
146
+ newSorts.push(sort);
147
+ this.newVars.push(manager.mkVar(newNames.length - 1 + data.sorts.length, sort));
148
+ this.newEqs.push(manager.mkEq(this.newVars.items[this.newVars.size - 1], arg));
149
+ }
150
+ if (numSeen < data.sorts.length) return -1;
151
+ const app = manager.mkApp(manager.decls[macro.head], this.newVars.items, funcDecl.range);
152
+ manager.incRef(app);
153
+ const elseDecl = manager.mkFreshFuncDecl(
154
+ funcDecl.name,
155
+ funcDecl.domain,
156
+ funcDecl.range,
157
+ true,
158
+ "else",
159
+ );
160
+ const elseApp = manager.mkApp(elseDecl, this.newVars.items, funcDecl.range);
161
+ manager.incRef(elseApp);
162
+ const ite = manager.mkApp(
163
+ OP_ITE,
164
+ [manager.mkApp(OP_AND, this.newEqs.items, SORT_BOOL), macro.def, elseApp],
165
+ funcDecl.range,
166
+ );
167
+ manager.incRef(ite);
168
+ const eq = manager.mkEq(app, ite);
169
+ manager.incRef(eq);
170
+ const result = manager.mkQuantifier({
171
+ kind: QUANTIFIER_FORALL,
172
+ sorts: [...newSorts.toReversed(), ...data.sorts],
173
+ names: [...newNames.toReversed(), ...data.names],
174
+ body: eq,
175
+ patterns: [],
176
+ noPatterns: [],
177
+ weight: 0,
178
+ qid: "",
179
+ });
180
+ manager.incRef(result);
181
+ manager.decRef(eq);
182
+ manager.decRef(ite);
183
+ manager.decRef(elseApp);
184
+ manager.decRef(app);
185
+ return result;
186
+ }
187
+
188
+ private findMacros(forms: number[]) {
189
+ const manager = this.manager;
190
+ let isFound = false;
191
+ this.occurrences.clear();
192
+ for (const form of forms) this.findOccurrences(form);
193
+ for (const form of forms) {
194
+ const quasiMacro = this.getQuasiMacro(form);
195
+ if (quasiMacro === undefined) continue;
196
+ manager.incRef(quasiMacro.head);
197
+ manager.incRef(quasiMacro.def);
198
+ const macro = this.toMacro(form, quasiMacro);
199
+ if (macro !== -1 && this.macros.insert(manager.decls[quasiMacro.head], macro)) isFound = true;
200
+ if (macro !== -1) manager.decRef(macro);
201
+ manager.decRef(quasiMacro.def);
202
+ manager.decRef(quasiMacro.head);
203
+ }
204
+ return isFound;
205
+ }
206
+
207
+ apply(forms: RefVector) {
208
+ const manager = this.manager;
209
+ if (!this.findMacros(forms.items)) return false;
210
+ for (let index = 0; index < forms.size; index++) {
211
+ const expanded = this.macros.expand(forms.items[index]);
212
+ const rewritten = this.rewriter.rewrite(expanded);
213
+ forms.set(index, rewritten);
214
+ manager.decRef(rewritten);
215
+ manager.decRef(expanded);
216
+ }
217
+ return true;
218
+ }
219
+
220
+ release() {
221
+ this.newEqs.reset();
222
+ this.newVars.reset();
223
+ this.rewriter.release();
224
+ }
225
+ }
226
+
227
+ export const findQuasiMacros = (manager: AstManager, goal: Goal) => {
228
+ const macros = new MacroManager(manager);
229
+ const quasiMacros = new QuasiMacros(manager, macros);
230
+ const forms = new RefVector(manager);
231
+ for (const form of goal.forms.items) forms.push(form);
232
+ do manager.limit.checkpoint();
233
+ while (quasiMacros.apply(forms));
234
+ goal.reset();
235
+ for (const form of forms.items) goal.assert(form);
236
+ const definitions = macros.getInterpretations();
237
+ goal.addDefinitions(definitions);
238
+ for (const definition of definitions) manager.decRef(definition.def);
239
+ goal.depth++;
240
+ forms.reset();
241
+ quasiMacros.release();
242
+ macros.release();
243
+ };
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/util.h), MIT license, see z3-license.txt.
2
1
  export class RandomGen {
3
2
  constructor(private seed: number) {}
4
3
 
@@ -1,4 +1,4 @@
1
- // Ported from Z3 (src/util/rational.h), MIT license, see z3-license.txt.
1
+ import { SmtInvariantError } from "../../../errors";
2
2
 
3
3
  export const getGcd = (first: bigint, second: bigint) => {
4
4
  let left = first < 0n ? -first : first;
@@ -13,6 +13,20 @@ export const getGcd = (first: bigint, second: bigint) => {
13
13
 
14
14
  const isBigInt = (value: bigint) => value <= -2147483648n || value > 2147483647n;
15
15
 
16
+ // mpz's get_double sums the 32-bit digits of a bignum from the least significant one, which rounds
17
+ // differently from Number.
18
+ const getDouble = (value: bigint) => {
19
+ if (!isBigInt(value)) return Number(value);
20
+ let result = 0;
21
+ let scale = 1;
22
+ for (let rest = value < 0n ? -value : value; rest > 0n; rest >>= 32n) {
23
+ result += scale * Number(rest & 0xffffffffn);
24
+ scale *= 4294967296;
25
+ }
26
+ if (!(result >= 0)) result = 2 ** 64;
27
+ return value < 0n ? -result : result;
28
+ };
29
+
16
30
  export const getLcm = (first: bigint, second: bigint) => {
17
31
  const product = first * second;
18
32
  return (product < 0n ? -product : product) / getGcd(first, second);
@@ -49,6 +63,21 @@ const getIntRoot = (value: bigint, degree: number): bigint | undefined => {
49
63
  return low ** exponent === value ? low : undefined;
50
64
  };
51
65
 
66
+ // rational::mult_inverse: the inverse of the value modulo 2^bits, which only an odd value has.
67
+ export const getMultInverse = (value: bigint, bits: number) => {
68
+ if (value === 1n) return 1n;
69
+ if (value % 2n === 0n) return undefined;
70
+ const modulus = 1n << BigInt(bits);
71
+ let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
72
+ let [oldCoefficient, coefficient] = [1n, 0n];
73
+ while (remainder !== 0n) {
74
+ const quotient = oldRemainder / remainder;
75
+ [oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
76
+ [oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
77
+ }
78
+ return ((oldCoefficient % modulus) + modulus) % modulus;
79
+ };
80
+
52
81
  export class Rational {
53
82
  static readonly zero = new Rational(0n, 1n);
54
83
  static readonly one = new Rational(1n, 1n);
@@ -70,6 +99,17 @@ export class Rational {
70
99
  return new Rational(BigInt(value), 1n);
71
100
  }
72
101
 
102
+ static fromDouble(value: number) {
103
+ if (!Number.isFinite(value)) throw new SmtInvariantError(`${value} is not a rational number`);
104
+ let den = 1n;
105
+ let scaled = value;
106
+ while (!Number.isInteger(scaled)) {
107
+ scaled *= 2;
108
+ den *= 2n;
109
+ }
110
+ return Rational.of(BigInt(scaled), den);
111
+ }
112
+
73
113
  isZero() {
74
114
  return this.num === 0n;
75
115
  }
@@ -152,6 +192,10 @@ export class Rational {
152
192
  return new Rational(this.num < 0n ? quotient : quotient + 1n, 1n);
153
193
  }
154
194
 
195
+ toDouble() {
196
+ return getDouble(this.num) / getDouble(this.den);
197
+ }
198
+
155
199
  toString() {
156
200
  return this.den === 1n ? `${this.num}` : `${this.num}/${this.den}`;
157
201
  }
@@ -0,0 +1,261 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ KIND_QUANTIFIER,
5
+ OP_FUN_DEFINED,
6
+ OP_ITE,
7
+ OP_NOT,
8
+ type RecFunDef,
9
+ SORT_BOOL,
10
+ } from "./ast";
11
+ import { ExprSafeReplace } from "./expr-safe-replace";
12
+ import { ObjMap } from "./hashtable";
13
+
14
+ const getChildren = (manager: AstManager, expr: number, isUnderQuantifiers: boolean) =>
15
+ manager.kinds[expr] === KIND_QUANTIFIER
16
+ ? isUnderQuantifiers
17
+ ? [manager.getQuantifier(expr).body]
18
+ : []
19
+ : manager.kinds[expr] === KIND_APP
20
+ ? manager.getArgs(expr)
21
+ : [];
22
+
23
+ // subterms::all goes under quantifiers, and subterms::ground does not.
24
+ export const getSubterms = (manager: AstManager, expr: number, isUnderQuantifiers = true) => {
25
+ const visited = new Set<number>();
26
+ const todo = [expr];
27
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
28
+ if (visited.has(current)) continue;
29
+ visited.add(current);
30
+ todo.push(...getChildren(manager, current, isUnderQuantifiers));
31
+ }
32
+ return [...visited];
33
+ };
34
+
35
+ // Whether a subterm of the roots satisfies the predicate, which the walk calls in no particular
36
+ // order.
37
+ export const hasSubterm = (
38
+ manager: AstManager,
39
+ roots: readonly number[],
40
+ predicate: (term: number) => boolean,
41
+ isUnderQuantifiers = true,
42
+ ) => {
43
+ const visited = new Set<number>();
44
+ const todo = [...roots];
45
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
46
+ if (visited.has(current)) continue;
47
+ visited.add(current);
48
+ if (predicate(current)) return true;
49
+ if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
50
+ else if (isUnderQuantifiers && manager.kinds[current] === KIND_QUANTIFIER)
51
+ todo.push(manager.getQuantifier(current).body);
52
+ }
53
+ return false;
54
+ };
55
+
56
+ export const isDefinedApp = (manager: AstManager, expr: number) =>
57
+ manager.getOp(expr) === OP_FUN_DEFINED;
58
+
59
+ export const containsDef = (manager: AstManager, expr: number) =>
60
+ hasSubterm(manager, [expr], (term) => isDefinedApp(manager, term), false);
61
+
62
+ // An ite on a condition without a defined function, with one in a branch.
63
+ const containsIte = (manager: AstManager, expr: number) =>
64
+ hasSubterm(
65
+ manager,
66
+ [expr],
67
+ (term) =>
68
+ manager.getOp(term) === OP_ITE &&
69
+ !containsDef(manager, manager.getArg(term, 0)) &&
70
+ containsDef(manager, term),
71
+ false,
72
+ );
73
+
74
+ interface ChoiceList {
75
+ ite: number;
76
+ isPositive: boolean;
77
+ next: ChoiceList | null;
78
+ }
79
+
80
+ interface ExprList {
81
+ expr: number;
82
+ next: ExprList | null;
83
+ }
84
+
85
+ interface Branch {
86
+ path: ChoiceList | null;
87
+ toSplit: ExprList | null;
88
+ toUnfold: ExprList | null;
89
+ }
90
+
91
+ const addCase = (
92
+ manager: AstManager,
93
+ def: RecFunDef,
94
+ guards: number[],
95
+ rhs: number,
96
+ isImmediate: boolean,
97
+ ) => {
98
+ for (const guard of guards) manager.incRef(guard);
99
+ manager.incRef(rhs);
100
+ def.cases.push({
101
+ pred: manager.mkRecFunCasePredDecl(def.decl, def.cases.length),
102
+ guards,
103
+ rhs,
104
+ isImmediate,
105
+ def,
106
+ });
107
+ };
108
+
109
+ // convert_path: the conditions of the choices, the last first, and the substitution of each ite by
110
+ // its branch.
111
+ const convertPath = (manager: AstManager, path: ChoiceList | null, subst: ExprSafeReplace) => {
112
+ const conditions: number[] = [];
113
+ for (let choice = path; choice !== null; choice = choice.next) {
114
+ const condition = manager.getArg(choice.ite, 0);
115
+ conditions.push(choice.isPositive ? condition : manager.mkApp(OP_NOT, [condition], SORT_BOOL));
116
+ const target = subst.apply(manager.getArg(choice.ite, choice.isPositive ? 1 : 2));
117
+ subst.insert(choice.ite, target);
118
+ manager.decRef(target);
119
+ }
120
+ return conditions;
121
+ };
122
+
123
+ // def::compute_cases: a case for each path through the ites whose branches call a defined
124
+ // function, with the conditions on the path as its guards.
125
+ const computeCases = (manager: AstManager, def: RecFunDef, isMacro: boolean, rhs: number) => {
126
+ manager.incRef(rhs);
127
+ def.rhs = rhs;
128
+ if (isMacro || manager.funcDecls[def.decl].domain.length === 0 || !containsIte(manager, rhs)) {
129
+ addCase(manager, def, [], rhs, false);
130
+ return;
131
+ }
132
+ const branches: Branch[] = [{ path: null, toSplit: null, toUnfold: { expr: rhs, next: null } }];
133
+ for (let branch = branches.pop(); branch !== undefined; branch = branches.pop()) {
134
+ while (branch.toUnfold !== null) {
135
+ const stack = [branch.toUnfold.expr];
136
+ branch.toUnfold = branch.toUnfold.next;
137
+ for (let expr = stack.pop(); expr !== undefined; expr = stack.pop()) {
138
+ if (manager.getOp(expr) === OP_ITE) {
139
+ if (containsDef(manager, manager.getArg(expr, 0))) continue;
140
+ if (
141
+ !containsDef(manager, manager.getArg(expr, 1)) &&
142
+ !containsDef(manager, manager.getArg(expr, 2))
143
+ )
144
+ continue;
145
+ branch.toSplit = { expr, next: branch.toSplit };
146
+ } else if (manager.kinds[expr] === KIND_APP)
147
+ for (const arg of manager.getArgs(expr)) if (containsIte(manager, arg)) stack.push(arg);
148
+ }
149
+ }
150
+ if (branch.toSplit !== null) {
151
+ const ite = branch.toSplit.expr;
152
+ const condition = manager.getArg(ite, 0);
153
+ const mkBranch = (isPositive: boolean): Branch => ({
154
+ path: { ite, isPositive, next: branch.path },
155
+ toSplit: branch.toSplit!.next,
156
+ toUnfold: {
157
+ expr: condition,
158
+ next: { expr: manager.getArg(ite, isPositive ? 1 : 2), next: branch.toUnfold },
159
+ },
160
+ });
161
+ branches.push(mkBranch(false), mkBranch(true));
162
+ continue;
163
+ }
164
+ manager.withTemporaries(
165
+ () => {
166
+ const subst = new ExprSafeReplace(manager);
167
+ const conditions = convertPath(manager, branch.path, subst);
168
+ const caseRhs = subst.apply(rhs);
169
+ const guards = conditions.map((condition) => subst.apply(condition));
170
+ subst.release();
171
+ const isImmediate = !hasSubterm(manager, [caseRhs], (term) => isDefinedApp(manager, term));
172
+ addCase(manager, def, guards, caseRhs, isImmediate);
173
+ manager.decRef(caseRhs);
174
+ for (const guard of guards) manager.decRef(guard);
175
+ },
176
+ () => [],
177
+ );
178
+ }
179
+ };
180
+
181
+ // compute_scores: the number of ites on the paths from the root to each subterm. The scores are in
182
+ // an obj_map, whose order decides which of the ites with the highest score redirect_ite takes.
183
+ const computeScores = (manager: AstManager, expr: number) => {
184
+ const parents = new Map<number, number[]>([[expr, []]]);
185
+ const byDepth = new Map<number, number[]>();
186
+ for (const term of getSubterms(manager, expr, false)) {
187
+ if (manager.kinds[term] === KIND_APP)
188
+ for (const arg of manager.getArgs(term)) {
189
+ const argParents = parents.get(arg) ?? [];
190
+ argParents.push(term);
191
+ parents.set(arg, argParents);
192
+ }
193
+ const depth = manager.depths[term];
194
+ byDepth.set(depth, [...(byDepth.get(depth) ?? []), term]);
195
+ }
196
+ const scores = new ObjMap<number>((term) => manager.hashes[term]);
197
+ scores.set(expr, 0);
198
+ for (let depth = manager.depths[expr]; depth > 0; depth--)
199
+ for (const term of byDepth.get(depth) ?? []) {
200
+ const score = (parents.get(term) ?? []).reduce(
201
+ (sum, parent) => sum + (scores.get(parent) ?? 0),
202
+ 0,
203
+ );
204
+ scores.set(term, manager.getOp(term) === OP_ITE ? score + 1 : score);
205
+ }
206
+ return scores;
207
+ };
208
+
209
+ // redirect_ite: an ite under more than four others that calls a defined function becomes a fresh
210
+ // function, so that the cases do not multiply.
211
+ const redirectIte = (manager: AstManager, def: RecFunDef, rhs: number) => {
212
+ const domain = manager.funcDecls[def.decl].domain;
213
+ const vars = domain.map((sort, index) => manager.mkVar(domain.length - 1 - index, sort));
214
+ for (const variable of vars) manager.incRef(variable);
215
+ let result = rhs;
216
+ manager.incRef(result);
217
+ for (;;) {
218
+ let maxScore = 0;
219
+ let maxExpr = -1;
220
+ for (const [term, score] of computeScores(manager, result))
221
+ if (manager.getOp(term) === OP_ITE && score > maxScore && containsDef(manager, term)) {
222
+ maxExpr = term;
223
+ maxScore = score;
224
+ }
225
+ if (maxScore <= 4) break;
226
+ // mk_fresh_id gives the id after the increment.
227
+ const decl = manager.mkRecFuncDecl(
228
+ `fold-rec-${manager.mkFreshId() + 1}`,
229
+ domain,
230
+ manager.sorts[maxExpr],
231
+ );
232
+ const newBody = manager.mkApp(decl, vars, manager.sorts[maxExpr]);
233
+ manager.incRef(newBody);
234
+ setRecFunDefinition(manager, manager.recFunDefs.get(decl)!, false, maxExpr);
235
+ const subst = new ExprSafeReplace(manager);
236
+ subst.insert(maxExpr, newBody);
237
+ const replaced = subst.apply(result);
238
+ subst.release();
239
+ manager.decRef(newBody);
240
+ manager.decRef(result);
241
+ result = replaced;
242
+ }
243
+ for (const variable of vars) manager.decRef(variable);
244
+ return result;
245
+ };
246
+
247
+ // plugin::set_definition: a definition that is not a macro is recursive.
248
+ export const setRecFunDefinition = (
249
+ manager: AstManager,
250
+ def: RecFunDef,
251
+ isMacro: boolean,
252
+ rhs: number,
253
+ ) => {
254
+ if (!isMacro) manager.hasRecDefs = true;
255
+ const redirected = isMacro ? rhs : redirectIte(manager, def, rhs);
256
+ if (isMacro) manager.incRef(redirected);
257
+ def.isMacro = isMacro;
258
+ computeCases(manager, def, isMacro, redirected);
259
+ manager.decRef(redirected);
260
+ for (const recFunCase of def.cases) manager.recFunCases.set(recFunCase.pred, recFunCase);
261
+ };
@@ -0,0 +1,107 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_USER,
4
+ KIND_APP,
5
+ KIND_VAR,
6
+ OP_DT_ACCESSOR,
7
+ OP_DT_CONSTRUCTOR,
8
+ OP_DT_IS,
9
+ OP_DT_RECOGNISER,
10
+ } from "./ast";
11
+ import { getSubterms, isDefinedApp } from "./recfun-decl-plugin";
12
+ import type { Rewrite } from "./rewriter-tpl";
13
+ import { VarSubst } from "./var-subst";
14
+
15
+ const getRhs = (manager: AstManager, decl: number) => manager.recFunDefs.get(decl)?.rhs ?? -1;
16
+
17
+ const isFunMacro = (manager: AstManager, decl: number) =>
18
+ manager.recFunDefs.get(decl)?.cases.length === 1;
19
+
20
+ // Leaves cycles through unconditional bodies to the resource-limited theory solver.
21
+ const isOnMacroCycle = (manager: AstManager, decl: number) => {
22
+ const todo = [decl];
23
+ const visited = new Set(todo);
24
+ for (let index = 0; index < todo.length; index++) {
25
+ for (const term of getSubterms(manager, getRhs(manager, todo[index]))) {
26
+ if (!isDefinedApp(manager, term)) continue;
27
+ const callee = manager.decls[term];
28
+ if (callee === decl) return true;
29
+ if (isFunMacro(manager, callee) && !visited.has(callee)) {
30
+ visited.add(callee);
31
+ todo.push(callee);
32
+ }
33
+ }
34
+ }
35
+ return false;
36
+ };
37
+
38
+ const isDecreasingArg = (
39
+ manager: AstManager,
40
+ decl: number,
41
+ position: number,
42
+ isAnyAccessorAllowed: boolean,
43
+ ) => {
44
+ const body = getRhs(manager, decl);
45
+ if (body === -1 || manager.hasQuantifierFlags[body]) return false;
46
+ const index = manager.funcDecls[decl].domain.length - position - 1;
47
+ const isParameter = (expr: number) =>
48
+ manager.kinds[expr] === KIND_VAR && manager.values[expr] === index;
49
+ const subterms = getSubterms(manager, body);
50
+ let decreasing = -1;
51
+ for (const term of subterms) {
52
+ if (manager.kinds[term] !== KIND_APP || !manager.getArgs(term).some(isParameter)) continue;
53
+ const op = manager.getOp(term);
54
+ if (op !== OP_DT_ACCESSOR && op !== OP_DT_IS && op !== OP_DT_RECOGNISER) return false;
55
+ if (op !== OP_DT_ACCESSOR) continue;
56
+ if (!isAnyAccessorAllowed && decreasing !== -1 && manager.decls[term] !== decreasing)
57
+ return false;
58
+ decreasing = manager.decls[term];
59
+ }
60
+ if (!isAnyAccessorAllowed) return true;
61
+ if (decreasing === -1) return false;
62
+ for (const term of subterms) {
63
+ if (manager.kinds[term] !== KIND_APP || manager.decls[term] !== decl) continue;
64
+ let arg = manager.getArg(term, position);
65
+ let isStrict = false;
66
+ while (manager.getOp(arg) === OP_DT_ACCESSOR) {
67
+ arg = manager.getArg(arg, 0);
68
+ isStrict = true;
69
+ }
70
+ if (!isStrict || !isParameter(arg)) return false;
71
+ }
72
+ return true;
73
+ };
74
+
75
+ // recfun_rewriter::mk_app_core, which unfolds a body with uninterpreted functions only with
76
+ // unfold_recursive_functions, which only the model evaluator sets.
77
+ export const mkRecFunApp = (
78
+ manager: AstManager,
79
+ decl: number,
80
+ args: number[],
81
+ isUnfolding = false,
82
+ ): Rewrite | undefined => {
83
+ const body = getRhs(manager, decl);
84
+ if (args.length === 0 || body === -1) return undefined;
85
+ if (isFunMacro(manager, decl) && isOnMacroCycle(manager, decl)) return undefined;
86
+ if (
87
+ !isUnfolding &&
88
+ getSubterms(manager, body).some(
89
+ (term) => manager.kinds[term] === KIND_APP && manager.getFamily(term) === FAMILY_USER,
90
+ )
91
+ )
92
+ return undefined;
93
+ const isSafe =
94
+ args.every((arg) => manager.isValue(arg)) ||
95
+ (!manager.hasQuantifierFlags[body] &&
96
+ args.some(
97
+ (arg, position) =>
98
+ manager.getOp(arg) === OP_DT_CONSTRUCTOR &&
99
+ isDecreasingArg(manager, decl, position, manager.isGroundApp(arg)),
100
+ ));
101
+ if (!isSafe) return undefined;
102
+ const subst = new VarSubst(manager, true);
103
+ const result = subst.apply(body, args);
104
+ subst.release();
105
+ manager.releaseLater(result);
106
+ return { expr: result, depth: Infinity };
107
+ };