tla-ts 0.0.3 → 0.0.4-dev.2a873ee

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 (370) 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 +996 -0
  17. package/dist/prove.js +996 -0
  18. package/dist/run-cli.cjs +37 -20
  19. package/dist/run-cli.js +37 -20
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1387 -18
  23. package/dist/transfer.js +1387 -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 +4 -7
  29. package/src/builtins.ts +29 -11
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/canonical.ts +4 -3
  32. package/src/check.ts +1540 -235
  33. package/src/cli-options.ts +12 -6
  34. package/src/cli.ts +8 -1
  35. package/src/codegen.ts +98 -39
  36. package/src/config.ts +254 -181
  37. package/src/dependencies.ts +2 -2
  38. package/src/environment.ts +540 -140
  39. package/src/errors.ts +284 -4
  40. package/src/evaluate.ts +1043 -293
  41. package/src/exit-codes.ts +22 -43
  42. package/src/fingerprints.ts +46 -11
  43. package/src/index.ts +11 -0
  44. package/src/instances.ts +19 -16
  45. package/src/java-overrides.ts +104 -25
  46. package/src/levels.ts +191 -45
  47. package/src/lexer.ts +127 -30
  48. package/src/live-check.ts +867 -0
  49. package/src/liveness.ts +218 -572
  50. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  51. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  52. package/src/obligations/ctx.ts +64 -0
  53. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  54. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  55. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  56. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  57. package/src/{obligations.ts → obligations/index.ts} +32 -16
  58. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  59. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  60. package/src/obligations/pickle.ts +98 -0
  61. package/src/obligations/pragma.ts +189 -0
  62. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  63. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  64. package/src/{obligation-source.ts → obligations/source.ts} +156 -99
  65. package/src/obligations/temporal.ts +321 -0
  66. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  67. package/src/ocaml-marshal.ts +166 -0
  68. package/src/parallel-worker.ts +169 -224
  69. package/src/parallel.ts +140 -81
  70. package/src/parser.ts +456 -147
  71. package/src/pcal-ast.ts +770 -0
  72. package/src/pcal-parse.ts +1523 -0
  73. package/src/pcal-tokenize.ts +516 -0
  74. package/src/pcal-translate.ts +1230 -0
  75. package/src/pcal-validate.ts +454 -0
  76. package/src/prove/decide-pool.ts +95 -0
  77. package/src/prove/deciders.ts +33 -0
  78. package/src/prove/first-order.ts +78 -0
  79. package/src/prove/isabelle/LICENSE +36 -0
  80. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  81. package/src/prove/isabelle/decide.ts +47 -0
  82. package/src/prove/isabelle/encode.ts +446 -0
  83. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  84. package/src/prove/isabelle/isar/method.ts +367 -0
  85. package/src/prove/isabelle/isar/proof.ts +28 -0
  86. package/src/prove/isabelle/isar/statement.ts +57 -0
  87. package/src/prove/isabelle/isar/theory.ts +192 -0
  88. package/src/prove/isabelle/isar/type-check.ts +278 -0
  89. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  90. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  91. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  92. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  93. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  94. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  95. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  96. package/src/prove/isabelle/provers/classical.ts +389 -0
  97. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  98. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  99. package/src/prove/isabelle/pure/consts.ts +32 -0
  100. package/src/prove/isabelle/pure/conv.ts +79 -0
  101. package/src/prove/isabelle/pure/drule.ts +264 -0
  102. package/src/prove/isabelle/pure/envir.ts +331 -0
  103. package/src/prove/isabelle/pure/goal.ts +53 -0
  104. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  105. package/src/prove/isabelle/pure/list.ts +12 -0
  106. package/src/prove/isabelle/pure/logic.ts +330 -0
  107. package/src/prove/isabelle/pure/name.ts +98 -0
  108. package/src/prove/isabelle/pure/net.ts +215 -0
  109. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  110. package/src/prove/isabelle/pure/pattern.ts +631 -0
  111. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  112. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  113. package/src/prove/isabelle/pure/search.ts +68 -0
  114. package/src/prove/isabelle/pure/seq.ts +133 -0
  115. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  116. package/src/prove/isabelle/pure/table.ts +201 -0
  117. package/src/prove/isabelle/pure/tactic.ts +168 -0
  118. package/src/prove/isabelle/pure/tactical.ts +264 -0
  119. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  120. package/src/prove/isabelle/pure/term.ts +688 -0
  121. package/src/prove/isabelle/pure/thm.ts +783 -0
  122. package/src/prove/isabelle/pure/type.ts +121 -0
  123. package/src/prove/isabelle/pure/unify.ts +753 -0
  124. package/src/prove/isabelle/pure/variable.ts +25 -0
  125. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  126. package/src/prove/isabelle/tla/context.ts +74 -0
  127. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  128. package/src/prove/isabelle/tla/logic.ts +215 -0
  129. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  130. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  131. package/src/prove/ocaml.ts +22 -0
  132. package/src/prove/prep/action.ts +508 -0
  133. package/src/prove/prep/defs.ts +33 -0
  134. package/src/prove/prep/elab.ts +156 -0
  135. package/src/prove/prep/enabled-axioms.ts +189 -0
  136. package/src/prove/prep/enabled.ts +43 -0
  137. package/src/prove/prep/fingerprint.ts +388 -0
  138. package/src/prove/prep/flatten.ts +70 -0
  139. package/src/prove/prep/level-comparison.ts +529 -0
  140. package/src/prove/prep/md5.ts +67 -0
  141. package/src/prove/prep/pragma.ts +221 -0
  142. package/src/prove/prep/trivial.ts +22 -0
  143. package/src/prove/prove-worker.ts +22 -0
  144. package/src/prove/prove.ts +498 -0
  145. package/src/prove/ptl/decide.ts +68 -0
  146. package/src/prove/ptl/encode.ts +255 -0
  147. package/src/prove/ptl/sat.ts +151 -0
  148. package/src/prove/ptl/tableau.ts +276 -0
  149. package/src/prove/smt/axiomatize.ts +69 -0
  150. package/src/prove/smt/axioms.ts +209 -0
  151. package/src/prove/smt/context.ts +108 -0
  152. package/src/prove/smt/data.ts +636 -0
  153. package/src/prove/smt/encode.ts +164 -0
  154. package/src/prove/smt/extensionality.ts +65 -0
  155. package/src/prove/smt/flatten.ts +112 -0
  156. package/src/prove/smt/format.ts +154 -0
  157. package/src/prove/smt/instances.ts +181 -0
  158. package/src/prove/smt/rewrite.ts +772 -0
  159. package/src/prove/smt/simplify.ts +57 -0
  160. package/src/prove/smt/solver/act-cache.ts +265 -0
  161. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prove/smt/solver/array.ts +22 -0
  163. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prove/smt/solver/ast-lt.ts +157 -0
  165. package/src/prove/smt/solver/ast-util.ts +91 -0
  166. package/src/prove/smt/solver/ast.ts +1315 -0
  167. package/src/prove/smt/solver/auf-solver.ts +572 -0
  168. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prove/smt/solver/cg-table.ts +175 -0
  170. package/src/prove/smt/solver/clause.ts +276 -0
  171. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prove/smt/solver/context.ts +1292 -0
  173. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prove/smt/solver/der.ts +224 -0
  175. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prove/smt/solver/e-matching.ts +659 -0
  177. package/src/prove/smt/solver/enode.ts +259 -0
  178. package/src/prove/smt/solver/expr-ref.ts +21 -0
  179. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prove/smt/solver/fingerprints.ts +92 -0
  181. package/src/prove/smt/solver/flat-literals.ts +51 -0
  182. package/src/prove/smt/solver/goal.ts +138 -0
  183. package/src/prove/smt/solver/hash.ts +173 -0
  184. package/src/prove/smt/solver/hashtable.ts +166 -0
  185. package/src/prove/smt/solver/internalizer.ts +1381 -0
  186. package/src/prove/smt/solver/lbool.ts +5 -0
  187. package/src/prove/smt/solver/literal.ts +24 -0
  188. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prove/smt/solver/lp/containers.ts +296 -0
  191. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prove/smt/solver/lp/nex.ts +120 -0
  208. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prove/smt/solver/model-checker.ts +347 -0
  238. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prove/smt/solver/model-finder.ts +155 -0
  240. package/src/prove/smt/solver/model-generator.ts +97 -0
  241. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prove/smt/solver/nnf.ts +469 -0
  255. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prove/smt/solver/propagate-values.ts +83 -0
  258. package/src/prove/smt/solver/proto-model.ts +551 -0
  259. package/src/prove/smt/solver/pull-quant.ts +139 -0
  260. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prove/smt/solver/qe-lite.ts +381 -0
  263. package/src/prove/smt/solver/qi-queue.ts +362 -0
  264. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prove/smt/solver/random-gen.ts +10 -0
  268. package/src/prove/smt/solver/rational.ts +165 -0
  269. package/src/prove/smt/solver/ref-vector.ts +62 -0
  270. package/src/prove/smt/solver/relevancy.ts +247 -0
  271. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prove/smt/solver/rewriter.ts +843 -0
  273. package/src/prove/smt/solver/rlimit.ts +79 -0
  274. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prove/smt/solver/solver.ts +71 -0
  276. package/src/prove/smt/solver/sort.ts +35 -0
  277. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prove/smt/solver/theory-lra.ts +56 -0
  286. package/src/prove/smt/solver/var-subst.ts +258 -0
  287. package/src/prove/smt/solver/z3-license.txt +10 -0
  288. package/src/prove/smt/table.ts +170 -0
  289. package/src/prove/tlapm/tlapm.ts +96 -0
  290. package/src/prove/tlaps-module.ts +510 -0
  291. package/src/prove/verdict.ts +18 -0
  292. package/src/prove/zenon/LICENSE +32 -0
  293. package/src/prove/zenon/check/check.ts +105 -0
  294. package/src/prove/zenon/check/definitions.ts +144 -0
  295. package/src/prove/zenon/check/equality.ts +182 -0
  296. package/src/prove/zenon/check/functions.ts +62 -0
  297. package/src/prove/zenon/check/keys.ts +125 -0
  298. package/src/prove/zenon/check/propositional.ts +104 -0
  299. package/src/prove/zenon/check/records.ts +188 -0
  300. package/src/prove/zenon/check/relations.ts +121 -0
  301. package/src/prove/zenon/check/rewrites.ts +224 -0
  302. package/src/prove/zenon/check/sets.ts +302 -0
  303. package/src/prove/zenon/check/terms.ts +127 -0
  304. package/src/prove/zenon/check/tla.ts +126 -0
  305. package/src/prove/zenon/decide.ts +113 -0
  306. package/src/prove/zenon/encode.ts +379 -0
  307. package/src/prove/zenon/eqrel.ts +300 -0
  308. package/src/prove/zenon/equality-rules.ts +435 -0
  309. package/src/prove/zenon/expr.ts +551 -0
  310. package/src/prove/zenon/index-table.ts +350 -0
  311. package/src/prove/zenon/isar-case.ts +513 -0
  312. package/src/prove/zenon/isar.ts +1249 -0
  313. package/src/prove/zenon/limits.ts +15 -0
  314. package/src/prove/zenon/llproof.ts +173 -0
  315. package/src/prove/zenon/mltoll.ts +1566 -0
  316. package/src/prove/zenon/node.ts +297 -0
  317. package/src/prove/zenon/ocaml.ts +169 -0
  318. package/src/prove/zenon/parse.ts +247 -0
  319. package/src/prove/zenon/phrase.ts +191 -0
  320. package/src/prove/zenon/proof.ts +198 -0
  321. package/src/prove/zenon/propositional-rules.ts +387 -0
  322. package/src/prove/zenon/rules.ts +94 -0
  323. package/src/prove/zenon/search.ts +288 -0
  324. package/src/prove/zenon/tla/functions.ts +151 -0
  325. package/src/prove/zenon/tla/llproof.ts +480 -0
  326. package/src/prove/zenon/tla/records.ts +225 -0
  327. package/src/prove/zenon/tla/rewrites.ts +447 -0
  328. package/src/prove/zenon/tla/sets.ts +304 -0
  329. package/src/prove/zenon/tla/terms.ts +162 -0
  330. package/src/prove/zenon/tla/tla.ts +506 -0
  331. package/src/randomization.ts +24 -7
  332. package/src/resolve.ts +1481 -426
  333. package/src/run-cli.ts +1483 -212
  334. package/src/runtime.ts +19 -1
  335. package/src/sany-builtins.ts +147 -0
  336. package/src/sany-generator.ts +3128 -0
  337. package/src/sany-levels.ts +1208 -0
  338. package/src/sany-lexer.ts +545 -0
  339. package/src/sany-linter.ts +122 -0
  340. package/src/sany-modules.ts +1398 -0
  341. package/src/sany-nodes.ts +463 -0
  342. package/src/sany-parse-error.ts +2161 -0
  343. package/src/sany-report.ts +356 -0
  344. package/src/sany-selectors.ts +738 -0
  345. package/src/sany-source.ts +248 -0
  346. package/src/sany-xml.ts +1017 -0
  347. package/src/spec-description.ts +42 -11
  348. package/src/standard-modules.ts +203 -148
  349. package/src/standard-ranges.ts +116 -0
  350. package/src/state-graph.ts +180 -0
  351. package/src/subexpressions.ts +231 -171
  352. package/src/substitution-levels.ts +38 -17
  353. package/src/successors.ts +241 -110
  354. package/src/symmetry.ts +194 -54
  355. package/src/tableau.ts +54 -25
  356. package/src/tlapm-cache.ts +236 -0
  357. package/src/tlc-ext.ts +42 -29
  358. package/src/tlc-messages.ts +329 -0
  359. package/src/tlc-module.ts +52 -43
  360. package/src/tlc-modules.ts +4 -0
  361. package/src/tlc-order.ts +78 -10
  362. package/src/tlc-random.ts +84 -33
  363. package/src/tlc-replay.ts +655 -0
  364. package/src/tlc-summary.ts +20 -5
  365. package/src/tlc-version.ts +19 -0
  366. package/src/transfer.ts +15 -3
  367. package/src/values.ts +787 -190
  368. package/src/worker.ts +65 -0
  369. package/dist/parallel.cjs +0 -12
  370. package/dist/parallel.js +0 -12
@@ -0,0 +1,138 @@
1
+ // Ported from Z3 (src/tactic/goal.cpp), MIT license, see z3-license.txt. The formulas that a tactic
2
+ // transforms, kept split into conjuncts. Like Z3's goal, it holds a reference to each formula.
3
+ import { OP_AND, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
4
+ import { RefVector } from "./ref-vector";
5
+
6
+ interface Polarized {
7
+ expr: number;
8
+ isPositive: boolean;
9
+ }
10
+
11
+ export class Goal {
12
+ readonly forms: RefVector;
13
+ isInconsistent = false;
14
+
15
+ constructor(private manager: AstManager) {
16
+ this.forms = new RefVector(manager);
17
+ }
18
+
19
+ // push_back: a false formula replaces the whole goal.
20
+ private pushBack(form: number) {
21
+ const manager = this.manager;
22
+ if (manager.isTrue(form)) return;
23
+ if (manager.isFalse(form)) {
24
+ this.forms.reset();
25
+ this.isInconsistent = true;
26
+ }
27
+ this.forms.push(form);
28
+ }
29
+
30
+ // quick_process: splits conjunctions and negated disjunctions in order. With isSavingFirst, the
31
+ // first conjunct is returned instead of added. The formula comes with a reference, and so does
32
+ // the result. The negations it creates are held until it returns.
33
+ private quickProcess(form: number, isSavingFirst: boolean) {
34
+ const manager = this.manager;
35
+ const op = manager.getOp(form);
36
+ if (
37
+ op !== OP_AND &&
38
+ !(manager.isNot(form) && manager.getOp(manager.getArg(form, 0)) === OP_OR)
39
+ ) {
40
+ if (!isSavingFirst) this.pushBack(form);
41
+ return form;
42
+ }
43
+ let first = form;
44
+ let isSaving = isSavingFirst;
45
+ const created = new RefVector(manager);
46
+ const todo: Polarized[] = [{ expr: form, isPositive: true }];
47
+ for (let item = todo.pop(); item !== undefined && !this.isInconsistent; item = todo.pop()) {
48
+ const itemOp = manager.getOp(item.expr);
49
+ if ((item.isPositive && itemOp === OP_AND) || (!item.isPositive && itemOp === OP_OR))
50
+ for (let index = manager.getNumArgs(item.expr) - 1; index >= 0; index--)
51
+ todo.push({ expr: manager.getArg(item.expr, index), isPositive: item.isPositive });
52
+ else if (manager.isNot(item.expr))
53
+ todo.push({ expr: manager.getArg(item.expr, 0), isPositive: !item.isPositive });
54
+ else {
55
+ const leaf = item.isPositive ? item.expr : manager.mkApp(OP_NOT, [item.expr], SORT_BOOL);
56
+ if (!item.isPositive) created.push(leaf);
57
+ if (isSaving) {
58
+ manager.incRef(leaf);
59
+ manager.decRef(first);
60
+ first = leaf;
61
+ isSaving = false;
62
+ } else this.pushBack(leaf);
63
+ }
64
+ }
65
+ created.reset();
66
+ return first;
67
+ }
68
+
69
+ // assert_expr.
70
+ assert(form: number) {
71
+ const manager = this.manager;
72
+ manager.incRef(form);
73
+ if (!this.isInconsistent) {
74
+ manager.incRef(form);
75
+ manager.decRef(this.quickProcess(form, false));
76
+ }
77
+ manager.decRef(form);
78
+ }
79
+
80
+ // update: the first conjunct replaces the formula and the others are added at the end. When the
81
+ // first conjunct is false, Z3 adds the whole formula (goal.cpp:312), and this adds false, so the
82
+ // goal becomes inconsistent.
83
+ update(index: number, form: number) {
84
+ const manager = this.manager;
85
+ if (this.isInconsistent) return;
86
+ manager.incRef(form);
87
+ const first = this.quickProcess(form, true);
88
+ if (!this.isInconsistent) {
89
+ if (manager.isFalse(first)) this.pushBack(first);
90
+ else this.forms.set(index, first);
91
+ }
92
+ manager.decRef(first);
93
+ }
94
+
95
+ // shrink: drops the formulas from size on, the last one first.
96
+ private shrink(size: number) {
97
+ while (this.forms.size > size) this.forms.pop();
98
+ }
99
+
100
+ // elim_true.
101
+ elimTrue() {
102
+ const manager = this.manager;
103
+ let kept = 0;
104
+ for (const [index, form] of [...this.forms.items].entries()) {
105
+ if (manager.isTrue(form)) continue;
106
+ if (index !== kept) this.forms.set(kept, form);
107
+ kept++;
108
+ }
109
+ this.shrink(kept);
110
+ }
111
+
112
+ // elim_redundancies: drops true and repeated literals, and finds a complementary pair. The marks
113
+ // hold the literals until it returns.
114
+ elimRedundancies() {
115
+ const manager = this.manager;
116
+ if (this.isInconsistent) return;
117
+ const negatives = new RefVector(manager);
118
+ const positives = new RefVector(manager);
119
+ let kept = 0;
120
+ for (const [index, form] of [...this.forms.items].entries()) {
121
+ if (manager.isTrue(form)) continue;
122
+ const isNegated = manager.isNot(form);
123
+ const atom = isNegated ? manager.getArg(form, 0) : form;
124
+ const same = isNegated ? negatives : positives;
125
+ if (same.items.includes(atom)) continue;
126
+ if ((isNegated ? positives : negatives).items.includes(atom)) {
127
+ this.pushBack(manager.falseExpr);
128
+ break;
129
+ }
130
+ same.push(atom);
131
+ if (index !== kept) this.forms.set(kept, form);
132
+ kept++;
133
+ }
134
+ if (!this.isInconsistent) this.shrink(kept);
135
+ positives.reset();
136
+ negatives.reset();
137
+ }
138
+ }
@@ -0,0 +1,173 @@
1
+ // Ported from Z3 (src/util/hash.h, src/util/hash.cpp), MIT license, see z3-license.txt.
2
+ // Bob Jenkins' hash functions, on unsigned 32-bit integers. Z3 hashes every AST with them, and its
3
+ // hash tables iterate in hash order, so matching the hashes matches Z3's iteration order.
4
+ const GOLDEN_RATIO = 0x9e3779b9;
5
+
6
+ const mix = (state: Uint32Array) => {
7
+ let a = state[0];
8
+ let b = state[1];
9
+ let c = state[2];
10
+ a = (a - b - c) >>> 0;
11
+ a = (a ^ (c >>> 13)) >>> 0;
12
+ b = (b - c - a) >>> 0;
13
+ b = (b ^ (a << 8)) >>> 0;
14
+ c = (c - a - b) >>> 0;
15
+ c = (c ^ (b >>> 13)) >>> 0;
16
+ a = (a - b - c) >>> 0;
17
+ a = (a ^ (c >>> 12)) >>> 0;
18
+ b = (b - c - a) >>> 0;
19
+ b = (b ^ (a << 16)) >>> 0;
20
+ c = (c - a - b) >>> 0;
21
+ c = (c ^ (b >>> 5)) >>> 0;
22
+ a = (a - b - c) >>> 0;
23
+ a = (a ^ (c >>> 3)) >>> 0;
24
+ b = (b - c - a) >>> 0;
25
+ b = (b ^ (a << 10)) >>> 0;
26
+ c = (c - a - b) >>> 0;
27
+ c = (c ^ (b >>> 15)) >>> 0;
28
+ state[0] = a;
29
+ state[1] = b;
30
+ state[2] = c;
31
+ };
32
+
33
+ // The a, b and c of Z3's mix, which wrap like its unsigned integers. No hash function calls another
34
+ // while it uses the state, so they share one rather than allocating one per hash.
35
+ const sharedState = new Uint32Array(3);
36
+
37
+ const mkState = (a: number, b: number, c: number) => {
38
+ sharedState[0] = a;
39
+ sharedState[1] = b;
40
+ sharedState[2] = c;
41
+ return sharedState;
42
+ };
43
+
44
+ export const mkMix = (a: number, b: number, c: number) => {
45
+ const state = mkState(a, b, c);
46
+ mix(state);
47
+ return state[2];
48
+ };
49
+
50
+ export const hashU = (value: number) => {
51
+ let a = value >>> 0;
52
+ a = (a + 0x7ed55d16 + (a << 12)) >>> 0;
53
+ a = (a ^ 0xc761c23c ^ (a >>> 19)) >>> 0;
54
+ a = (a + 0x165667b1 + (a << 5)) >>> 0;
55
+ a = ((a + 0xd3a2646c) ^ (a << 9)) >>> 0;
56
+ a = (a + 0xfd7046c5 + (a << 3)) >>> 0;
57
+ a = (a ^ 0xb55a4f09 ^ (a >>> 16)) >>> 0;
58
+ return a;
59
+ };
60
+
61
+ export const combineHash = (first: number, second: number) =>
62
+ hashU((first ^ (second + GOLDEN_RATIO + (first << 6) + (first >>> 2))) >>> 0);
63
+
64
+ const encoder = new TextEncoder();
65
+
66
+ // string_hash, over the bytes of a string or of a number's digits.
67
+ export const bytesHash = (data: Uint8Array, initValue: number) => {
68
+ const readUnsigned = (offset: number) =>
69
+ (data[offset] |
70
+ (data[offset + 1] << 8) |
71
+ (data[offset + 2] << 16) |
72
+ (data[offset + 3] << 24)) >>>
73
+ 0;
74
+ const state = mkState(GOLDEN_RATIO, GOLDEN_RATIO, initValue);
75
+ let offset = 0;
76
+ let rest = data.length;
77
+ while (rest >= 12) {
78
+ state[0] += readUnsigned(offset);
79
+ state[1] += readUnsigned(offset + 4);
80
+ state[2] += readUnsigned(offset + 8);
81
+ mix(state);
82
+ offset += 12;
83
+ rest -= 12;
84
+ }
85
+ state[2] += data.length;
86
+ // The low byte of c is reserved for the length.
87
+ const shifts = [0, 8, 16, 24, 0, 8, 16, 24, 8, 16, 24];
88
+ for (let index = rest - 1; index >= 0; index--)
89
+ state[index < 4 ? 0 : index < 8 ? 1 : 2] += data[offset + index] << shifts[index];
90
+ mix(state);
91
+ return state[2];
92
+ };
93
+
94
+ export const stringHash = (text: string, initValue: number) =>
95
+ bytesHash(encoder.encode(text), initValue);
96
+
97
+ // get_composite_hash over child hashes, with the default kind hash of 17.
98
+ export const getCompositeHash = (childHashes: number[], kindHash = 17) => {
99
+ const count = childHashes.length;
100
+ const state = mkState(GOLDEN_RATIO, GOLDEN_RATIO, 11);
101
+ switch (count) {
102
+ case 0:
103
+ return state[2];
104
+ case 1:
105
+ state[0] += kindHash;
106
+ state[1] = childHashes[0];
107
+ mix(state);
108
+ return state[2];
109
+ case 2:
110
+ state[0] += kindHash;
111
+ state[1] += childHashes[0];
112
+ state[2] += childHashes[1];
113
+ mix(state);
114
+ return state[2];
115
+ case 3:
116
+ state[0] += childHashes[0];
117
+ state[1] += childHashes[1];
118
+ state[2] += childHashes[2];
119
+ mix(state);
120
+ state[0] += kindHash;
121
+ mix(state);
122
+ return state[2];
123
+ default: {
124
+ let rest = count;
125
+ while (rest >= 3) {
126
+ state[0] += childHashes[--rest];
127
+ state[1] += childHashes[--rest];
128
+ state[2] += childHashes[--rest];
129
+ mix(state);
130
+ }
131
+ state[0] += kindHash;
132
+ if (rest === 2) state[1] += childHashes[1];
133
+ if (rest >= 1) state[2] += childHashes[0];
134
+ mix(state);
135
+ return state[2];
136
+ }
137
+ }
138
+ };
139
+
140
+ // ast_array_hash: the hash of an AST from the hashes of its children, each looked up in hashes like
141
+ // Z3's get_hash.
142
+ export const astArrayHash = (items: number[], hashes: ArrayLike<number>, initValue: number) => {
143
+ const count = items.length;
144
+ switch (count) {
145
+ case 0:
146
+ return initValue;
147
+ case 1:
148
+ return combineHash(hashes[items[0]], initValue);
149
+ case 2:
150
+ return combineHash(combineHash(hashes[items[0]], hashes[items[1]]), initValue);
151
+ case 3:
152
+ return combineHash(
153
+ combineHash(hashes[items[0]], hashes[items[1]]),
154
+ combineHash(hashes[items[2]], initValue),
155
+ );
156
+ default: {
157
+ const state = mkState(GOLDEN_RATIO, GOLDEN_RATIO, initValue);
158
+ let rest = count;
159
+ while (rest >= 3) {
160
+ state[0] += hashes[items[--rest]];
161
+ state[1] += hashes[items[--rest]];
162
+ state[2] += hashes[items[--rest]];
163
+ mix(state);
164
+ }
165
+ if (rest === 2) {
166
+ state[1] += hashes[items[1]];
167
+ state[2] += hashes[items[0]];
168
+ } else if (rest === 1) state[2] += hashes[items[0]];
169
+ mix(state);
170
+ return state[2];
171
+ }
172
+ }
173
+ };
@@ -0,0 +1,166 @@
1
+ // Ported from Z3 (src/util/hashtable.h, src/util/obj_hashtable.h), MIT license, see
2
+ // z3-license.txt. Z3's open-addressing table with linear probing. Its iteration order is the slot
3
+ // order, which the model finder depends on, so the AST maps that Z3 iterates use this table.
4
+ import { SmtInvariantError } from "../../../errors";
5
+
6
+ const INITIAL_CAPACITY = 8;
7
+ const SMALL_TABLE_CAPACITY = 64;
8
+ const FREE = 0;
9
+ const DELETED = 1;
10
+ const USED = 2;
11
+
12
+ // u_hash: an unsigned key is its own hash.
13
+ export const getIdentityHash = (key: number) => key;
14
+
15
+ export class ObjMap<V> {
16
+ private capacity = INITIAL_CAPACITY;
17
+ private states = new Uint8Array(INITIAL_CAPACITY);
18
+ private slotKeys: number[] = [];
19
+ private values: V[] = [];
20
+ private numDeleted = 0;
21
+ size = 0;
22
+
23
+ constructor(private getHash: (key: number) => number) {}
24
+
25
+ private findSlot(key: number) {
26
+ const mask = this.capacity - 1;
27
+ const begin = this.getHash(key) & mask;
28
+ for (let offset = 0; offset < this.capacity; offset++) {
29
+ const slot = (begin + offset) & mask;
30
+ if (this.states[slot] === FREE) return -1;
31
+ if (this.states[slot] === USED && this.slotKeys[slot] === key) return slot;
32
+ }
33
+ return -1;
34
+ }
35
+
36
+ // move_table: reinserts the used slots, in slot order, into a table of the new capacity.
37
+ private moveTable(capacity: number) {
38
+ const states = this.states;
39
+ const keys = this.slotKeys;
40
+ const values = this.values;
41
+ this.capacity = capacity;
42
+ this.states = new Uint8Array(capacity);
43
+ this.slotKeys = [];
44
+ this.values = [];
45
+ this.numDeleted = 0;
46
+ const mask = capacity - 1;
47
+ for (let slot = 0; slot < states.length; slot++) {
48
+ if (states[slot] !== USED) continue;
49
+ let target = this.getHash(keys[slot]) & mask;
50
+ while (this.states[target] !== FREE) target = (target + 1) & mask;
51
+ this.states[target] = USED;
52
+ this.slotKeys[target] = keys[slot];
53
+ this.values[target] = values[slot];
54
+ }
55
+ }
56
+
57
+ has(key: number) {
58
+ return this.findSlot(key) !== -1;
59
+ }
60
+
61
+ get(key: number) {
62
+ const slot = this.findSlot(key);
63
+ return slot === -1 ? undefined : this.values[slot];
64
+ }
65
+
66
+ // find_core and an assignment to the entry: unlike insert, never grows the table.
67
+ replace(key: number, value: V) {
68
+ const slot = this.findSlot(key);
69
+ if (slot !== -1) this.values[slot] = value;
70
+ }
71
+
72
+ set(key: number, value: V) {
73
+ if ((this.size + this.numDeleted) << 2 > this.capacity * 3) this.moveTable(this.capacity << 1);
74
+ const mask = this.capacity - 1;
75
+ const begin = this.getHash(key) & mask;
76
+ let deletedSlot = -1;
77
+ for (let offset = 0; offset < this.capacity; offset++) {
78
+ const slot = (begin + offset) & mask;
79
+ if (this.states[slot] === USED) {
80
+ if (this.slotKeys[slot] === key) {
81
+ this.values[slot] = value;
82
+ return;
83
+ }
84
+ } else if (this.states[slot] === FREE) {
85
+ const target = deletedSlot === -1 ? slot : deletedSlot;
86
+ if (deletedSlot !== -1) this.numDeleted--;
87
+ this.states[target] = USED;
88
+ this.slotKeys[target] = key;
89
+ this.values[target] = value;
90
+ this.size++;
91
+ return;
92
+ } else deletedSlot = slot;
93
+ }
94
+ throw new SmtInvariantError("the hash table is full");
95
+ }
96
+
97
+ delete(key: number) {
98
+ const slot = this.findSlot(key);
99
+ if (slot === -1) return;
100
+ this.size--;
101
+ if (this.states[(slot + 1) & (this.capacity - 1)] === FREE) {
102
+ this.states[slot] = FREE;
103
+ return;
104
+ }
105
+ this.states[slot] = DELETED;
106
+ this.numDeleted++;
107
+ if (this.numDeleted > this.size && this.numDeleted > SMALL_TABLE_CAPACITY)
108
+ this.moveTable(this.capacity);
109
+ }
110
+
111
+ // reset: empties the table, halving it when most slots were in use.
112
+ clear() {
113
+ if (this.size === 0 && this.numDeleted === 0) return;
114
+ let overhead = 0;
115
+ for (let slot = 0; slot < this.capacity; slot++) if (this.states[slot] === FREE) overhead++;
116
+ if (this.capacity > 16 && overhead << 2 > this.capacity * 3) this.capacity >>= 1;
117
+ this.states = new Uint8Array(this.capacity);
118
+ this.slotKeys = [];
119
+ this.values = [];
120
+ this.size = 0;
121
+ this.numDeleted = 0;
122
+ }
123
+
124
+ *entries(): IterableIterator<[number, V]> {
125
+ for (let slot = 0; slot < this.capacity; slot++)
126
+ if (this.states[slot] === USED) yield [this.slotKeys[slot], this.values[slot]];
127
+ }
128
+
129
+ *keys(): IterableIterator<number> {
130
+ for (let slot = 0; slot < this.capacity; slot++)
131
+ if (this.states[slot] === USED) yield this.slotKeys[slot];
132
+ }
133
+
134
+ [Symbol.iterator]() {
135
+ return this.entries();
136
+ }
137
+ }
138
+
139
+ // obj_hashtable: a set of ASTs in Z3's slot order.
140
+ export class ObjHashtable {
141
+ private map: ObjMap<true>;
142
+
143
+ constructor(getHash: (key: number) => number) {
144
+ this.map = new ObjMap(getHash);
145
+ }
146
+
147
+ get size() {
148
+ return this.map.size;
149
+ }
150
+
151
+ has(key: number) {
152
+ return this.map.has(key);
153
+ }
154
+
155
+ add(key: number) {
156
+ this.map.set(key, true);
157
+ }
158
+
159
+ delete(key: number) {
160
+ this.map.delete(key);
161
+ }
162
+
163
+ [Symbol.iterator]() {
164
+ return this.map.keys();
165
+ }
166
+ }