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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,121 @@
1
+ import {
2
+ type AstManager,
3
+ OP_ADD,
4
+ OP_GE,
5
+ OP_LE,
6
+ OP_MUL,
7
+ OP_TO_REAL,
8
+ SORT_BOOL,
9
+ SORT_INT,
10
+ SORT_REAL,
11
+ } from "./ast";
12
+ import { getIdentityHash, ObjMap } from "./hashtable";
13
+ import type { LarSolver } from "./lp/lar-solver";
14
+ import type { LarTerm } from "./lp/lar-term";
15
+ import { getGcd, getLcm, Rational } from "./rational";
16
+
17
+ // term2coeffs: the term over the theory variables of its columns, with nested terms expanded.
18
+ export const getTermCoeffs = (solver: LarSolver, term: LarTerm) => {
19
+ const coeffs = new ObjMap<Rational>(getIdentityHash);
20
+ const visit = (current: LarTerm, coeff: Rational) => {
21
+ for (const entry of current.coeffs) {
22
+ if (solver.hasTerm(entry[0])) {
23
+ visit(solver.getTerm(entry[0]), coeff.mul(entry[1]));
24
+ continue;
25
+ }
26
+ const thVar = solver.getExternal(entry[0]);
27
+ const sum = (coeffs.get(thVar) ?? Rational.zero).add(entry[1].mul(coeff));
28
+ if (coeffs.has(thVar)) coeffs.replace(thVar, sum);
29
+ else coeffs.set(thVar, sum);
30
+ }
31
+ };
32
+ visit(term, Rational.one);
33
+ return [...coeffs];
34
+ };
35
+
36
+ // coeffs2app: Int expressions of a Real sum are coerced to Real.
37
+ export const coeffsToApp = (
38
+ manager: AstManager,
39
+ coeffs: [number, Rational][],
40
+ isInt: boolean,
41
+ getExpr: (thVar: number) => number,
42
+ ) => {
43
+ const sort = isInt ? SORT_INT : SORT_REAL;
44
+ const summands = coeffs
45
+ .filter((entry) => !entry[1].isZero())
46
+ .map((entry) => {
47
+ const original = getExpr(entry[0]);
48
+ const expr =
49
+ !isInt && manager.isInt(original)
50
+ ? manager.mkApp(OP_TO_REAL, [original], SORT_REAL)
51
+ : original;
52
+ return entry[1].equals(Rational.one)
53
+ ? expr
54
+ : manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(entry[1], sort), expr], sort);
55
+ });
56
+ return summands.length === 0
57
+ ? manager.mkNumeralOfSort(Rational.zero, sort)
58
+ : summands.length === 1
59
+ ? summands[0]
60
+ : manager.mkApp(OP_ADD, summands, sort);
61
+ };
62
+
63
+ // mk_bound: the atom term >= offset, or term <= offset, with integer coefficients reduced by their
64
+ // gcd when every variable is an integer.
65
+ export const mkBoundAtom = (
66
+ manager: AstManager,
67
+ solver: LarSolver,
68
+ term: LarTerm,
69
+ inputOffset: Rational,
70
+ inputIsLower: boolean,
71
+ getExpr: (thVar: number) => number,
72
+ ) => {
73
+ let coeffs = getTermCoeffs(solver, term);
74
+ let offset = inputOffset;
75
+ let isLower = inputIsLower;
76
+ let lcm = offset.den;
77
+ const isInt = coeffs.every((entry) => manager.isInt(getExpr(entry[0])));
78
+ if (isInt) {
79
+ for (const entry of coeffs) lcm = getLcm(lcm, entry[1].den);
80
+ if (lcm !== 1n) {
81
+ const scale = Rational.of(lcm);
82
+ offset = offset.mul(scale);
83
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].mul(scale)]);
84
+ }
85
+ let gcd = 0n;
86
+ for (const entry of coeffs) gcd = getGcd(gcd, entry[1].num);
87
+ if (gcd !== 0n && gcd !== 1n) {
88
+ const divisor = Rational.of(gcd);
89
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].div(divisor)]);
90
+ offset = isLower ? offset.div(divisor).ceil() : offset.div(divisor).floor();
91
+ }
92
+ }
93
+ if (coeffs.length > 0 && coeffs[0][1].isNegative()) {
94
+ offset = offset.neg();
95
+ isLower = !isLower;
96
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].neg()]);
97
+ }
98
+ const sort = isInt ? SORT_INT : SORT_REAL;
99
+ return manager.mkApp(
100
+ isLower ? OP_GE : OP_LE,
101
+ [coeffsToApp(manager, coeffs, isInt, getExpr), manager.mkNumeralOfSort(offset, sort)],
102
+ SORT_BOOL,
103
+ );
104
+ };
105
+
106
+ // The sides of the equality term = offset that mk_eq internalizes.
107
+ export const mkTermEqSides = (
108
+ manager: AstManager,
109
+ solver: LarSolver,
110
+ term: LarTerm,
111
+ offset: Rational,
112
+ getExpr: (thVar: number) => number,
113
+ ) => {
114
+ const coeffs = getTermCoeffs(solver, term);
115
+ const isInt =
116
+ offset.isInt() && coeffs.every((entry) => manager.isInt(getExpr(entry[0])) && entry[1].isInt());
117
+ return [
118
+ coeffsToApp(manager, coeffs, isInt, getExpr),
119
+ manager.mkNumeralOfSort(offset, isInt ? SORT_INT : SORT_REAL),
120
+ ];
121
+ };
@@ -0,0 +1,175 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ isArithSort,
5
+ OP_ARRAY_DEFAULT,
6
+ OP_ARRAY_EXT,
7
+ OP_ARRAY_MAP,
8
+ OP_AS_ARRAY,
9
+ OP_CONST_ARRAY,
10
+ OP_SELECT,
11
+ OP_STORE,
12
+ } from "./ast";
13
+
14
+ interface ArraySignature {
15
+ name: string;
16
+ domain: number[];
17
+ range: number;
18
+ }
19
+
20
+ const isCompatible = (first: number, second: number) =>
21
+ first === second || (isArithSort(first) && isArithSort(second));
22
+
23
+ const getSelectSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
24
+ if (argSorts.length <= 1) return "select takes at least two arguments";
25
+ const sort = argSorts[0];
26
+ if (!manager.isArraySort(sort))
27
+ return `select expects the first argument sort to be an array, but was provided a value of sort ${manager.getSortName(sort)}`;
28
+ const parameters = manager.getSortParameters(sort);
29
+ if (parameters.length !== argSorts.length)
30
+ return `select expects the first argument to be an array taking ${parameters.length - 1}, instead it was passed ${argSorts.length - 1} arguments`;
31
+ for (let index = 0; index + 1 < parameters.length; index++)
32
+ if (!isCompatible(argSorts[index + 1], parameters[index]))
33
+ return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter ${manager.getSortName(parameters[index])} do not match`;
34
+ return {
35
+ name: "select",
36
+ domain: [sort, ...parameters.slice(0, -1)],
37
+ range: manager.getArrayRange(sort),
38
+ };
39
+ };
40
+
41
+ const getStoreSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
42
+ if (argSorts.length < 3) return "store takes at least 3 arguments";
43
+ const sort = argSorts[0];
44
+ if (!manager.isArraySort(sort)) return "store expects the first argument sort to be an array";
45
+ const parameters = manager.getSortParameters(sort);
46
+ if (argSorts.length !== parameters.length + 1)
47
+ return `store expects the first argument to be an array taking ${parameters.length + 1}, instead it was passed ${argSorts.length - 1} arguments`;
48
+ for (let index = 0; index < parameters.length; index++)
49
+ if (!isCompatible(parameters[index], argSorts[index + 1]))
50
+ return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter sort ${manager.getSortName(parameters[index])} do not match`;
51
+ return { name: "store", domain: [sort, ...parameters], range: sort };
52
+ };
53
+
54
+ const getConstSignature = (
55
+ manager: AstManager,
56
+ sort: number,
57
+ argSorts: number[],
58
+ ): ArraySignature | string => {
59
+ if (argSorts.length !== 1) return "invalid const array definition, expected one argument";
60
+ if (!manager.isArraySort(sort))
61
+ return "invalid const array definition, parameter is not an array sort";
62
+ if (manager.getArrayRange(sort) !== argSorts[0])
63
+ return "invalid const array definition, sort mismatch between array range and argument";
64
+ return { name: "const", domain: argSorts, range: sort };
65
+ };
66
+
67
+ export const getMapSignature = (
68
+ manager: AstManager,
69
+ mapped: { domain: readonly number[]; range: number },
70
+ argSorts: number[],
71
+ ): ArraySignature | string => {
72
+ if (argSorts.length !== mapped.domain.length)
73
+ return `map expects to take as many arguments as the function being mapped, it was given ${argSorts.length} but expects ${mapped.domain.length}`;
74
+ if (argSorts.length === 0) return "don't use map on constants";
75
+ const arity = manager.getArrayArity(argSorts[0]);
76
+ for (let index = 0; index < argSorts.length; index++) {
77
+ const sort = argSorts[index];
78
+ if (!manager.isArraySort(sort))
79
+ return `map expects an array sort as argument at position ${index}`;
80
+ if (manager.getArrayArity(sort) !== arity)
81
+ return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
82
+ for (let position = 0; position < arity; position++)
83
+ if (
84
+ manager.getSortParameters(sort)[position] !==
85
+ manager.getSortParameters(argSorts[0])[position]
86
+ )
87
+ return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
88
+ if (manager.getArrayRange(sort) !== mapped.domain[index])
89
+ return `map expects the argument at position ${index} to have the array range the same as the function`;
90
+ }
91
+ const range = manager.mkArraySort([
92
+ ...manager.getSortParameters(argSorts[0]).slice(0, -1),
93
+ mapped.range,
94
+ ]);
95
+ return { name: "map", domain: argSorts, range };
96
+ };
97
+
98
+ const getDefaultSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
99
+ if (argSorts.length !== 1) return "invalid default array definition, invalid domain size";
100
+ if (manager.getSortParameters(argSorts[0]).length <= 1)
101
+ return "parameter mismatch. There should be more than one parameter to defaults";
102
+ return { name: "default", domain: argSorts, range: manager.getArrayRange(argSorts[0]) };
103
+ };
104
+
105
+ const getExtSignature = (
106
+ manager: AstManager,
107
+ index: number,
108
+ argSorts: number[],
109
+ ): ArraySignature | string => {
110
+ if (argSorts.length !== 2 || argSorts[0] !== argSorts[1])
111
+ return "incorrect arguments passed to array-ext";
112
+ const parameters = manager.getSortParameters(argSorts[0]);
113
+ if (parameters.length === 0 || index >= parameters.length - 1)
114
+ return "incorrect arguments passed to array-ext";
115
+ return { name: "array-ext", domain: argSorts, range: parameters[index] };
116
+ };
117
+
118
+ // The parameter of const is its array sort, of map the declaration it maps, and of array-ext the
119
+ // index of its domain.
120
+ export const getArraySignature = (
121
+ manager: AstManager,
122
+ op: number,
123
+ argSorts: number[],
124
+ parameters: number[],
125
+ ): ArraySignature | string => {
126
+ switch (op) {
127
+ case OP_SELECT:
128
+ return getSelectSignature(manager, argSorts);
129
+ case OP_STORE:
130
+ return getStoreSignature(manager, argSorts);
131
+ case OP_CONST_ARRAY:
132
+ return getConstSignature(manager, parameters[0], argSorts);
133
+ case OP_ARRAY_MAP:
134
+ return getMapSignature(manager, manager.funcDecls[parameters[0]], argSorts);
135
+ case OP_ARRAY_DEFAULT:
136
+ return getDefaultSignature(manager, argSorts);
137
+ case OP_ARRAY_EXT:
138
+ return getExtSignature(manager, parameters[0] ?? 0, argSorts);
139
+ default:
140
+ return "invalid array operator";
141
+ }
142
+ };
143
+
144
+ export const mkArrayDecl = (
145
+ manager: AstManager,
146
+ op: number,
147
+ argSorts: number[],
148
+ parameters: number[] = [],
149
+ ) => {
150
+ const signature = getArraySignature(manager, op, argSorts, parameters);
151
+ if (typeof signature === "string") throw new SmtInvariantError(signature);
152
+ return manager.mkArrayDecl(op, signature.name, parameters, signature.domain, signature.range);
153
+ };
154
+
155
+ export const mkArrayApp = (
156
+ manager: AstManager,
157
+ op: number,
158
+ args: number[],
159
+ parameters: number[] = [],
160
+ ) => {
161
+ const decl = mkArrayDecl(
162
+ manager,
163
+ op,
164
+ args.map((arg) => manager.sorts[arg]),
165
+ parameters,
166
+ );
167
+ return manager.mkApp(decl, args, manager.funcDecls[decl].range);
168
+ };
169
+
170
+ export const mkAsArray = (manager: AstManager, decl: number) => {
171
+ const funcDecl = manager.funcDecls[decl];
172
+ const sort = manager.mkArraySort([...funcDecl.domain, funcDecl.range]);
173
+ const asArray = manager.mkArrayDecl(OP_AS_ARRAY, "as-array", [decl], [], sort);
174
+ return manager.mkApp(asArray, [], sort);
175
+ };
@@ -0,0 +1,319 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import { mkArrayApp } from "./array-decl-plugin";
3
+ import {
4
+ type AstManager,
5
+ OP_AND,
6
+ OP_ARRAY_MAP,
7
+ OP_AS_ARRAY,
8
+ OP_CONST_ARRAY,
9
+ OP_ITE,
10
+ OP_SELECT,
11
+ OP_STORE,
12
+ SORT_SIZE_INFINITE,
13
+ SORT_SIZE_VERY_BIG,
14
+ SORT_BOOL,
15
+ } from "./ast";
16
+ import { isAstLess } from "./ast-lt";
17
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
18
+ import { InvVarShifter, type Rewrite, VarShifter } from "./rewriter-tpl";
19
+ import { getFreeVarSorts, VarSubst } from "./var-subst";
20
+
21
+ const MAX_SQUASH_ROUNDS = 10;
22
+
23
+ export class ArrayRewriter {
24
+ constructor(
25
+ private manager: AstManager,
26
+ private isSortingStore = false,
27
+ private isExpandingSelects = false,
28
+ ) {}
29
+
30
+ private isOp(expr: number, op: number) {
31
+ return this.manager.getOp(expr) === op;
32
+ }
33
+
34
+ private mkApp(op: number, args: number[], parameters: number[] = []) {
35
+ return mkArrayApp(this.manager, op, args, parameters);
36
+ }
37
+
38
+ private compareArgs(count: number, first: number, firstStart: number, second: number[]) {
39
+ const manager = this.manager;
40
+ for (let index = 0; index < count; index++) {
41
+ const left = manager.getArg(first, firstStart + index);
42
+ const right = second[index];
43
+ if (left === right) continue;
44
+ return manager.areDistinct(left, right) ? L_FALSE : L_UNDEF;
45
+ }
46
+ return L_TRUE;
47
+ }
48
+
49
+ mkAppCore(op: number, args: number[]): number | Rewrite | undefined {
50
+ if (op === OP_SELECT) return this.mkSelectCore(args);
51
+ if (op === OP_STORE) return this.mkStoreCore(args);
52
+ return undefined;
53
+ }
54
+
55
+ private mkStoreCore(args: number[]): number | Rewrite | undefined {
56
+ const manager = this.manager;
57
+ const array = args[0];
58
+ const indices = args.slice(1, -1);
59
+ if (this.isOp(array, OP_STORE)) {
60
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
61
+ if (comparison === L_TRUE)
62
+ return this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
63
+ if (comparison === L_FALSE) {
64
+ if (this.isSortingStore && this.isLexLess(indices, manager.getArgs(array).slice(1))) {
65
+ const nested = this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
66
+ return {
67
+ expr: this.mkApp(OP_STORE, [nested, ...manager.getArgs(array).slice(1)]),
68
+ depth: 2,
69
+ };
70
+ }
71
+ const squashed = this.squashStore(args);
72
+ if (squashed !== undefined) return { expr: squashed, depth: 2 };
73
+ }
74
+ }
75
+ const value = args[args.length - 1];
76
+ if (this.isOp(array, OP_CONST_ARRAY) && manager.getArg(array, 0) === value) return array;
77
+ if (this.isOp(value, OP_SELECT) && this.compareArgs(args.length - 1, value, 0, args) === L_TRUE)
78
+ return array;
79
+ return undefined;
80
+ }
81
+
82
+ private isLexLess(first: number[], second: number[]) {
83
+ const index = first.findIndex((arg, position) => arg !== second[position]);
84
+ return index !== -1 && isAstLess(this.manager, first[index], second[index]);
85
+ }
86
+
87
+ private squashStore(args: number[]) {
88
+ const manager = this.manager;
89
+ const parents: number[] = [];
90
+ const indices = args.slice(1, -1);
91
+ let array = args[0];
92
+ for (let rounds = 0; this.isOp(array, OP_STORE) && rounds < MAX_SQUASH_ROUNDS; rounds++) {
93
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
94
+ if (comparison === L_UNDEF) return undefined;
95
+ if (comparison === L_FALSE) {
96
+ parents.push(array);
97
+ array = manager.getArg(array, 0);
98
+ continue;
99
+ }
100
+ let result = manager.getArg(array, 0);
101
+ for (let index = parents.length - 1; index >= 0; index--)
102
+ result = this.mkApp(OP_STORE, [result, ...manager.getArgs(parents[index]).slice(1)]);
103
+ return this.mkApp(OP_STORE, [result, ...args.slice(1)]);
104
+ }
105
+ return undefined;
106
+ }
107
+
108
+ private mkSelectSameStore(args: number[]): number | Rewrite | undefined {
109
+ const manager = this.manager;
110
+ const indices = args.slice(1);
111
+ let array = args[0];
112
+ for (;;) {
113
+ if (this.isOp(array, OP_STORE)) {
114
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
115
+ if (comparison === L_TRUE) return manager.getArg(array, indices.length + 1);
116
+ if (comparison === L_UNDEF) return undefined;
117
+ array = manager.getArg(array, 0);
118
+ continue;
119
+ }
120
+ if (this.isOp(array, OP_CONST_ARRAY)) return manager.getArg(array, 0);
121
+ if (manager.isLambda(array))
122
+ return { expr: this.betaReduce(array, indices), depth: Infinity };
123
+ if (this.isOp(array, OP_ARRAY_MAP)) {
124
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
125
+ const selects = manager.mapArgs(array, (arg) => this.mkApp(OP_SELECT, [arg, ...indices]));
126
+ const range = manager.getArrayRange(manager.sorts[array]);
127
+ return { expr: manager.mkApp(decl, selects, range), depth: 2 };
128
+ }
129
+ if (this.isOp(array, OP_AS_ARRAY)) {
130
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
131
+ return { expr: manager.mkApp(decl, indices, manager.funcDecls[decl].range), depth: 1 };
132
+ }
133
+ return undefined;
134
+ }
135
+ }
136
+
137
+ // select(lambda(X) M, N) -> M[N/X], anywhere rather than to weak head normal form.
138
+ private betaReduce(lambda: number, indices: number[]) {
139
+ const manager = this.manager;
140
+ const count = indices.length;
141
+ const shifter = new VarShifter(manager);
142
+ const shifted = indices.map((index) => shifter.shift(index, 0, count, 0));
143
+ shifter.release();
144
+ const subst = new VarSubst(manager, true);
145
+ const substituted = subst.apply(manager.getQuantifier(lambda).body, shifted);
146
+ subst.release();
147
+ for (const index of shifted) manager.decRef(index);
148
+ const invShifter = new InvVarShifter(manager);
149
+ const result = invShifter.shift(substituted, count);
150
+ invShifter.release();
151
+ manager.decRef(substituted);
152
+ manager.releaseLater(result);
153
+ return result;
154
+ }
155
+
156
+ // Array eta-reduction: (lambda (x_0 ... x_{k-1}) (select a x_0 ... x_{k-1})) -> a, when a does not
157
+ // depend on the bound variables.
158
+ mkLambdaCore(lambda: number, body: number) {
159
+ const manager = this.manager;
160
+ const count = manager.getQuantifier(lambda).sorts.length;
161
+ if (!this.isOp(body, OP_SELECT) || manager.getNumArgs(body) !== count + 1) return -1;
162
+ for (let index = 0; index < count; index++) {
163
+ const arg = manager.getArg(body, index + 1);
164
+ if (!manager.isVar(arg) || manager.values[arg] !== count - 1 - index) return -1;
165
+ }
166
+ const array = manager.getArg(body, 0);
167
+ if (getFreeVarSorts(manager, array, count).some((sort) => sort !== undefined)) return -1;
168
+ const shifter = new InvVarShifter(manager);
169
+ const result = shifter.shift(array, count);
170
+ shifter.release();
171
+ manager.releaseLater(result);
172
+ return result;
173
+ }
174
+
175
+ private mkSelectCore(args: number[]): number | Rewrite | undefined {
176
+ const manager = this.manager;
177
+ const sameStore = this.mkSelectSameStore(args);
178
+ if (sameStore !== undefined) return sameStore;
179
+ const indices = args.slice(1);
180
+ const array = args[0];
181
+ if (this.isOp(array, OP_STORE)) {
182
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
183
+ if (comparison === L_FALSE) {
184
+ let base = manager.getArg(array, 0);
185
+ while (
186
+ this.isOp(base, OP_STORE) &&
187
+ this.compareArgs(indices.length, base, 1, indices) === L_FALSE
188
+ )
189
+ base = manager.getArg(base, 0);
190
+ return { expr: this.mkApp(OP_SELECT, [base, ...indices]), depth: 1 };
191
+ }
192
+ const base = manager.getArg(array, 0);
193
+ const areValues = indices.every(
194
+ (index, position) =>
195
+ manager.isValue(index) && manager.isValue(manager.getArg(array, position + 1)),
196
+ );
197
+ if (
198
+ !this.isOp(base, OP_CONST_ARRAY) &&
199
+ !areValues &&
200
+ !(this.isExpandingSelects && manager.getRefCount(base) === 1)
201
+ )
202
+ return undefined;
203
+ const selectBase = this.mkApp(OP_SELECT, [base, ...indices]);
204
+ const value = manager.getArg(array, indices.length + 1);
205
+ const eqs = indices.map((index, position) =>
206
+ manager.mkEq(manager.getArg(array, position + 1), index),
207
+ );
208
+ const condition = eqs.length === 1 ? eqs[0] : manager.mkApp(OP_AND, eqs, SORT_BOOL);
209
+ return {
210
+ expr: manager.mkApp(OP_ITE, [condition, value, selectBase], manager.sorts[value]),
211
+ depth: eqs.length === 1 ? 2 : 3,
212
+ };
213
+ }
214
+ if (this.isOp(array, OP_ITE)) {
215
+ const thenArray = manager.getArg(array, 1);
216
+ const elseArray = manager.getArg(array, 2);
217
+ if (
218
+ !this.isExpandingSelects &&
219
+ manager.getRefCount(thenArray) !== 1 &&
220
+ manager.getRefCount(elseArray) !== 1
221
+ )
222
+ return undefined;
223
+ const thenSelect = this.mkApp(OP_SELECT, [thenArray, ...indices]);
224
+ const elseSelect = this.mkApp(OP_SELECT, [elseArray, ...indices]);
225
+ return {
226
+ expr: manager.mkApp(
227
+ OP_ITE,
228
+ [manager.getArg(array, 0), thenSelect, elseSelect],
229
+ manager.sorts[thenSelect],
230
+ ),
231
+ depth: 2,
232
+ };
233
+ }
234
+ return undefined;
235
+ }
236
+
237
+ private getStoreBase(expr: number) {
238
+ let base = expr;
239
+ let count = 0;
240
+ while (this.isOp(base, OP_STORE)) {
241
+ base = this.manager.getArg(base, 0);
242
+ count++;
243
+ }
244
+ return { base, count };
245
+ }
246
+
247
+ private isDomainLargerThan(sort: number, numStores: number) {
248
+ const manager = this.manager;
249
+ let size = 1n;
250
+ for (let index = 0; index < manager.getArrayArity(sort); index++) {
251
+ const domain = manager.getSortParameters(sort)[index];
252
+ if (manager.isUninterpretedSort(domain)) continue;
253
+ const domainSize = manager.getSortSize(domain);
254
+ if (domainSize === SORT_SIZE_INFINITE) return true;
255
+ if (domainSize === SORT_SIZE_VERY_BIG) return false;
256
+ size *= domainSize;
257
+ if (size > BigInt(numStores)) return true;
258
+ }
259
+ return false;
260
+ }
261
+
262
+ private pushStoreEqs(store: number, lhs: number, rhs: number, eqs: number[]) {
263
+ const manager = this.manager;
264
+ for (let current = store; this.isOp(current, OP_STORE); current = manager.getArg(current, 0)) {
265
+ const indices = manager.getArgs(current).slice(1, -1);
266
+ const left = this.mkSelect([lhs, ...indices]);
267
+ const right = this.mkSelect([rhs, ...indices]);
268
+ eqs.push(manager.mkEq(left, right));
269
+ }
270
+ }
271
+
272
+ private mkSelect(args: number[]) {
273
+ const result = this.mkSelectCore(args);
274
+ if (result === undefined) return this.mkApp(OP_SELECT, args);
275
+ return typeof result === "number" ? result : result.expr;
276
+ }
277
+
278
+ private hasValueIndices(expr: number) {
279
+ const manager = this.manager;
280
+ for (let current = expr; this.isOp(current, OP_STORE); current = manager.getArg(current, 0))
281
+ for (let index = 1; index + 1 < manager.getNumArgs(current); index++)
282
+ if (!manager.isValue(manager.getArg(current, index))) return false;
283
+ return true;
284
+ }
285
+
286
+ mkEqCore(inputLhs: number, inputRhs: number): Rewrite | undefined {
287
+ const manager = this.manager;
288
+ const isSwapped = this.isOp(inputRhs, OP_CONST_ARRAY) && this.isOp(inputLhs, OP_STORE);
289
+ const lhs = isSwapped ? inputRhs : inputLhs;
290
+ const rhs = isSwapped ? inputLhs : inputRhs;
291
+ if (this.isOp(lhs, OP_CONST_ARRAY) && this.isOp(rhs, OP_CONST_ARRAY))
292
+ return { expr: manager.mkEq(manager.getArg(lhs, 0), manager.getArg(rhs, 0)), depth: 1 };
293
+ const left = this.getStoreBase(lhs);
294
+ const right = this.getStoreBase(rhs);
295
+ const sort = manager.sorts[lhs];
296
+ if (
297
+ this.isOp(left.base, OP_CONST_ARRAY) &&
298
+ this.isOp(right.base, OP_CONST_ARRAY) &&
299
+ this.isDomainLargerThan(sort, left.count + right.count)
300
+ ) {
301
+ const eqs: number[] = [];
302
+ this.pushStoreEqs(lhs, lhs, rhs, eqs);
303
+ this.pushStoreEqs(rhs, lhs, rhs, eqs);
304
+ eqs.push(manager.mkEq(manager.getArg(left.base, 0), manager.getArg(right.base, 0)));
305
+ return { expr: manager.mkAnd(eqs), depth: Infinity };
306
+ }
307
+ if (
308
+ this.isOp(left.base, OP_CONST_ARRAY) &&
309
+ this.isOp(right.base, OP_CONST_ARRAY) &&
310
+ !(this.hasValueIndices(lhs) && this.hasValueIndices(rhs)) &&
311
+ manager
312
+ .getSortParameters(sort)
313
+ .slice(0, -1)
314
+ .some((domain) => manager.isUninterpretedSort(domain))
315
+ )
316
+ throw new SmtUnsupportedError("lambdas");
317
+ return undefined;
318
+ }
319
+ }
@@ -3,14 +3,12 @@ export const shrink = <T>(values: T[], size: number) => {
3
3
  while (values.length > size) values.pop();
4
4
  };
5
5
 
6
- // Writing far past an array's end turns it into a dictionary in V8, which makes every access a hash
7
- // lookup. So this fills the gap first.
6
+ // Writing far past an array's end turns it into a dictionary in V8, so this fills the gap first.
8
7
  export const setAt = <T>(values: (T | undefined)[], index: number, value: T | undefined) => {
9
8
  while (values.length < index) values.push(undefined);
10
9
  values[index] = value;
11
10
  };
12
11
 
13
- // A typed array of twice the length with the same contents.
14
12
  export const grow = <
15
13
  T extends Uint8Array<ArrayBuffer> | Int32Array<ArrayBuffer> | Uint32Array<ArrayBuffer>,
16
14
  >(