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,310 @@
1
+ // N_data.untyped_deps and N_axioms with disable_arithmetic, where integers are values of sort Idv
2
+ // that only these axioms describe.
3
+
4
+ import {
5
+ APPEND,
6
+ CAT,
7
+ declare,
8
+ FUN_APP,
9
+ FUN_DOM,
10
+ FUN_ISAFCN,
11
+ HEAD,
12
+ INT_LTEQ,
13
+ INT_MINUS,
14
+ INT_PLUS,
15
+ INT_RANGE,
16
+ INT_SET,
17
+ LEN,
18
+ MEM,
19
+ NAT_SET,
20
+ SEQ,
21
+ SUB_SEQ,
22
+ TAIL,
23
+ tla,
24
+ } from "./format";
25
+ import type { SymbolSpec } from "./data";
26
+ import { axiom, type Axiom } from "./table";
27
+
28
+ const ZERO = tla("IntLit_0");
29
+ const ONE = tla("IntLit_1");
30
+
31
+ const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "IntSet", "NatSet", "IntPlus", "IntLteq"];
32
+
33
+ const getTyping = (name: string, operator: string, set: string) =>
34
+ axiom(
35
+ name,
36
+ [],
37
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${set}) (${MEM} y ${set})) (${MEM} (${operator} x y) ${set})) :pattern ((${operator} x y))))`,
38
+ );
39
+
40
+ export const getUntypedSpec = (name: string): SymbolSpec | undefined => {
41
+ const symbol = tla(name);
42
+ const fixed = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") => ({
43
+ declaration: declare(symbol, arity, sort),
44
+ deps,
45
+ axioms,
46
+ });
47
+ switch (name) {
48
+ case "NatSet":
49
+ return fixed(
50
+ 0,
51
+ ["IntSet", "IntLit_0", "IntLteq"],
52
+ [
53
+ axiom(
54
+ "NatSetDef",
55
+ [],
56
+ `(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} ${ZERO} x))) :pattern ((${MEM} x ${NAT_SET}))))`,
57
+ ),
58
+ ],
59
+ );
60
+ case "IntPlus":
61
+ case "IntTimes": {
62
+ const typing = name === "IntPlus" ? "Plus" : "Times";
63
+ return fixed(
64
+ 2,
65
+ ["Mem", "IntSet", "NatSet"],
66
+ [
67
+ getTyping(`Int${typing}Typing`, symbol, INT_SET),
68
+ getTyping(`Nat${typing}Typing`, symbol, NAT_SET),
69
+ ],
70
+ );
71
+ }
72
+ case "IntMinus":
73
+ return fixed(2, ["Mem", "IntSet"], [getTyping("IntMinusTyping", symbol, INT_SET)]);
74
+ case "IntUminus":
75
+ return fixed(
76
+ 1,
77
+ ["Mem", "IntSet"],
78
+ [
79
+ axiom(
80
+ "IntUminusTyping",
81
+ [],
82
+ `(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (${MEM} (${symbol} x) ${INT_SET})) :pattern ((${symbol} x))))`,
83
+ ),
84
+ ],
85
+ );
86
+ case "IntQuotient":
87
+ case "IntRemainder": {
88
+ const isQuotient = name === "IntQuotient";
89
+ return fixed(
90
+ 2,
91
+ isQuotient
92
+ ? ["Mem", "IntSet", "NatSet", "IntLteq", "IntLit_0"]
93
+ : ["Mem", "IntSet", "NatSet", "IntLteq", "IntLit_0", "IntLit_1", "IntRange", "IntMinus"],
94
+ [
95
+ axiom(
96
+ `${name}Typing`,
97
+ [],
98
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${NAT_SET}) (${INT_LTEQ} ${ZERO} y)) (${MEM} (${symbol} x y) ${isQuotient ? NAT_SET : `(${INT_RANGE} ${ZERO} (${INT_MINUS} y ${ONE}))`})) :pattern ((${symbol} x y))))`,
99
+ ),
100
+ ],
101
+ );
102
+ }
103
+ case "IntExp":
104
+ return fixed(
105
+ 2,
106
+ ["Mem", "IntSet", "IntLteq", "IntLit_0", "IntLit_1"],
107
+ [
108
+ axiom(
109
+ "IntExpTyping",
110
+ [],
111
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} ${ZERO} y) (or (distinct x ${ZERO}) (${INT_LTEQ} ${ONE} y))) (${MEM} (${symbol} x y) ${INT_SET})) :pattern ((${symbol} x y))))`,
112
+ ),
113
+ ],
114
+ );
115
+ case "IntLteq":
116
+ return fixed(
117
+ 2,
118
+ ["Mem", "IntSet"],
119
+ [
120
+ axiom(
121
+ "LteqReflexive",
122
+ [],
123
+ `(forall ((x Idv)) (=> (${MEM} x ${INT_SET}) (${INT_LTEQ} x x)))`,
124
+ ),
125
+ axiom(
126
+ "LteqTransitive",
127
+ [],
128
+ `(forall ((x Idv) (y Idv) (z Idv)) (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${MEM} z ${INT_SET}) (${INT_LTEQ} x y) (${INT_LTEQ} y z)) (${INT_LTEQ} x z)))`,
129
+ ),
130
+ axiom(
131
+ "LteqAntisym",
132
+ [],
133
+ `(forall ((x Idv) (y Idv)) (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} x y) (${INT_LTEQ} y x)) (= x y)))`,
134
+ ),
135
+ ],
136
+ "Bool",
137
+ );
138
+ // tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
139
+ case "Seq":
140
+ return fixed(
141
+ 1,
142
+ [
143
+ "Mem",
144
+ "Len",
145
+ "FunIsafcn",
146
+ "FunDom",
147
+ "FunApp",
148
+ "IntSet",
149
+ "NatSet",
150
+ "IntRange",
151
+ "IntLteq",
152
+ "IntLit_1",
153
+ ],
154
+ [
155
+ axiom(
156
+ "SeqSetIntro",
157
+ [],
158
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))))) (forall ((i Idv)) (=> (and (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (${MEM} (${FUN_APP} s i) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
159
+ ),
160
+ axiom(
161
+ "SeqSetElim1",
162
+ [],
163
+ `(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} ${ONE} (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
164
+ "SetSetElim1",
165
+ ),
166
+ axiom(
167
+ "SeqSetElim2",
168
+ [],
169
+ `(forall ((a Idv) (s Idv) (i Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (${MEM} (${FUN_APP} s i) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s i))))`,
170
+ "SetSetElim2",
171
+ ),
172
+ ],
173
+ );
174
+ case "Len":
175
+ return fixed(
176
+ 1,
177
+ ["Mem", "FunDom", "IntRange", "NatSet", "IntLit_1"],
178
+ [
179
+ axiom(
180
+ "SeqLenDef",
181
+ [],
182
+ `(forall ((s Idv) (z Idv)) (=> (and (${MEM} z ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} ${ONE} z))) (= (${LEN} s) z)))`,
183
+ ),
184
+ ],
185
+ );
186
+ case "Cat":
187
+ return fixed(
188
+ 2,
189
+ [...SEQUENCE_DEPS, "IntLit_1"],
190
+ [
191
+ axiom(
192
+ "SeqCatTyping",
193
+ [],
194
+ `(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
195
+ ),
196
+ axiom(
197
+ "SeqCatLen",
198
+ [],
199
+ `(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${INT_PLUS} (${LEN} s) (${LEN} t)))) :pattern ((${CAT} s t))))`,
200
+ ),
201
+ axiom(
202
+ "SeqCatApp1",
203
+ [],
204
+ `(forall ((s Idv) (t Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (= (${FUN_APP} (${CAT} s t) i) (${FUN_APP} s i))) :pattern ((${FUN_APP} (${CAT} s t) i)) :pattern ((${CAT} s t) (${FUN_APP} s i))))`,
205
+ ),
206
+ axiom(
207
+ "SeqCatApp2",
208
+ [],
209
+ `(forall ((s Idv) (t Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} i (${INT_PLUS} (${LEN} s) (${LEN} t))) (${INT_LTEQ} (${LEN} s) i) (distinct (${LEN} s) i)) (= (${FUN_APP} (${CAT} s t) i) (${FUN_APP} t (${INT_MINUS} i (${LEN} s))))) :pattern ((${FUN_APP} (${CAT} s t) i))))`,
210
+ ),
211
+ ],
212
+ );
213
+ case "Append":
214
+ return fixed(
215
+ 2,
216
+ [...SEQUENCE_DEPS, "IntLit_1"],
217
+ [
218
+ axiom(
219
+ "SeqAppendTyping",
220
+ [],
221
+ `(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
222
+ ),
223
+ axiom(
224
+ "SeqAppendLen",
225
+ [],
226
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${INT_PLUS} (${LEN} s) ${ONE}))) :pattern ((${APPEND} s x))))`,
227
+ ),
228
+ axiom(
229
+ "SeqAppendApp1",
230
+ [],
231
+ `(forall ((s Idv) (x Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (= (${FUN_APP} (${APPEND} s x) i) (${FUN_APP} s i))) :pattern ((${FUN_APP} (${APPEND} s x) i)) :pattern ((${APPEND} s x) (${FUN_APP} s i))))`,
232
+ ),
233
+ axiom(
234
+ "SeqAppendApp2",
235
+ [],
236
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${INT_PLUS} (${LEN} s) ${ONE})) x)) :pattern ((${APPEND} s x))))`,
237
+ ),
238
+ ],
239
+ );
240
+ case "Head":
241
+ return fixed(
242
+ 1,
243
+ ["FunApp", "IntLit_1"],
244
+ [
245
+ axiom(
246
+ "SeqHeadDef",
247
+ [],
248
+ `(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s ${ONE})) :pattern ((${HEAD} s))))`,
249
+ ),
250
+ ],
251
+ );
252
+ case "Tail":
253
+ return fixed(
254
+ 1,
255
+ [...SEQUENCE_DEPS, "IntMinus", "IntLit_0", "IntLit_1"],
256
+ [
257
+ axiom(
258
+ "SeqTailTyping",
259
+ [],
260
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${LEN} s) ${ZERO})) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
261
+ ),
262
+ axiom(
263
+ "SeqTailLen",
264
+ [],
265
+ `(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${LEN} s) ${ZERO})) (= (${LEN} (${TAIL} s)) (${INT_MINUS} (${LEN} s) ${ONE}))) :pattern ((${TAIL} s))))`,
266
+ ),
267
+ axiom(
268
+ "SeqTailApp",
269
+ [],
270
+ `(forall ((s Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${LEN} s) ${ZERO}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${INT_MINUS} (${LEN} s) ${ONE}))) (= (${FUN_APP} (${TAIL} s) i) (${FUN_APP} s (${INT_PLUS} i ${ONE})))) :pattern ((${FUN_APP} (${TAIL} s) i))))`,
271
+ ),
272
+ ],
273
+ );
274
+ case "SubSeq":
275
+ return fixed(
276
+ 3,
277
+ [
278
+ "Mem",
279
+ "Seq",
280
+ "Len",
281
+ "FunApp",
282
+ "IntSet",
283
+ "IntPlus",
284
+ "IntMinus",
285
+ "IntLteq",
286
+ "IntLit_0",
287
+ "IntLit_1",
288
+ ],
289
+ [
290
+ axiom(
291
+ "SeqSubseqTyping",
292
+ [],
293
+ `(forall ((a Idv) (s Idv) (x Idv) (y Idv)) (! (=> (or (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} y x) (distinct y x)) (and (${MEM} s (${SEQ} a)) (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} ${ONE} x) (${INT_LTEQ} y (${LEN} s)))) (${MEM} (${SUB_SEQ} s x y) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${SUB_SEQ} s x y))))`,
294
+ ),
295
+ axiom(
296
+ "SeqSubseqLen",
297
+ [],
298
+ `(forall ((s Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET})) (and (=> (${INT_LTEQ} x (${INT_PLUS} y ${ONE})) (= (${LEN} (${SUB_SEQ} s x y)) (${INT_MINUS} (${INT_PLUS} y ${ONE}) x))) (=> (not (${INT_LTEQ} x (${INT_PLUS} y ${ONE}))) (= (${LEN} (${SUB_SEQ} s x y)) ${ZERO})))) :pattern ((${SUB_SEQ} s x y))))`,
299
+ ),
300
+ axiom(
301
+ "SeqSubseqApp",
302
+ [],
303
+ `(forall ((s Idv) (x Idv) (y Idv) (z Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${MEM} z ${INT_SET}) (${INT_LTEQ} ${ONE} x) (${INT_LTEQ} ${ONE} z) (${INT_LTEQ} z (${INT_MINUS} (${INT_PLUS} y ${ONE}) x))) (= (${FUN_APP} (${SUB_SEQ} s x y) z) (${FUN_APP} s (${INT_MINUS} (${INT_PLUS} z x) ${ONE})))) :pattern ((${FUN_APP} (${SUB_SEQ} s x y) z))))`,
304
+ ),
305
+ ],
306
+ );
307
+ default:
308
+ return undefined;
309
+ }
310
+ };
@@ -1,5 +1,3 @@
1
- // encode/n_axioms.ml: the formulas of the axioms that depend on a count or on fields.
2
-
3
1
  import {
4
2
  call,
5
3
  CAST_INT,
@@ -18,7 +16,6 @@ import {
18
16
  } from "./format";
19
17
  import { axiom, TYPED_SYMBOLS, type AxiomArgument } from "./table";
20
18
 
21
- // The arithmetic symbols with a Typing axiom: each one's SMT-LIB operator and arity.
22
19
  export const TYPED_OPERATORS: Record<string, [string, number]> = {
23
20
  IntPlus: ["+", 2],
24
21
  IntMinus: ["-", 2],
@@ -74,12 +71,15 @@ export const getEnumeration = (count: number) => {
74
71
  return [intro, elim];
75
72
  };
76
73
 
77
- export const getIntegers = (count: number) =>
78
- Array.from({ length: count }, (_value, index) => `(${CAST_INT} ${index + 1})`);
74
+ // Standardize writes a typed number as a cast and an untyped one as an IntLit.
75
+ export const getNumeral = (value: number, isArithmetic: boolean) =>
76
+ isArithmetic ? `(${CAST_INT} ${value})` : tla(`IntLit_${value}`);
77
+
78
+ export const getIntegers = (count: number, isArithmetic: boolean) =>
79
+ Array.from({ length: count }, (_value, index) => getNumeral(index + 1, isArithmetic));
79
80
 
80
81
  export const getFieldKeys = (fields: string[]) => fields.map((field) => tla(`StrLit_${field}`));
81
82
 
82
- // TupExcept and RecExcept: updating one component of a tuple or record.
83
83
  const getComponentExcepts = (
84
84
  prefix: string,
85
85
  args: AxiomArgument[],
@@ -98,14 +98,12 @@ const getComponentExcepts = (
98
98
  });
99
99
  };
100
100
 
101
- export const getTupleExcepts = (count: number) =>
102
- getComponentExcepts("Tup", [count], tla(`Tuple_${count}`), getIntegers(count));
101
+ export const getTupleExcepts = (count: number, isArithmetic: boolean) =>
102
+ getComponentExcepts("Tup", [count], tla(`Tuple_${count}`), getIntegers(count, isArithmetic));
103
103
 
104
104
  export const getRecordExcepts = (fields: string[]) =>
105
105
  getComponentExcepts("Rec", [fields], tla(`Record_${fields.join("_")}`), getFieldKeys(fields));
106
106
 
107
- // TupIsafcn, TupDomDef and TupAppDef, or their Rec counterparts: a tuple or record is the
108
- // function from its keys to its components. The empty tuple has no domain or components to define.
109
107
  const getComponentFunction = (
110
108
  prefix: string,
111
109
  args: AxiomArgument[],
@@ -141,12 +139,12 @@ const getComponentFunction = (
141
139
  ];
142
140
  };
143
141
 
144
- export const getTupleAxioms = (count: number, isExcept: boolean) => {
142
+ export const getTupleAxioms = (count: number, isExcept: boolean, isArithmetic: boolean) => {
145
143
  const symbol = tla(`Tuple_${count}`);
146
144
  const elements = getNames("x", count);
147
145
  const value = call(symbol, elements);
148
146
  return [
149
- ...getComponentFunction("Tup", [count], symbol, getIntegers(count)),
147
+ ...getComponentFunction("Tup", [count], symbol, getIntegers(count, isArithmetic)),
150
148
  axiom(
151
149
  "SeqTupTyping",
152
150
  [count],
@@ -161,9 +159,9 @@ export const getTupleAxioms = (count: number, isExcept: boolean) => {
161
159
  axiom(
162
160
  "SeqTupLen",
163
161
  [count],
164
- forall(elements, `(= (${LEN} ${value}) (${CAST_INT} ${count}))`, [[value]]),
162
+ forall(elements, `(= (${LEN} ${value}) ${getNumeral(count, isArithmetic)})`, [[value]]),
165
163
  ),
166
- ...(isExcept ? getTupleExcepts(count) : []),
164
+ ...(isExcept ? getTupleExcepts(count, isArithmetic) : []),
167
165
  ];
168
166
  };
169
167
 
@@ -172,7 +170,6 @@ export const getRecordAxioms = (fields: string[], isExcept: boolean) => [
172
170
  ...(isExcept ? getRecordExcepts(fields) : []),
173
171
  ];
174
172
 
175
- // The set of tuples or records whose components are in the given sets.
176
173
  export const getComponentSet = (
177
174
  name: string,
178
175
  args: AxiomArgument[],
@@ -1,13 +1,30 @@
1
- // ctx.ml and backend/smtlib.ml's naming: each name is salted past the names in scope.
2
-
3
1
  import { formatName } from "./format";
4
2
 
5
- // A quantifier's variables, in scope until the quantifier's closing parenthesis.
6
3
  interface QuantifierScope {
7
4
  depth: number;
8
5
  exits: (() => void)[];
9
6
  }
10
7
 
8
+ interface LetScope {
9
+ depth: number;
10
+ names: number[];
11
+ }
12
+
13
+ // The index of each name a LET binds, and of the parenthesis that closes its definitions.
14
+ const getLetNames = (tokens: RegExpMatchArray[], start: number) => {
15
+ const names: number[] = [];
16
+ let position = start;
17
+ let depth = 0;
18
+ do {
19
+ const token = tokens[position][0];
20
+ if (token === "(") depth++;
21
+ if (token === ")") depth--;
22
+ if (token === "(" && depth === 2) names.push(position + 1);
23
+ position++;
24
+ } while (depth > 0);
25
+ return { names, end: position - 1 };
26
+ };
27
+
11
28
  export interface Identifier {
12
29
  base: string;
13
30
  salt: number;
@@ -16,8 +33,6 @@ export interface Identifier {
16
33
 
17
34
  const getSaltedName = (base: string, salt: number) => (salt === 0 ? base : `${base}_${salt}`);
18
35
 
19
- // Ctx.maybe_adj: a name is its formatted base, salted past the last one with that base and past
20
- // every name in scope.
21
36
  export const createContext = () => {
22
37
  const salts = new Map<string, number>();
23
38
  const names = new Set<string>();
@@ -30,7 +45,6 @@ export const createContext = () => {
30
45
  ) ?? start;
31
46
  return { base, salt, name: getSaltedName(base, salt) };
32
47
  };
33
- // Brings an identifier into scope and returns how to take it out again.
34
48
  const enter = (identifier: Identifier) => {
35
49
  const previous = salts.get(identifier.base);
36
50
  salts.set(identifier.base, identifier.salt);
@@ -44,11 +58,9 @@ export const createContext = () => {
44
58
  return { names, adjoin, enter };
45
59
  };
46
60
 
47
- // Smtlib.pp_print_obligation names each declaration for the rest of the obligation, and each
48
- // quantifier's variables within it, so a variable's name depends on the names in scope.
49
61
  export const createPrinter = (declared: Map<string, Identifier>) => {
50
62
  const context = createContext();
51
- const resolve = (line: string) => {
63
+ return (line: string) => {
52
64
  const declaration = /^\(declare-fun (\S+)/.exec(line)?.[1];
53
65
  if (declaration !== undefined) {
54
66
  const identifier = declared.get(declaration);
@@ -60,42 +72,59 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
60
72
  const replacements = new Map<number, string>();
61
73
  const renames = new Map<string, string[]>();
62
74
  const scopes: QuantifierScope[] = [];
63
- const state = { index: 0, depth: 0 };
64
- while (state.index < tokens.length) {
65
- const token = tokens[state.index][0];
75
+ const lets = new Map<number, LetScope>();
76
+ const bindName = (index: number, scope: QuantifierScope) => {
77
+ const raw = tokens[index][0];
78
+ const identifier = context.adjoin(raw.replace(/(:\w+)?#\d+$/, ""));
79
+ const stack = renames.get(raw) ?? [];
80
+ renames.set(raw, [...stack, identifier.name]);
81
+ scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
82
+ replacements.set(index, identifier.name);
83
+ };
84
+ let position = 0;
85
+ let depth = 0;
86
+ while (position < tokens.length) {
87
+ const token = tokens[position][0];
88
+ if (token === "(" && tokens[position + 1]?.[0] === "let") {
89
+ const found = getLetNames(tokens, position + 2);
90
+ lets.set(found.end, { depth: depth + 1, names: found.names });
91
+ }
66
92
  const isQuantifier =
67
93
  token === "(" &&
68
- (tokens[state.index + 1]?.[0] === "forall" || tokens[state.index + 1]?.[0] === "exists") &&
69
- tokens[state.index + 2]?.[0] === "(";
94
+ (tokens[position + 1]?.[0] === "forall" || tokens[position + 1]?.[0] === "exists") &&
95
+ tokens[position + 2]?.[0] === "(";
70
96
  if (isQuantifier) {
71
- state.depth++;
72
- const scope: QuantifierScope = { depth: state.depth, exits: [] };
97
+ depth++;
98
+ const scope: QuantifierScope = { depth, exits: [] };
73
99
  scopes.push(scope);
74
- state.index += 3;
75
- while (tokens[state.index]?.[0] === "(") {
76
- const raw = tokens[state.index + 1][0];
77
- const identifier = context.adjoin(raw.replace(/#\d+$/, ""));
78
- const stack = renames.get(raw) ?? [];
79
- renames.set(raw, [...stack, identifier.name]);
80
- scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
81
- replacements.set(state.index + 1, identifier.name);
82
- state.index += 4;
100
+ position += 3;
101
+ while (tokens[position]?.[0] === "(") {
102
+ bindName(position + 1, scope);
103
+ position += 4;
83
104
  }
84
- state.index++;
105
+ position++;
85
106
  continue;
86
107
  }
87
- if (token === "(") state.depth++;
108
+ if (token === "(") depth++;
88
109
  if (token === ")") {
89
- if (scopes.at(-1)?.depth === state.depth)
110
+ if (scopes.at(-1)?.depth === depth)
90
111
  scopes
91
112
  .pop()
92
113
  ?.exits.toReversed()
93
114
  .forEach((exit) => exit());
94
- state.depth--;
115
+ depth--;
95
116
  }
96
117
  const name = renames.get(token)?.at(-1);
97
- if (name !== undefined) replacements.set(state.index, name);
98
- state.index++;
118
+ if (name !== undefined) replacements.set(position, name);
119
+ // Smtlib names a LET's definitions in order, though it prints them last first, and only its
120
+ // body sees them.
121
+ const letScope = lets.get(position);
122
+ if (letScope !== undefined) {
123
+ const scope: QuantifierScope = { depth: letScope.depth, exits: [] };
124
+ letScope.names.toReversed().forEach((index) => bindName(index, scope));
125
+ scopes.push(scope);
126
+ }
127
+ position++;
99
128
  }
100
129
  return tokens
101
130
  .map((match, index) => {
@@ -104,5 +133,4 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
104
133
  })
105
134
  .join("");
106
135
  };
107
- return { resolve };
108
136
  };