tla-ts 0.0.4-dev.4c0ab96 → 0.0.4-dev.55f2117

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 (359) hide show
  1. package/README.md +37 -126
  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 +33 -1
  8. package/dist/index.d.ts +33 -1
  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.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 +38 -44
  23. package/dist/transfer.js +38 -44
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/check.ts +7 -7
  29. package/src/{cli-options.ts → cli/options.ts} +1 -1
  30. package/src/{run-cli.ts → cli/run.ts} +293 -91
  31. package/src/cli.ts +1 -1
  32. package/src/config.ts +2 -2
  33. package/src/environment.ts +9 -9
  34. package/src/errors.ts +89 -30
  35. package/src/evaluate.ts +32 -11
  36. package/src/index.ts +10 -0
  37. package/src/levels.ts +1 -1
  38. package/src/live-check.ts +1 -1
  39. package/src/liveness.ts +1 -1
  40. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  41. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  42. package/src/obligations/ctx.ts +64 -0
  43. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  44. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  45. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  46. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  47. package/src/{obligations.ts → obligations/index.ts} +32 -16
  48. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  49. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  50. package/src/obligations/pickle.ts +98 -0
  51. package/src/obligations/pragma.ts +189 -0
  52. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  53. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  54. package/src/{obligation-source.ts → obligations/source.ts} +154 -99
  55. package/src/obligations/temporal.ts +321 -0
  56. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  57. package/src/parallel-worker.ts +4 -20
  58. package/src/parallel.ts +13 -46
  59. package/src/parser.ts +1 -1
  60. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -2
  61. package/src/{pcal-parse.ts → pcal/parse.ts} +3 -3
  62. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +2 -2
  63. package/src/{pcal-translate.ts → pcal/translate.ts} +2 -2
  64. package/src/{pcal-validate.ts → pcal/validate.ts} +6 -6
  65. package/src/prove/decide-pool.ts +95 -0
  66. package/src/prove/deciders.ts +33 -0
  67. package/src/prove/first-order.ts +78 -0
  68. package/src/prove/isabelle/LICENSE +36 -0
  69. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  70. package/src/prove/isabelle/decide.ts +47 -0
  71. package/src/prove/isabelle/encode.ts +446 -0
  72. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  73. package/src/prove/isabelle/isar/method.ts +367 -0
  74. package/src/prove/isabelle/isar/proof.ts +28 -0
  75. package/src/prove/isabelle/isar/statement.ts +57 -0
  76. package/src/prove/isabelle/isar/theory.ts +192 -0
  77. package/src/prove/isabelle/isar/type-check.ts +278 -0
  78. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  79. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  80. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  81. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  82. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  83. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  84. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  85. package/src/prove/isabelle/provers/classical.ts +389 -0
  86. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  87. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  88. package/src/prove/isabelle/pure/consts.ts +32 -0
  89. package/src/prove/isabelle/pure/conv.ts +79 -0
  90. package/src/prove/isabelle/pure/drule.ts +264 -0
  91. package/src/prove/isabelle/pure/envir.ts +331 -0
  92. package/src/prove/isabelle/pure/goal.ts +53 -0
  93. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  94. package/src/prove/isabelle/pure/list.ts +12 -0
  95. package/src/prove/isabelle/pure/logic.ts +330 -0
  96. package/src/prove/isabelle/pure/name.ts +98 -0
  97. package/src/prove/isabelle/pure/net.ts +215 -0
  98. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  99. package/src/prove/isabelle/pure/pattern.ts +631 -0
  100. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  101. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  102. package/src/prove/isabelle/pure/search.ts +68 -0
  103. package/src/prove/isabelle/pure/seq.ts +133 -0
  104. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  105. package/src/prove/isabelle/pure/table.ts +201 -0
  106. package/src/prove/isabelle/pure/tactic.ts +168 -0
  107. package/src/prove/isabelle/pure/tactical.ts +264 -0
  108. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  109. package/src/prove/isabelle/pure/term.ts +688 -0
  110. package/src/prove/isabelle/pure/thm.ts +783 -0
  111. package/src/prove/isabelle/pure/type.ts +121 -0
  112. package/src/prove/isabelle/pure/unify.ts +753 -0
  113. package/src/prove/isabelle/pure/variable.ts +25 -0
  114. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  115. package/src/prove/isabelle/tla/context.ts +74 -0
  116. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  117. package/src/prove/isabelle/tla/logic.ts +215 -0
  118. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  119. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  120. package/src/prove/ocaml.ts +22 -0
  121. package/src/prove/prep/action.ts +508 -0
  122. package/src/prove/prep/defs.ts +33 -0
  123. package/src/prove/prep/elab.ts +156 -0
  124. package/src/prove/prep/enabled-axioms.ts +189 -0
  125. package/src/prove/prep/enabled.ts +43 -0
  126. package/src/prove/prep/fingerprint.ts +388 -0
  127. package/src/prove/prep/flatten.ts +70 -0
  128. package/src/prove/prep/level-comparison.ts +529 -0
  129. package/src/prove/prep/md5.ts +67 -0
  130. package/src/prove/prep/pragma.ts +221 -0
  131. package/src/prove/prep/trivial.ts +22 -0
  132. package/src/prove/prove-worker.ts +22 -0
  133. package/src/prove/prove.ts +498 -0
  134. package/src/prove/ptl/decide.ts +68 -0
  135. package/src/prove/ptl/encode.ts +255 -0
  136. package/src/prove/ptl/sat.ts +151 -0
  137. package/src/prove/ptl/tableau.ts +276 -0
  138. package/src/prove/smt/axiomatize.ts +69 -0
  139. package/src/prove/smt/axioms.ts +209 -0
  140. package/src/prove/smt/context.ts +108 -0
  141. package/src/prove/smt/data.ts +636 -0
  142. package/src/prove/smt/encode.ts +164 -0
  143. package/src/prove/smt/extensionality.ts +65 -0
  144. package/src/prove/smt/flatten.ts +112 -0
  145. package/src/prove/smt/format.ts +154 -0
  146. package/src/prove/smt/instances.ts +181 -0
  147. package/src/prove/smt/rewrite.ts +772 -0
  148. package/src/prove/smt/simplify.ts +57 -0
  149. package/src/prove/smt/solver/act-cache.ts +265 -0
  150. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  151. package/src/prove/smt/solver/array.ts +22 -0
  152. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  153. package/src/prove/smt/solver/ast-lt.ts +157 -0
  154. package/src/prove/smt/solver/ast-util.ts +91 -0
  155. package/src/prove/smt/solver/ast.ts +1315 -0
  156. package/src/prove/smt/solver/auf-solver.ts +572 -0
  157. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  158. package/src/prove/smt/solver/cg-table.ts +175 -0
  159. package/src/prove/smt/solver/clause.ts +276 -0
  160. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  161. package/src/prove/smt/solver/context.ts +1292 -0
  162. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  163. package/src/prove/smt/solver/der.ts +224 -0
  164. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  165. package/src/prove/smt/solver/e-matching.ts +659 -0
  166. package/src/prove/smt/solver/enode.ts +259 -0
  167. package/src/prove/smt/solver/expr-ref.ts +21 -0
  168. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  169. package/src/prove/smt/solver/fingerprints.ts +92 -0
  170. package/src/prove/smt/solver/flat-literals.ts +51 -0
  171. package/src/prove/smt/solver/goal.ts +138 -0
  172. package/src/prove/smt/solver/hash.ts +173 -0
  173. package/src/prove/smt/solver/hashtable.ts +166 -0
  174. package/src/prove/smt/solver/internalizer.ts +1381 -0
  175. package/src/prove/smt/solver/lbool.ts +5 -0
  176. package/src/prove/smt/solver/literal.ts +24 -0
  177. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  178. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  179. package/src/prove/smt/solver/lp/containers.ts +296 -0
  180. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  181. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  182. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  183. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  184. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  185. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  186. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  187. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  188. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  189. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  190. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  191. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  192. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  193. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  194. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  195. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  196. package/src/prove/smt/solver/lp/nex.ts +120 -0
  197. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  198. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  199. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  200. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  201. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  202. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  203. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  204. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  205. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  206. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  207. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  208. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  209. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  210. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  211. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  212. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  213. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  214. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  215. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  216. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  217. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  218. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  219. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  220. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  221. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  222. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  223. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  224. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  225. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  226. package/src/prove/smt/solver/model-checker.ts +347 -0
  227. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  228. package/src/prove/smt/solver/model-finder.ts +155 -0
  229. package/src/prove/smt/solver/model-generator.ts +97 -0
  230. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  231. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  232. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  233. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  234. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  235. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  236. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  237. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  238. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  239. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  240. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  241. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  242. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  243. package/src/prove/smt/solver/nnf.ts +469 -0
  244. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  245. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  246. package/src/prove/smt/solver/propagate-values.ts +83 -0
  247. package/src/prove/smt/solver/proto-model.ts +551 -0
  248. package/src/prove/smt/solver/pull-quant.ts +139 -0
  249. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  250. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  251. package/src/prove/smt/solver/qe-lite.ts +381 -0
  252. package/src/prove/smt/solver/qi-queue.ts +362 -0
  253. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  254. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  255. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  256. package/src/prove/smt/solver/random-gen.ts +10 -0
  257. package/src/prove/smt/solver/rational.ts +165 -0
  258. package/src/prove/smt/solver/ref-vector.ts +62 -0
  259. package/src/prove/smt/solver/relevancy.ts +247 -0
  260. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  261. package/src/prove/smt/solver/rewriter.ts +843 -0
  262. package/src/prove/smt/solver/rlimit.ts +79 -0
  263. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  264. package/src/prove/smt/solver/solver.ts +71 -0
  265. package/src/prove/smt/solver/sort.ts +35 -0
  266. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  267. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  268. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  269. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  270. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  271. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  272. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  273. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  274. package/src/prove/smt/solver/theory-lra.ts +56 -0
  275. package/src/prove/smt/solver/var-subst.ts +258 -0
  276. package/src/prove/smt/solver/z3-license.txt +10 -0
  277. package/src/prove/smt/table.ts +170 -0
  278. package/src/prove/tlapm/cache.ts +236 -0
  279. package/src/prove/tlapm/ocaml-marshal.ts +166 -0
  280. package/src/prove/tlapm/tlapm.ts +96 -0
  281. package/src/prove/tlaps-module.ts +510 -0
  282. package/src/prove/verdict.ts +18 -0
  283. package/src/prove/zenon/LICENSE +32 -0
  284. package/src/prove/zenon/check/check.ts +105 -0
  285. package/src/prove/zenon/check/definitions.ts +144 -0
  286. package/src/prove/zenon/check/equality.ts +182 -0
  287. package/src/prove/zenon/check/functions.ts +62 -0
  288. package/src/prove/zenon/check/keys.ts +125 -0
  289. package/src/prove/zenon/check/propositional.ts +104 -0
  290. package/src/prove/zenon/check/records.ts +188 -0
  291. package/src/prove/zenon/check/relations.ts +121 -0
  292. package/src/prove/zenon/check/rewrites.ts +224 -0
  293. package/src/prove/zenon/check/sets.ts +302 -0
  294. package/src/prove/zenon/check/terms.ts +127 -0
  295. package/src/prove/zenon/check/tla.ts +126 -0
  296. package/src/prove/zenon/decide.ts +113 -0
  297. package/src/prove/zenon/encode.ts +379 -0
  298. package/src/prove/zenon/eqrel.ts +300 -0
  299. package/src/prove/zenon/equality-rules.ts +435 -0
  300. package/src/prove/zenon/expr.ts +551 -0
  301. package/src/prove/zenon/index-table.ts +350 -0
  302. package/src/prove/zenon/isar-case.ts +513 -0
  303. package/src/prove/zenon/isar.ts +1249 -0
  304. package/src/prove/zenon/limits.ts +15 -0
  305. package/src/prove/zenon/llproof.ts +173 -0
  306. package/src/prove/zenon/mltoll.ts +1566 -0
  307. package/src/prove/zenon/node.ts +297 -0
  308. package/src/prove/zenon/ocaml.ts +169 -0
  309. package/src/prove/zenon/parse.ts +247 -0
  310. package/src/prove/zenon/phrase.ts +191 -0
  311. package/src/prove/zenon/proof.ts +198 -0
  312. package/src/prove/zenon/propositional-rules.ts +387 -0
  313. package/src/prove/zenon/rules.ts +94 -0
  314. package/src/prove/zenon/search.ts +288 -0
  315. package/src/prove/zenon/tla/functions.ts +151 -0
  316. package/src/prove/zenon/tla/llproof.ts +480 -0
  317. package/src/prove/zenon/tla/records.ts +225 -0
  318. package/src/prove/zenon/tla/rewrites.ts +447 -0
  319. package/src/prove/zenon/tla/sets.ts +304 -0
  320. package/src/prove/zenon/tla/terms.ts +162 -0
  321. package/src/prove/zenon/tla/tla.ts +506 -0
  322. package/src/randomization.ts +1 -1
  323. package/src/resolve.ts +1 -1
  324. package/src/runtime.ts +2 -2
  325. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  326. package/src/{sany-generator.ts → sany/generator.ts} +14 -14
  327. package/src/{sany-levels.ts → sany/levels.ts} +2 -2
  328. package/src/{sany-lexer.ts → sany/lexer.ts} +1 -1
  329. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  330. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  331. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  332. package/src/{sany-report.ts → sany/report.ts} +15 -15
  333. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -3
  334. package/src/{sany-source.ts → sany/source.ts} +6 -6
  335. package/src/{sany-xml.ts → sany/xml.ts} +5 -5
  336. package/src/spec-description.ts +1 -1
  337. package/src/{standard-levels.ts → standard/levels.ts} +1 -1
  338. package/src/{standard-modules.ts → standard/modules.ts} +12 -12
  339. package/src/{standard-ranges.ts → standard/ranges.ts} +1 -1
  340. package/src/state-graph.ts +1 -1
  341. package/src/successors.ts +1 -1
  342. package/src/symmetry.ts +1 -1
  343. package/src/{tlc-messages.ts → tlc/messages.ts} +2 -2
  344. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  345. package/src/{tlc-random.ts → tlc/random.ts} +3 -3
  346. package/src/{tlc-replay.ts → tlc/replay.ts} +5 -5
  347. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  348. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +14 -8
  349. package/src/values.ts +1 -1
  350. package/src/worker.ts +65 -0
  351. package/dist/parallel.cjs +0 -12
  352. package/dist/parallel.js +0 -12
  353. package/dist/run-cli.cjs +0 -55
  354. package/dist/run-cli.js +0 -55
  355. package/src/value-sources.ts +0 -29
  356. /package/src/{sany-nodes.ts → sany/nodes.ts} +0 -0
  357. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  358. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  359. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -0,0 +1,362 @@
1
+ // Ported from Z3 (src/smt/qi_queue.cpp, src/smt/smt_checker.cpp), MIT license, see
2
+ // z3-license.txt. Instances found by E-matching wait here. Z3's default cost is
3
+ // (+ weight generation): cheap instances are created at once, expensive ones only in the final
4
+ // check, and the checker skips instances that the current assignment already satisfies.
5
+ import { KIND_APP, KIND_VAR, OP_AND, OP_EQ, OP_FALSE, OP_ITE, OP_NOT, OP_OR, OP_TRUE } from "./ast";
6
+ import type { Context } from "./context";
7
+ import type { Enode } from "./enode";
8
+ import { RefVector } from "./ref-vector";
9
+ import { VarSubst } from "./var-subst";
10
+ import { setAt, shrink } from "./array";
11
+
12
+ const EAGER_COST_THRESHOLD = 10;
13
+ const LAZY_COST_THRESHOLD = 20;
14
+
15
+ interface Entry {
16
+ quantifier: number;
17
+ bindings: Enode[];
18
+ cost: number;
19
+ generation: number;
20
+ isInstantiated: boolean;
21
+ }
22
+
23
+ // A copy of the array with room for the index, at least twice as long.
24
+ const grow = (array: Int32Array, index: number) => {
25
+ const grown = new Int32Array(Math.max(2 * array.length, index + 1));
26
+ grown.set(array);
27
+ return grown;
28
+ };
29
+
30
+ // smt::checker: evaluates a quantifier body under bindings with the E-graph and the assignment.
31
+ class Checker {
32
+ private bindings: Enode[] = [];
33
+ // The caches of a run, by expression, which hold an entry for the run whose stamp it has. So a run
34
+ // starts with them empty without clearing them.
35
+ private stamp = 0;
36
+ private checkStamps = new Int32Array(1024);
37
+ private checkResults = new Int32Array(1024);
38
+ private enodeStamps = new Int32Array(1024);
39
+ private enodeResults: (Enode | null | undefined)[] = [];
40
+ // The ptr_buffer of each level of get_enode_eq_to_core, which Z3 keeps on the stack.
41
+ private argBuffers: Enode[][] = [];
42
+ private argDepth = 0;
43
+
44
+ constructor(private context: Context) {}
45
+
46
+ isSat(body: number, bindings: Enode[]) {
47
+ return this.run(body, bindings, true);
48
+ }
49
+
50
+ isUnsat(body: number, bindings: Enode[]) {
51
+ return this.run(body, bindings, false);
52
+ }
53
+
54
+ private run(body: number, bindings: Enode[], isTrue: boolean) {
55
+ this.bindings = bindings;
56
+ this.stamp++;
57
+ return this.check(body, 0, isTrue);
58
+ }
59
+
60
+ private check(expr: number, depth: number, isTrue: boolean): boolean {
61
+ const key = expr * 2 + (isTrue ? 1 : 0);
62
+ if (key >= this.checkStamps.length) {
63
+ this.checkStamps = grow(this.checkStamps, key);
64
+ this.checkResults = grow(this.checkResults, key);
65
+ }
66
+ if (this.checkStamps[key] === this.stamp) return this.checkResults[key] === 1;
67
+ const result = this.checkCore(expr, depth, isTrue);
68
+ this.checkStamps[key] = this.stamp;
69
+ this.checkResults[key] = result ? 1 : 0;
70
+ return result;
71
+ }
72
+
73
+ private isAssigned(expr: number, isTrue: boolean) {
74
+ const context = this.context;
75
+ const value = context.isBInternalized(expr)
76
+ ? context.getBoolVarAssignment(context.getBoolVar(expr))
77
+ : 0;
78
+ return value !== 0 && isTrue === value > 0;
79
+ }
80
+
81
+ private checkAny(expr: number, depth: number, isTrue: boolean) {
82
+ const manager = this.context.manager;
83
+ const numArgs = manager.getNumArgs(expr);
84
+ for (let index = 0; index < numArgs; index++)
85
+ if (this.check(manager.getArg(expr, index), depth, isTrue)) return true;
86
+ return false;
87
+ }
88
+
89
+ private checkAll(expr: number, depth: number, isTrue: boolean) {
90
+ const manager = this.context.manager;
91
+ const numArgs = manager.getNumArgs(expr);
92
+ for (let index = 0; index < numArgs; index++)
93
+ if (!this.check(manager.getArg(expr, index), depth, isTrue)) return false;
94
+ return true;
95
+ }
96
+
97
+ private checkCore(expr: number, depth: number, isTrue: boolean): boolean {
98
+ if (depth > 600) return false;
99
+ const context = this.context;
100
+ const manager = context.manager;
101
+ if (context.isBInternalized(expr) && context.isRelevant(expr))
102
+ return this.isAssigned(expr, isTrue);
103
+ if (manager.kinds[expr] !== KIND_APP) return false;
104
+ const next = depth + 1;
105
+ switch (manager.getOp(expr)) {
106
+ case OP_TRUE:
107
+ return isTrue;
108
+ case OP_FALSE:
109
+ return !isTrue;
110
+ case OP_NOT:
111
+ return this.check(manager.getArg(expr, 0), next, !isTrue);
112
+ case OP_OR:
113
+ return isTrue ? this.checkAny(expr, next, true) : this.checkAll(expr, next, false);
114
+ case OP_AND:
115
+ return isTrue ? this.checkAll(expr, next, true) : this.checkAny(expr, next, false);
116
+ case OP_EQ: {
117
+ if (!manager.isBool(manager.getArg(expr, 0))) {
118
+ const lhs = this.getEnodeEqTo(manager.getArg(expr, 0));
119
+ const rhs = this.getEnodeEqTo(manager.getArg(expr, 1));
120
+ if (
121
+ lhs === null ||
122
+ rhs === null ||
123
+ !context.isRelevant(lhs.owner) ||
124
+ !context.isRelevant(rhs.owner)
125
+ )
126
+ return false;
127
+ return isTrue ? lhs.root === rhs.root : context.isDiseq(lhs, rhs);
128
+ }
129
+ return (
130
+ (this.check(manager.getArg(expr, 0), next, true) &&
131
+ this.check(manager.getArg(expr, 1), next, isTrue)) ||
132
+ (this.check(manager.getArg(expr, 0), next, false) &&
133
+ this.check(manager.getArg(expr, 1), next, !isTrue))
134
+ );
135
+ }
136
+ case OP_ITE: {
137
+ const condition = manager.getArg(expr, 0);
138
+ const atom = manager.isNot(condition) ? manager.getArg(condition, 0) : condition;
139
+ if (
140
+ condition !== manager.falseExpr &&
141
+ (!context.isBInternalized(atom) || !context.isRelevant(condition))
142
+ )
143
+ return (
144
+ this.check(manager.getArg(expr, 1), next, isTrue) &&
145
+ this.check(manager.getArg(expr, 2), next, isTrue)
146
+ );
147
+ const value = context.getAssignment(context.getLiteral(condition));
148
+ if (value === 0) return false;
149
+ return this.check(
150
+ value > 0 ? manager.getArg(expr, 1) : manager.getArg(expr, 2),
151
+ next,
152
+ isTrue,
153
+ );
154
+ }
155
+ default:
156
+ break;
157
+ }
158
+ const node = this.getEnodeEqTo(expr);
159
+ if (node === null || !manager.isBool(node.owner) || !context.isRelevant(node.owner))
160
+ return false;
161
+ return this.isAssigned(node.owner, isTrue);
162
+ }
163
+
164
+ // get_enode_eq_to: the relevant term of the E-graph that the expression equals by congruence.
165
+ private getEnodeEqTo(expr: number): Enode | null {
166
+ const context = this.context;
167
+ const manager = context.manager;
168
+ if (manager.kinds[expr] === KIND_VAR) {
169
+ const index = manager.values[expr];
170
+ return index < this.bindings.length ? this.bindings[this.bindings.length - index - 1] : null;
171
+ }
172
+ const existing = context.getEnode(expr);
173
+ if (existing !== undefined && context.isRelevant(expr)) return existing;
174
+ if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0) return null;
175
+ if (expr >= this.enodeStamps.length) this.enodeStamps = grow(this.enodeStamps, expr);
176
+ if (this.enodeStamps[expr] === this.stamp) return this.enodeResults[expr] ?? null;
177
+ const depth = this.argDepth;
178
+ if (depth === this.argBuffers.length) this.argBuffers.push([]);
179
+ const argNodes = this.argBuffers[depth];
180
+ shrink(argNodes, 0);
181
+ this.argDepth = depth + 1;
182
+ for (let index = 0; index < manager.getNumArgs(expr); index++) {
183
+ const arg = manager.getArg(expr, index);
184
+ const node = this.getEnodeEqTo(arg);
185
+ if (node === null) {
186
+ this.argDepth = depth;
187
+ this.enodeStamps[expr] = this.stamp;
188
+ setAt(this.enodeResults, expr, null);
189
+ return null;
190
+ }
191
+ argNodes.push(node);
192
+ }
193
+ this.argDepth = depth;
194
+ const found = context.findCongruent(manager.decls[expr], argNodes);
195
+ const result = found !== undefined && context.isRelevant(found.owner) ? found : null;
196
+ this.enodeStamps[expr] = this.stamp;
197
+ setAt(this.enodeResults, expr, result);
198
+ return result;
199
+ }
200
+ }
201
+
202
+ export class QiQueue {
203
+ private newEntries: Entry[] = [];
204
+ private delayedEntries: Entry[] = [];
205
+ private instantiatedTrail: number[] = [];
206
+ private scopes: number[] = [];
207
+ private checker: Checker;
208
+ // cached_var_subst: each instance by its quantifier and bindings, which the queue holds with them
209
+ // until the next search. instanceRefs lists the quantifier, the bindings and the instance of each.
210
+ // instanceStarts holds where each instance starts there, and instanceNext the earlier instance of
211
+ // the same hash, or -1. instances maps a hash of the key to its last instance.
212
+ private subst: VarSubst;
213
+ private instances = new Map<number, number>();
214
+ private instanceRefs: number[] = [];
215
+ private instanceStarts: number[] = [];
216
+ private instanceNext: number[] = [];
217
+ private bindingOwners: number[] = [];
218
+ // m_instances: the lemmas, which the queue holds until their scope is popped.
219
+ private lemmas: RefVector;
220
+ numInstances = 0;
221
+
222
+ constructor(private context: Context) {
223
+ this.checker = new Checker(context);
224
+ this.subst = new VarSubst(context.manager, true);
225
+ this.lemmas = new RefVector(context.manager);
226
+ }
227
+
228
+ private getInstance(quantifier: number, bindings: number[]) {
229
+ const manager = this.context.manager;
230
+ const refs = this.instanceRefs;
231
+ let hash = quantifier;
232
+ for (const binding of bindings) hash = (Math.imul(hash, 0x9e3779b1) + binding) | 0;
233
+ const last = this.instances.get(hash) ?? -1;
234
+ for (let entry = last; entry !== -1; entry = this.instanceNext[entry]) {
235
+ const start = this.instanceStarts[entry];
236
+ let isSame = refs[start] === quantifier;
237
+ for (let index = 0; index < bindings.length && isSame; index++)
238
+ isSame = refs[start + 1 + index] === bindings[index];
239
+ if (isSame) return refs[start + 1 + bindings.length];
240
+ }
241
+ const instance = this.subst.apply(manager.getQuantifier(quantifier).body, bindings);
242
+ this.instances.set(hash, this.instanceStarts.length);
243
+ this.instanceStarts.push(refs.length);
244
+ this.instanceNext.push(last);
245
+ manager.incRef(quantifier);
246
+ refs.push(quantifier);
247
+ for (const binding of bindings) {
248
+ manager.incRef(binding);
249
+ refs.push(binding);
250
+ }
251
+ refs.push(instance);
252
+ return instance;
253
+ }
254
+
255
+ hasWork() {
256
+ return this.newEntries.length > 0;
257
+ }
258
+
259
+ insert(quantifier: number, bindings: Enode[], generation: number) {
260
+ const weight = this.context.manager.getQuantifier(quantifier).weight;
261
+ this.newEntries.push({
262
+ quantifier,
263
+ bindings,
264
+ cost: weight + generation,
265
+ generation,
266
+ isInstantiated: false,
267
+ });
268
+ }
269
+
270
+ instantiate() {
271
+ const entries = this.newEntries;
272
+ this.newEntries = [];
273
+ let sinceLastCheck = 0;
274
+ for (const entry of entries) {
275
+ if (entry.cost <= EAGER_COST_THRESHOLD) this.instantiateEntry(entry);
276
+ else if (
277
+ this.checker.isUnsat(
278
+ this.context.manager.getQuantifier(entry.quantifier).body,
279
+ entry.bindings,
280
+ )
281
+ )
282
+ this.instantiateEntry(entry);
283
+ else this.delayedEntries.push(entry);
284
+ if (sinceLastCheck++ > 100) {
285
+ if (this.context.checkCanceled()) break;
286
+ sinceLastCheck = 0;
287
+ }
288
+ }
289
+ }
290
+
291
+ private instantiateEntry(entry: Entry) {
292
+ const context = this.context;
293
+ if (context.isInconsistent()) return;
294
+ entry.isInstantiated = true;
295
+ const manager = context.manager;
296
+ const data = manager.getQuantifier(entry.quantifier);
297
+ if (this.checker.isSat(data.body, entry.bindings)) return;
298
+ // The bindings' expressions, which Z3 writes into the buffer that m_subst returns.
299
+ const owners = this.bindingOwners;
300
+ shrink(owners, 0);
301
+ for (const binding of entry.bindings) owners.push(binding.owner);
302
+ const substituted = this.getInstance(entry.quantifier, owners);
303
+ manager.incRef(substituted);
304
+ const instance = context.rewriter.rewrite(substituted);
305
+ if (instance !== manager.trueExpr) {
306
+ const negated = manager.mkNot(entry.quantifier);
307
+ const disjuncts = [negated];
308
+ if (manager.getOp(instance) === OP_OR) manager.pushArgs(instance, disjuncts);
309
+ else if (instance !== manager.falseExpr) disjuncts.push(instance);
310
+ const lemma = manager.mkOr(disjuncts);
311
+ this.lemmas.push(lemma);
312
+ this.numInstances++;
313
+ const newGeneration =
314
+ data.weight > 0 || entry.cost > 0
315
+ ? Math.trunc(entry.cost)
316
+ : Math.max(entry.generation + 1, Math.trunc(entry.cost));
317
+ context.internalizeAssertion(lemma, newGeneration);
318
+ }
319
+ manager.decRef(instance);
320
+ manager.decRef(substituted);
321
+ }
322
+
323
+ finalCheckEh() {
324
+ let result = true;
325
+ for (let index = 0; index < this.delayedEntries.length; index++) {
326
+ const entry = this.delayedEntries[index];
327
+ if (entry.isInstantiated || entry.cost > LAZY_COST_THRESHOLD) continue;
328
+ result = false;
329
+ this.instantiatedTrail.push(index);
330
+ this.instantiateEntry(entry);
331
+ if (this.context.checkCanceled()) break;
332
+ }
333
+ return result;
334
+ }
335
+
336
+ push() {
337
+ this.scopes.push(this.delayedEntries.length, this.instantiatedTrail.length, this.lemmas.size);
338
+ }
339
+
340
+ pop(numScopes: number) {
341
+ const offset = this.scopes.length - numScopes * 3;
342
+ const delayedLimit = this.scopes[offset];
343
+ const trailLimit = this.scopes[offset + 1];
344
+ for (let index = trailLimit; index < this.instantiatedTrail.length; index++)
345
+ this.delayedEntries[this.instantiatedTrail[index]].isInstantiated = false;
346
+ shrink(this.instantiatedTrail, trailLimit);
347
+ shrink(this.delayedEntries, delayedLimit);
348
+ this.lemmas.shrink(this.scopes[offset + 2]);
349
+ this.newEntries = [];
350
+ shrink(this.scopes, offset);
351
+ }
352
+
353
+ initSearchEh() {
354
+ const manager = this.context.manager;
355
+ for (const expr of this.instanceRefs) manager.decRef(expr);
356
+ this.instanceRefs = [];
357
+ this.instanceStarts = [];
358
+ this.instanceNext = [];
359
+ this.instances.clear();
360
+ this.newEntries = [];
361
+ }
362
+ }
@@ -0,0 +1,117 @@
1
+ // Ported from Z3 (src/tactic/smtlogics/quant_tactics.cpp, src/tactic/core/simplify_tactic.cpp), MIT
2
+ // license, see z3-license.txt. With (set-logic UFNIA), Z3's strategic solver runs the ufnia tactic:
3
+ // a preprocessor, then qe-lite, then the SMT kernel. Of the preprocessor, elim-uncnstr's
4
+ // elimination and the simplifier's local_ctx option are not ported, as they change almost none of
5
+ // tlapm's obligations.
6
+ import { type AstManager, KIND_APP, KIND_QUANTIFIER } from "./ast";
7
+ import { ctxSimplify } from "./ctx-simplify";
8
+ import { Goal } from "./goal";
9
+ import { propagateValues } from "./propagate-values";
10
+ import { applyQeLite } from "./qe-lite";
11
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
12
+ import { RewriterTpl } from "./rewriter-tpl";
13
+
14
+ // The simplify tactic, with pull_cheap_ite where the preprocessor sets it.
15
+ const simplify = (manager: AstManager, goal: Goal, isPullingCheapIte = false) => {
16
+ if (goal.isInconsistent) return;
17
+ const rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isPullingCheapIte });
18
+ const size = goal.forms.size;
19
+ let rewritten = -1;
20
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
21
+ const result = rewriter.rewrite(goal.forms.items[index]);
22
+ if (rewritten !== -1) manager.decRef(rewritten);
23
+ rewritten = result;
24
+ goal.update(index, rewritten);
25
+ }
26
+ if (rewritten !== -1) manager.decRef(rewritten);
27
+ goal.elimRedundancies();
28
+ rewriter.release();
29
+ };
30
+
31
+ // collect_occs: whether an uninterpreted constant occurs only once, where a term is visited once and
32
+ // a quantifier's patterns are not visited.
33
+ const hasUnconstrainedConst = (manager: AstManager, goal: Goal) => {
34
+ const visited = new Set<number>();
35
+ const consts: number[] = [];
36
+ const repeated = new Set<number>();
37
+ const todo = [...goal.forms.items];
38
+ while (todo.length > 0) {
39
+ const expr = todo.pop() as number;
40
+ const isConst = manager.isUninterpretedConst(expr);
41
+ if (visited.has(expr)) {
42
+ if (isConst) repeated.add(expr);
43
+ continue;
44
+ }
45
+ visited.add(expr);
46
+ if (isConst) consts.push(expr);
47
+ else if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
48
+ else if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
49
+ }
50
+ return consts.some((expr) => !repeated.has(expr));
51
+ };
52
+
53
+ // elim_uncnstr_tactic::run without the elimination. Its rewriter still runs over the formulas when
54
+ // some constant is unconstrained, and counts its steps. The rewriter starts as if the formulas had
55
+ // changed, so it makes a second round.
56
+ const elimUncnstr = (manager: AstManager, goal: Goal) => {
57
+ const isRewriting = hasUnconstrainedConst(manager, goal);
58
+ pinQuantifierBodies(manager, goal);
59
+ if (!isRewriting) return;
60
+ const rewriter = new RewriterTpl(manager);
61
+ for (let round = 0; round < 2; round++) {
62
+ for (const form of goal.forms.items) manager.decRef(rewriter.rewrite(form));
63
+ rewriter.reset();
64
+ }
65
+ rewriter.release();
66
+ };
67
+
68
+ // elim_uncnstr_tactic::disable_quantified: the tactic holds the body of each quantifier until it is
69
+ // destroyed after the search.
70
+ const pinQuantifierBodies = (manager: AstManager, goal: Goal) => {
71
+ const visited = new Set<number>();
72
+ const disabled = new Set<number>();
73
+ const disable = (body: number) => {
74
+ if (disabled.has(body)) return;
75
+ manager.incRef(body);
76
+ const todo = [body];
77
+ while (todo.length > 0) {
78
+ const expr = todo.pop() as number;
79
+ if (disabled.has(expr)) continue;
80
+ disabled.add(expr);
81
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
82
+ }
83
+ };
84
+ const todo = [...goal.forms.items];
85
+ while (todo.length > 0) {
86
+ const expr = todo.pop() as number;
87
+ if (visited.has(expr)) continue;
88
+ visited.add(expr);
89
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
90
+ const body = manager.getQuantifier(expr).body;
91
+ disable(body);
92
+ todo.push(body);
93
+ } else if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
94
+ }
95
+ };
96
+
97
+ // mk_ufnia_tactic, up to the SMT kernel: mk_quant_preprocessor without solve-eqs, then qe-lite.
98
+ export const applyUfniaTactic = (manager: AstManager, assertions: number[]) => {
99
+ const goal = new Goal(manager);
100
+ for (const assertion of assertions) goal.assert(assertion);
101
+ simplify(manager, goal);
102
+ // and_then runs the next tactic only on a goal that is not decided: one that is consistent and
103
+ // has formulas left.
104
+ const steps = [
105
+ () => propagateValues(manager, goal),
106
+ () => ctxSimplify(manager, goal),
107
+ () => simplify(manager, goal, true),
108
+ () => elimUncnstr(manager, goal),
109
+ () => simplify(manager, goal),
110
+ () => applyQeLite(manager, goal),
111
+ ];
112
+ for (const step of steps) {
113
+ if (goal.isInconsistent || goal.forms.size === 0) break;
114
+ step();
115
+ }
116
+ return goal;
117
+ };