tla-ts 0.0.3 → 0.0.4-dev.1a3acf6

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 (381) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1377 -18
  23. package/dist/transfer.js +1377 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +26 -30
  29. package/src/builtins.ts +45 -19
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/check.ts +1182 -900
  32. package/src/cli/options.ts +109 -0
  33. package/src/cli/run.ts +63 -0
  34. package/src/cli/shared.ts +106 -0
  35. package/src/cli/tlapm.ts +374 -0
  36. package/src/cli/tlc.ts +941 -0
  37. package/src/cli/xml-exporter.ts +221 -0
  38. package/src/cli.ts +9 -2
  39. package/src/codegen.ts +112 -51
  40. package/src/config.ts +254 -181
  41. package/src/dependencies.ts +5 -7
  42. package/src/environment.ts +579 -184
  43. package/src/errors.ts +287 -4
  44. package/src/evaluate.ts +1095 -365
  45. package/src/exit-codes.ts +22 -43
  46. package/src/fingerprints.ts +49 -14
  47. package/src/index.ts +11 -0
  48. package/src/instances.ts +73 -60
  49. package/src/java-overrides.ts +183 -66
  50. package/src/json.ts +31 -36
  51. package/src/levels.ts +197 -54
  52. package/src/lexer.ts +127 -30
  53. package/src/liveness-checker.ts +894 -0
  54. package/src/liveness.ts +246 -596
  55. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  56. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  57. package/src/obligations/equality.ts +260 -0
  58. package/src/obligations/expression.ts +618 -0
  59. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  60. package/src/obligations/generate.ts +457 -0
  61. package/src/{obligations.ts → obligations/index.ts} +46 -32
  62. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  63. package/src/obligations/module.ts +445 -0
  64. package/src/obligations/normalize.ts +554 -0
  65. package/src/obligations/operators.ts +176 -0
  66. package/src/obligations/pragma.ts +195 -0
  67. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  68. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  69. package/src/obligations/regroup.ts +100 -0
  70. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  71. package/src/{obligation-source.ts → obligations/source.ts} +174 -216
  72. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  73. package/src/obligations/substitution.ts +261 -0
  74. package/src/obligations/temporal.ts +321 -0
  75. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  76. package/src/parallel-worker.ts +184 -235
  77. package/src/parallel.ts +156 -91
  78. package/src/parser.ts +490 -188
  79. package/src/pcal/ast.ts +755 -0
  80. package/src/pcal/parse.ts +1487 -0
  81. package/src/pcal/tokenize.ts +487 -0
  82. package/src/pcal/translate.ts +1151 -0
  83. package/src/pcal/validate.ts +444 -0
  84. package/src/prover/decide-pool.ts +95 -0
  85. package/src/prover/deciders.ts +33 -0
  86. package/src/prover/first-order.ts +175 -0
  87. package/src/prover/isabelle/LICENSE +36 -0
  88. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  89. package/src/prover/isabelle/decide.ts +44 -0
  90. package/src/prover/isabelle/encode.ts +445 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  92. package/src/prover/isabelle/isar/method.ts +367 -0
  93. package/src/prover/isabelle/isar/proof.ts +28 -0
  94. package/src/prover/isabelle/isar/statement.ts +57 -0
  95. package/src/prover/isabelle/isar/theory.ts +192 -0
  96. package/src/prover/isabelle/isar/type-check.ts +278 -0
  97. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  98. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  99. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  100. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  101. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  102. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  103. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  104. package/src/prover/isabelle/provers/classical.ts +389 -0
  105. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  106. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  107. package/src/prover/isabelle/pure/consts.ts +32 -0
  108. package/src/prover/isabelle/pure/conv.ts +79 -0
  109. package/src/prover/isabelle/pure/drule.ts +264 -0
  110. package/src/prover/isabelle/pure/envir.ts +331 -0
  111. package/src/prover/isabelle/pure/goal.ts +53 -0
  112. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  113. package/src/prover/isabelle/pure/list.ts +12 -0
  114. package/src/prover/isabelle/pure/logic.ts +330 -0
  115. package/src/prover/isabelle/pure/name.ts +98 -0
  116. package/src/prover/isabelle/pure/net.ts +215 -0
  117. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  118. package/src/prover/isabelle/pure/pattern.ts +631 -0
  119. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  120. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  121. package/src/prover/isabelle/pure/search.ts +68 -0
  122. package/src/prover/isabelle/pure/seq.ts +133 -0
  123. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  124. package/src/prover/isabelle/pure/table.ts +201 -0
  125. package/src/prover/isabelle/pure/tactic.ts +168 -0
  126. package/src/prover/isabelle/pure/tactical.ts +264 -0
  127. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  128. package/src/prover/isabelle/pure/term.ts +688 -0
  129. package/src/prover/isabelle/pure/thm.ts +783 -0
  130. package/src/prover/isabelle/pure/type.ts +121 -0
  131. package/src/prover/isabelle/pure/unify.ts +753 -0
  132. package/src/prover/isabelle/pure/variable.ts +25 -0
  133. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  134. package/src/prover/isabelle/tla/context.ts +74 -0
  135. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  136. package/src/prover/isabelle/tla/logic.ts +215 -0
  137. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  138. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  139. package/src/prover/ocaml.ts +22 -0
  140. package/src/prover/prep/action.ts +508 -0
  141. package/src/prover/prep/enabled-axioms.ts +189 -0
  142. package/src/prover/prep/fingerprint.ts +388 -0
  143. package/src/prover/prep/level-comparison.ts +529 -0
  144. package/src/prover/prep/md5.ts +60 -0
  145. package/src/prover/prep/methods.ts +221 -0
  146. package/src/prover/prep/normalize.ts +309 -0
  147. package/src/prover/prove-worker.ts +22 -0
  148. package/src/prover/prove.ts +492 -0
  149. package/src/prover/ptl/decide.ts +68 -0
  150. package/src/prover/ptl/encode.ts +244 -0
  151. package/src/prover/ptl/sat.ts +151 -0
  152. package/src/prover/ptl/tableau.ts +276 -0
  153. package/src/prover/smt/axioms.ts +209 -0
  154. package/src/prover/smt/context.ts +108 -0
  155. package/src/prover/smt/data.ts +636 -0
  156. package/src/prover/smt/encode.ts +275 -0
  157. package/src/prover/smt/extensionality.ts +65 -0
  158. package/src/prover/smt/flatten.ts +112 -0
  159. package/src/prover/smt/format.ts +154 -0
  160. package/src/prover/smt/instances.ts +181 -0
  161. package/src/prover/smt/rewrite.ts +766 -0
  162. package/src/prover/smt/solver/act-cache.ts +265 -0
  163. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  164. package/src/prover/smt/solver/array.ts +22 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  166. package/src/prover/smt/solver/ast-lt.ts +157 -0
  167. package/src/prover/smt/solver/ast-util.ts +91 -0
  168. package/src/prover/smt/solver/ast.ts +1315 -0
  169. package/src/prover/smt/solver/auf-solver.ts +572 -0
  170. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  171. package/src/prover/smt/solver/cg-table.ts +175 -0
  172. package/src/prover/smt/solver/clause.ts +276 -0
  173. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  174. package/src/prover/smt/solver/context.ts +1292 -0
  175. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  176. package/src/prover/smt/solver/der.ts +224 -0
  177. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  178. package/src/prover/smt/solver/e-matching.ts +659 -0
  179. package/src/prover/smt/solver/enode.ts +259 -0
  180. package/src/prover/smt/solver/expr-ref.ts +21 -0
  181. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  182. package/src/prover/smt/solver/fingerprints.ts +92 -0
  183. package/src/prover/smt/solver/flat-literals.ts +51 -0
  184. package/src/prover/smt/solver/goal.ts +138 -0
  185. package/src/prover/smt/solver/hash.ts +173 -0
  186. package/src/prover/smt/solver/hashtable.ts +166 -0
  187. package/src/prover/smt/solver/internalizer.ts +1381 -0
  188. package/src/prover/smt/solver/lbool.ts +5 -0
  189. package/src/prover/smt/solver/literal.ts +24 -0
  190. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  191. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  192. package/src/prover/smt/solver/lp/containers.ts +296 -0
  193. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  194. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  195. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  196. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  197. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  198. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  199. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  200. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  201. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  202. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  203. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  204. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  205. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  206. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  207. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  208. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  209. package/src/prover/smt/solver/lp/nex.ts +120 -0
  210. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  211. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  212. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  213. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  214. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  215. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  216. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  217. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  218. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  219. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  220. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  221. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  222. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  223. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  224. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  225. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  226. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  227. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  228. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  229. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  230. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  231. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  232. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  233. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  234. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  235. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  236. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  237. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  238. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  239. package/src/prover/smt/solver/model-checker.ts +347 -0
  240. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  241. package/src/prover/smt/solver/model-finder.ts +155 -0
  242. package/src/prover/smt/solver/model-generator.ts +97 -0
  243. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  244. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  245. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  246. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  247. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  248. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  249. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  250. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  251. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  252. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  253. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  254. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  255. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  256. package/src/prover/smt/solver/nnf.ts +469 -0
  257. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  258. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  259. package/src/prover/smt/solver/propagate-values.ts +83 -0
  260. package/src/prover/smt/solver/proto-model.ts +551 -0
  261. package/src/prover/smt/solver/pull-quant.ts +139 -0
  262. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  263. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  264. package/src/prover/smt/solver/qe-lite.ts +381 -0
  265. package/src/prover/smt/solver/qi-queue.ts +362 -0
  266. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  267. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  268. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  269. package/src/prover/smt/solver/random-gen.ts +10 -0
  270. package/src/prover/smt/solver/rational.ts +165 -0
  271. package/src/prover/smt/solver/ref-vector.ts +62 -0
  272. package/src/prover/smt/solver/relevancy.ts +247 -0
  273. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  274. package/src/prover/smt/solver/rewriter.ts +843 -0
  275. package/src/prover/smt/solver/rlimit.ts +79 -0
  276. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  277. package/src/prover/smt/solver/solver.ts +71 -0
  278. package/src/prover/smt/solver/sort.ts +35 -0
  279. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  280. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  281. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  282. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  283. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  284. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  285. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  286. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  287. package/src/prover/smt/solver/theory-lra.ts +56 -0
  288. package/src/prover/smt/solver/var-subst.ts +258 -0
  289. package/src/prover/smt/solver/z3-license.txt +10 -0
  290. package/src/prover/smt/table.ts +170 -0
  291. package/src/prover/tlapm/cache.ts +236 -0
  292. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  293. package/src/prover/tlapm/tlapm.ts +96 -0
  294. package/src/prover/tlaps-module.ts +510 -0
  295. package/src/prover/verdict.ts +13 -0
  296. package/src/prover/zenon/LICENSE +32 -0
  297. package/src/prover/zenon/check/check.ts +105 -0
  298. package/src/prover/zenon/check/definitions.ts +144 -0
  299. package/src/prover/zenon/check/equality.ts +182 -0
  300. package/src/prover/zenon/check/functions.ts +62 -0
  301. package/src/prover/zenon/check/keys.ts +125 -0
  302. package/src/prover/zenon/check/propositional.ts +104 -0
  303. package/src/prover/zenon/check/records.ts +188 -0
  304. package/src/prover/zenon/check/relations.ts +121 -0
  305. package/src/prover/zenon/check/rewrites.ts +224 -0
  306. package/src/prover/zenon/check/sets.ts +302 -0
  307. package/src/prover/zenon/check/terms.ts +127 -0
  308. package/src/prover/zenon/check/tla.ts +126 -0
  309. package/src/prover/zenon/decide.ts +107 -0
  310. package/src/prover/zenon/encode.ts +378 -0
  311. package/src/prover/zenon/eqrel.ts +300 -0
  312. package/src/prover/zenon/equality-rules.ts +435 -0
  313. package/src/prover/zenon/expr.ts +551 -0
  314. package/src/prover/zenon/index-table.ts +350 -0
  315. package/src/prover/zenon/isar-case.ts +513 -0
  316. package/src/prover/zenon/isar.ts +1249 -0
  317. package/src/prover/zenon/limits.ts +15 -0
  318. package/src/prover/zenon/llproof.ts +173 -0
  319. package/src/prover/zenon/mltoll.ts +1566 -0
  320. package/src/prover/zenon/node.ts +297 -0
  321. package/src/prover/zenon/ocaml.ts +169 -0
  322. package/src/prover/zenon/parse.ts +247 -0
  323. package/src/prover/zenon/phrase.ts +191 -0
  324. package/src/prover/zenon/proof.ts +198 -0
  325. package/src/prover/zenon/propositional-rules.ts +387 -0
  326. package/src/prover/zenon/rules.ts +94 -0
  327. package/src/prover/zenon/search.ts +288 -0
  328. package/src/prover/zenon/tla/functions.ts +151 -0
  329. package/src/prover/zenon/tla/llproof.ts +480 -0
  330. package/src/prover/zenon/tla/records.ts +225 -0
  331. package/src/prover/zenon/tla/rewrites.ts +447 -0
  332. package/src/prover/zenon/tla/sets.ts +304 -0
  333. package/src/prover/zenon/tla/terms.ts +162 -0
  334. package/src/prover/zenon/tla/tla.ts +506 -0
  335. package/src/randomization.ts +39 -27
  336. package/src/resolve.ts +1474 -426
  337. package/src/runtime.ts +25 -7
  338. package/src/sany/builtins.ts +147 -0
  339. package/src/sany/generator.ts +3111 -0
  340. package/src/sany/levels.ts +1205 -0
  341. package/src/sany/lexer.ts +544 -0
  342. package/src/sany/linter.ts +122 -0
  343. package/src/sany/modules.ts +1398 -0
  344. package/src/sany/nodes.ts +463 -0
  345. package/src/sany/parse-error.ts +2161 -0
  346. package/src/sany/report.ts +355 -0
  347. package/src/sany/selectors.ts +736 -0
  348. package/src/sany/source.ts +247 -0
  349. package/src/sany/xml.ts +1016 -0
  350. package/src/search.ts +969 -0
  351. package/src/spec-description.ts +66 -29
  352. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  353. package/src/standard-modules.ts +215 -164
  354. package/src/state-graph.ts +181 -0
  355. package/src/subexpressions.ts +231 -171
  356. package/src/substitution-levels.ts +40 -19
  357. package/src/successors.ts +253 -125
  358. package/src/symmetry.ts +194 -54
  359. package/src/tableau.ts +60 -32
  360. package/src/tlc/fingerprint.ts +214 -0
  361. package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
  362. package/src/tlc/messages.ts +441 -0
  363. package/src/{tlc-order.ts → tlc/order.ts} +84 -16
  364. package/src/{tlc-random.ts → tlc/random.ts} +30 -189
  365. package/src/tlc/replay.ts +659 -0
  366. package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
  367. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
  368. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
  369. package/src/tlc/version.ts +19 -0
  370. package/src/transfer.ts +44 -32
  371. package/src/values.ts +843 -241
  372. package/src/worker.ts +62 -0
  373. package/dist/parallel.cjs +0 -12
  374. package/dist/parallel.js +0 -12
  375. package/dist/run-cli.cjs +0 -28
  376. package/dist/run-cli.js +0 -28
  377. package/src/canonical.ts +0 -39
  378. package/src/cli-options.ts +0 -58
  379. package/src/obligation-expression.ts +0 -1060
  380. package/src/obligation-module.ts +0 -1042
  381. package/src/run-cli.ts +0 -478
@@ -0,0 +1,265 @@
1
+ // Ported from Z3 (src/ast/act_cache.cpp, src/util/chashtable.h), MIT license, see z3-license.txt.
2
+ // The rewriter's cache from an expression and a shift to its result. It holds a reference to each
3
+ // key and value, and keeps at most maxUnused entries that were never looked up. Z3 releases the
4
+ // entries in the order of its chained hash table, so the table is ported cell for cell.
5
+ import type { AstManager } from "./ast";
6
+ import { shrink } from "./array";
7
+
8
+ const INIT_SLOTS = 8;
9
+ const INIT_CELLAR = 2;
10
+ const MIN_MAX_UNUSED = 1024;
11
+ const NO_CELL = -1;
12
+ // m_next of a free cell, which Z3 tags.
13
+ const FREE_CELL = -2;
14
+ const MAX_SPARE_CAPACITY = 1024;
15
+
16
+ interface Cells {
17
+ keys: Int32Array<ArrayBuffer>;
18
+ offsets: Int32Array<ArrayBuffer>;
19
+ values: Int32Array<ArrayBuffer>;
20
+ isUsed: Uint8Array<ArrayBuffer>;
21
+ nexts: Int32Array<ArrayBuffer>;
22
+ }
23
+
24
+ export class ActCache {
25
+ private slots = INIT_SLOTS;
26
+ private capacity = INIT_SLOTS + INIT_CELLAR;
27
+ private keys = new Int32Array(0);
28
+ private offsets = new Int32Array(0);
29
+ private values = new Int32Array(0);
30
+ // Whether client code looked the entry up, the tag of Z3's value pointer.
31
+ private isUsed = new Uint8Array(0);
32
+ private nexts = new Int32Array(0);
33
+ private nextCell = INIT_SLOTS;
34
+ private freeCell = NO_CELL;
35
+ private size = 0;
36
+ // The entries in insertion order from qhead on, where the oldest unused entry is searched.
37
+ private queueKeys: number[] = [];
38
+ private queueOffsets: number[] = [];
39
+ private qhead = 0;
40
+ private numUnused = 0;
41
+ private maxUnused: number;
42
+ // The cells of the small tables that reset and expand_table let go, by capacity. Z3 frees them and
43
+ // takes the next table from its small-object allocator, which is cheap, where V8 allocates each
44
+ // typed array slowly, so the next table of the same capacity reuses them.
45
+ private spares = new Map<number, Cells>();
46
+
47
+ constructor(
48
+ private manager: AstManager,
49
+ maxUnused: number,
50
+ ) {
51
+ this.maxUnused = Math.max(maxUnused, MIN_MAX_UNUSED);
52
+ this.initTable(INIT_SLOTS, INIT_CELLAR);
53
+ }
54
+
55
+ private initTable(slots: number, cellar: number) {
56
+ this.slots = slots;
57
+ this.capacity = slots + cellar;
58
+ const spare = this.spares.get(this.capacity);
59
+ if (spare !== undefined) this.spares.delete(this.capacity);
60
+ this.keys = spare?.keys ?? new Int32Array(this.capacity);
61
+ this.offsets = spare?.offsets ?? new Int32Array(this.capacity);
62
+ this.values = spare?.values ?? new Int32Array(this.capacity);
63
+ this.isUsed = spare?.isUsed ?? new Uint8Array(this.capacity);
64
+ this.nexts = (spare?.nexts ?? new Int32Array(this.capacity)).fill(FREE_CELL);
65
+ this.nextCell = slots;
66
+ this.freeCell = NO_CELL;
67
+ this.size = 0;
68
+ }
69
+
70
+ private retireTable() {
71
+ if (this.capacity > MAX_SPARE_CAPACITY) return;
72
+ this.spares.set(this.capacity, {
73
+ keys: this.keys,
74
+ offsets: this.offsets,
75
+ values: this.values,
76
+ isUsed: this.isUsed,
77
+ nexts: this.nexts,
78
+ });
79
+ }
80
+
81
+ private getHash(key: number, offset: number) {
82
+ return (this.manager.hashes[key] + offset) >>> 0;
83
+ }
84
+
85
+ private findCell(key: number, offset: number) {
86
+ let cell = this.getHash(key, offset) & (this.slots - 1);
87
+ if (this.nexts[cell] === FREE_CELL) return NO_CELL;
88
+ while (cell !== NO_CELL) {
89
+ if (this.keys[cell] === key && this.offsets[cell] === offset) return cell;
90
+ cell = this.nexts[cell];
91
+ }
92
+ return NO_CELL;
93
+ }
94
+
95
+ private getFreeCell() {
96
+ if (this.freeCell !== NO_CELL) {
97
+ const cell = this.freeCell;
98
+ this.freeCell = this.nexts[cell];
99
+ return cell;
100
+ }
101
+ return this.nextCell++;
102
+ }
103
+
104
+ private copyCell(target: number, source: number) {
105
+ this.keys[target] = this.keys[source];
106
+ this.offsets[target] = this.offsets[source];
107
+ this.values[target] = this.values[source];
108
+ this.isUsed[target] = this.isUsed[source];
109
+ this.nexts[target] = this.nexts[source];
110
+ }
111
+
112
+ // expand_table: copy_table into twice the slots and cellar, doubling the cellar again while it is
113
+ // too small.
114
+ private expandTable() {
115
+ const old = {
116
+ slots: this.slots,
117
+ keys: this.keys,
118
+ offsets: this.offsets,
119
+ values: this.values,
120
+ isUsed: this.isUsed,
121
+ nexts: this.nexts,
122
+ };
123
+ const size = this.size;
124
+ this.retireTable();
125
+ for (let cellar = (this.capacity - this.slots) * 2; ; cellar *= 2) {
126
+ this.initTable(old.slots * 2, cellar);
127
+ let isCopied = true;
128
+ for (let slot = 0; slot < old.slots && isCopied; slot++) {
129
+ if (old.nexts[slot] === FREE_CELL) continue;
130
+ for (let cell = slot; cell !== NO_CELL; cell = old.nexts[cell]) {
131
+ const target = this.getHash(old.keys[cell], old.offsets[cell]) & (this.slots - 1);
132
+ if (this.nexts[target] !== FREE_CELL) {
133
+ if (this.nextCell === this.capacity) {
134
+ isCopied = false;
135
+ break;
136
+ }
137
+ this.copyCell(this.nextCell, target);
138
+ this.nexts[target] = this.nextCell++;
139
+ } else this.nexts[target] = NO_CELL;
140
+ this.keys[target] = old.keys[cell];
141
+ this.offsets[target] = old.offsets[cell];
142
+ this.values[target] = old.values[cell];
143
+ this.isUsed[target] = old.isUsed[cell];
144
+ }
145
+ }
146
+ if (isCopied) break;
147
+ }
148
+ this.size = size;
149
+ }
150
+
151
+ // del_unused: deletes the oldest entry that was never looked up.
152
+ private delUnused() {
153
+ while (this.qhead < this.queueKeys.length) {
154
+ const key = this.queueKeys[this.qhead];
155
+ const offset = this.queueOffsets[this.qhead];
156
+ this.qhead++;
157
+ const cell = this.findCell(key, offset);
158
+ if (!this.isUsed[cell]) {
159
+ this.numUnused--;
160
+ const value = this.values[cell];
161
+ this.erase(key, offset);
162
+ this.manager.decRef(key);
163
+ this.manager.decRef(value);
164
+ break;
165
+ }
166
+ }
167
+ if (this.qhead === this.queueKeys.length) {
168
+ shrink(this.queueKeys, 0);
169
+ shrink(this.queueOffsets, 0);
170
+ this.qhead = 0;
171
+ } else if (this.qhead > this.maxUnused) {
172
+ this.queueKeys = this.queueKeys.slice(this.qhead);
173
+ this.queueOffsets = this.queueOffsets.slice(this.qhead);
174
+ this.qhead = 0;
175
+ }
176
+ }
177
+
178
+ private erase(key: number, offset: number) {
179
+ let cell = this.getHash(key, offset) & (this.slots - 1);
180
+ let prev = NO_CELL;
181
+ while (this.keys[cell] !== key || this.offsets[cell] !== offset) {
182
+ prev = cell;
183
+ cell = this.nexts[cell];
184
+ }
185
+ this.size--;
186
+ const next = this.nexts[cell];
187
+ if (prev === NO_CELL) {
188
+ if (next === NO_CELL) this.nexts[cell] = FREE_CELL;
189
+ else {
190
+ this.copyCell(cell, next);
191
+ this.recycleCell(next);
192
+ }
193
+ } else {
194
+ this.nexts[prev] = next;
195
+ this.recycleCell(cell);
196
+ }
197
+ }
198
+
199
+ private recycleCell(cell: number) {
200
+ this.nexts[cell] = this.freeCell;
201
+ this.freeCell = cell;
202
+ }
203
+
204
+ insert(key: number, offset: number, value: number) {
205
+ if (this.numUnused >= this.maxUnused) this.delUnused();
206
+ if (this.freeCell === NO_CELL && this.nextCell >= this.capacity) this.expandTable();
207
+ const slot = this.getHash(key, offset) & (this.slots - 1);
208
+ if (this.nexts[slot] !== FREE_CELL) {
209
+ for (let cell = slot; cell !== NO_CELL; cell = this.nexts[cell]) {
210
+ if (this.keys[cell] !== key || this.offsets[cell] !== offset) continue;
211
+ // A new value replaces the old one and clears the tag, though it is not counted as unused.
212
+ if (this.values[cell] !== value) {
213
+ this.manager.incRef(value);
214
+ this.manager.decRef(this.values[cell]);
215
+ this.values[cell] = value;
216
+ this.isUsed[cell] = 0;
217
+ }
218
+ return;
219
+ }
220
+ // The new entry takes the slot, and the old head moves to a free cell after it.
221
+ const moved = this.getFreeCell();
222
+ this.copyCell(moved, slot);
223
+ this.nexts[slot] = moved;
224
+ } else this.nexts[slot] = NO_CELL;
225
+ this.manager.incRef(key);
226
+ this.manager.incRef(value);
227
+ this.queueKeys.push(key);
228
+ this.queueOffsets.push(offset);
229
+ this.numUnused++;
230
+ this.size++;
231
+ this.keys[slot] = key;
232
+ this.offsets[slot] = offset;
233
+ this.values[slot] = value;
234
+ this.isUsed[slot] = 0;
235
+ }
236
+
237
+ find(key: number, offset: number) {
238
+ const cell = this.findCell(key, offset);
239
+ if (cell === NO_CELL) return undefined;
240
+ if (!this.isUsed[cell]) {
241
+ this.isUsed[cell] = 1;
242
+ this.numUnused--;
243
+ }
244
+ return this.values[cell];
245
+ }
246
+
247
+ // reset: releases the entries in the table's order.
248
+ reset() {
249
+ for (let slot = 0; slot < this.slots && this.size > 0; slot++) {
250
+ if (this.nexts[slot] === FREE_CELL) continue;
251
+ for (let cell = slot; cell !== NO_CELL; cell = this.nexts[cell]) {
252
+ this.manager.decRef(this.keys[cell]);
253
+ this.manager.decRef(this.values[cell]);
254
+ }
255
+ }
256
+ if (this.size > 0) {
257
+ this.retireTable();
258
+ this.initTable(INIT_SLOTS, INIT_CELLAR);
259
+ }
260
+ shrink(this.queueKeys, 0);
261
+ shrink(this.queueOffsets, 0);
262
+ this.qhead = 0;
263
+ this.numUnused = 0;
264
+ }
265
+ }