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,351 @@
1
+ // Ported from Z3 (src/ast/pattern/pattern_inference.cpp), MIT license, see z3-license.txt.
2
+ // Infers E-matching patterns for quantifiers that have none, with Z3's default parameters:
3
+ // pi.max_multi_patterns=0, pi.block_loop_patterns=true, pi.decompose_patterns=true,
4
+ // pi.arith=1 (conservative), pi.avoid_skolems=true.
5
+ import {
6
+ AstManager,
7
+ FAMILY_ARITH,
8
+ FAMILY_BASIC,
9
+ KIND_APP,
10
+ KIND_QUANTIFIER,
11
+ KIND_VAR,
12
+ OP_FALSE,
13
+ OP_IDIV,
14
+ OP_MOD,
15
+ OP_MUL,
16
+ OP_TRUE,
17
+ } from "./ast";
18
+ import { RefVector } from "./ref-vector";
19
+ import { InvVarShifter } from "./rewriter-tpl";
20
+
21
+ interface CandidateInfo {
22
+ freeVars: Set<number>;
23
+ boundVars: Set<number>;
24
+ size: number;
25
+ }
26
+
27
+ interface PrePattern {
28
+ exprs: number[];
29
+ freeVars: Set<number>;
30
+ index: number;
31
+ }
32
+
33
+ const PI_ARITH_WEIGHT = 5;
34
+ const PI_NON_NESTED_ARITH_WEIGHT = 10;
35
+ const MAX_SPLITS = 32;
36
+
37
+ const isSameSet = (left: Set<number>, right: Set<number>) =>
38
+ left.size === right.size && [...left].every((element) => right.has(element));
39
+
40
+ const isSubset = (left: Set<number>, right: Set<number>) =>
41
+ [...left].every((element) => right.has(element));
42
+
43
+ // pattern_inference_cfg, which asserted_formulas keeps as long as it lives. m_candidates holds its
44
+ // candidates until the end of mk_patterns.
45
+ export class PatternInference {
46
+ private candidates: RefVector;
47
+ private candidateInfos = new Map<number, CandidateInfo>();
48
+ private numBindings = 0;
49
+ private isArithForbidden = true;
50
+ private isNestedArithOnly = true;
51
+ private isBlockingLoopPatterns = true;
52
+
53
+ constructor(private manager: AstManager) {
54
+ this.candidates = new RefVector(manager);
55
+ }
56
+
57
+ private isForbidden(expr: number) {
58
+ const manager = this.manager;
59
+ if (manager.isGround(expr)) return false;
60
+ const decl = manager.funcDecls[manager.decls[expr]];
61
+ if (decl.isSkolem) return true;
62
+ if (decl.family === FAMILY_BASIC) return decl.op !== OP_TRUE && decl.op !== OP_FALSE;
63
+ return decl.family === FAMILY_ARITH && this.isArithForbidden;
64
+ }
65
+
66
+ private collect(body: number) {
67
+ const manager = this.manager;
68
+ const cache = new Map<string, CandidateInfo | null>();
69
+ const visit = (expr: number, delta: number): CandidateInfo | null => {
70
+ const key = `${expr}:${delta}`;
71
+ if (cache.has(key)) return cache.get(key) ?? null;
72
+ let info: CandidateInfo | null = null;
73
+ const kind = manager.kinds[expr];
74
+ if (kind === KIND_VAR) {
75
+ const index = manager.values[expr];
76
+ const freeVars = new Set<number>();
77
+ const boundVars = new Set<number>();
78
+ if (delta <= index && index < this.numBindings + delta) freeVars.add(index - delta);
79
+ else if (index < delta) boundVars.add(index);
80
+ info = { freeVars, boundVars, size: 1 };
81
+ } else if (kind === KIND_APP) {
82
+ const childInfos = manager.mapArgs(expr, (innerArg) => visit(innerArg, delta));
83
+ if (this.isForbidden(expr)) info = null;
84
+ else if (manager.getNumArgs(expr) === 0)
85
+ info = { freeVars: new Set(), boundVars: new Set(), size: 1 };
86
+ else if (childInfos.every((childInfo) => childInfo !== null)) {
87
+ const freeVars = new Set<number>();
88
+ const boundVars = new Set<number>();
89
+ let size = 1;
90
+ for (const childInfo of childInfos) {
91
+ if (childInfo === null) continue;
92
+ childInfo.freeVars.forEach((element) => freeVars.add(element));
93
+ childInfo.boundVars.forEach((element) => boundVars.add(element));
94
+ size += childInfo.size;
95
+ }
96
+ info = { freeVars, boundVars, size };
97
+ const decl = manager.funcDecls[manager.decls[expr]];
98
+ const isArithCandidate =
99
+ !this.isNestedArithOnly &&
100
+ (decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_MUL);
101
+ if (
102
+ freeVars.size > 0 &&
103
+ boundVars.size === 0 &&
104
+ (decl.family !== FAMILY_ARITH || isArithCandidate)
105
+ ) {
106
+ const shifter = new InvVarShifter(manager);
107
+ const candidate = manager.withoutTemporaries(() => shifter.shift(expr, delta));
108
+ this.addCandidate(candidate, freeVars, size);
109
+ manager.decRef(candidate);
110
+ shifter.release();
111
+ }
112
+ }
113
+ } else if (kind === KIND_QUANTIFIER) {
114
+ const data = manager.getQuantifier(expr);
115
+ const count = data.sorts.length;
116
+ const bodyInfo = visit(data.body, delta + count);
117
+ if (bodyInfo !== null) {
118
+ const boundVars = new Set<number>();
119
+ bodyInfo.boundVars.forEach((element) => {
120
+ if (element >= count) boundVars.add(element - count);
121
+ });
122
+ info = { freeVars: bodyInfo.freeVars, boundVars, size: bodyInfo.size + 1 };
123
+ }
124
+ }
125
+ cache.set(key, info);
126
+ return info;
127
+ };
128
+ visit(body, 0);
129
+ }
130
+
131
+ private addCandidate(expr: number, freeVars: Set<number>, size: number) {
132
+ if (this.candidateInfos.has(expr)) return;
133
+ this.candidateInfos.set(expr, { freeVars, boundVars: new Set(), size });
134
+ this.candidates.push(expr);
135
+ }
136
+
137
+ // smaller_pattern: whether second is an instance of first.
138
+ private isSmaller(first: number, second: number) {
139
+ const manager = this.manager;
140
+ const bindings = Array.from({ length: this.numBindings }, () => -1);
141
+ const todo: [number, number][] = [[first, second]];
142
+ while (todo.length > 0) {
143
+ const pair = todo.pop();
144
+ if (pair === undefined) break;
145
+ const left = pair[0];
146
+ const right = pair[1];
147
+ const kind = manager.kinds[left];
148
+ if (kind === KIND_APP) {
149
+ if (
150
+ manager.kinds[right] !== KIND_APP ||
151
+ manager.decls[left] !== manager.decls[right] ||
152
+ manager.getNumArgs(left) !== manager.getNumArgs(right) ||
153
+ manager.values[left] !== manager.values[right]
154
+ )
155
+ return false;
156
+ for (let index = 0; index < manager.getNumArgs(left); index++)
157
+ todo.push([manager.getArg(left, index), manager.getArg(right, index)]);
158
+ } else if (kind === KIND_VAR && manager.values[left] < this.numBindings) {
159
+ const index = manager.values[left];
160
+ if (bindings[index] === -1) bindings[index] = right;
161
+ else if (bindings[index] !== right) return false;
162
+ } else if (left !== right) return false;
163
+ }
164
+ return true;
165
+ }
166
+
167
+ private filterLoopingPatterns() {
168
+ const result: number[] = [];
169
+ for (const first of this.candidates.items) {
170
+ const firstInfo = this.candidateInfos.get(first);
171
+ if (firstInfo === undefined) continue;
172
+ const isLooping =
173
+ this.isBlockingLoopPatterns &&
174
+ this.candidates.items.some((second) => {
175
+ if (second === first) return false;
176
+ const secondInfo = this.candidateInfos.get(second);
177
+ return (
178
+ secondInfo !== undefined &&
179
+ isSameSet(firstInfo.freeVars, secondInfo.freeVars) &&
180
+ this.isSmaller(first, second) &&
181
+ !this.isSmaller(second, first)
182
+ );
183
+ });
184
+ if (isLooping) this.candidateInfos.delete(first);
185
+ else result.push(first);
186
+ }
187
+ return result;
188
+ }
189
+
190
+ private containsSubpattern(expr: number) {
191
+ const manager = this.manager;
192
+ const info = this.candidateInfos.get(expr);
193
+ if (info === undefined) return false;
194
+ const visited = new Set<number>([expr]);
195
+ const todo = [expr];
196
+ while (todo.length > 0) {
197
+ const current = todo.pop();
198
+ if (current === undefined) break;
199
+ if (manager.kinds[current] !== KIND_APP) continue;
200
+ if (current !== expr) {
201
+ const currentInfo = this.candidateInfos.get(current);
202
+ if (currentInfo !== undefined && isSameSet(currentInfo.freeVars, info.freeVars))
203
+ return true;
204
+ }
205
+ for (let index = 0; index < manager.getNumArgs(current); index++) {
206
+ const arg = manager.getArg(current, index);
207
+ if (!visited.has(arg)) {
208
+ visited.add(arg);
209
+ todo.push(arg);
210
+ }
211
+ }
212
+ }
213
+ return false;
214
+ }
215
+
216
+ private mkPattern(candidate: number) {
217
+ const manager = this.manager;
218
+ const hasVarArg = (expr: number) =>
219
+ manager.kinds[expr] === KIND_APP &&
220
+ manager.someArg(expr, (innerArg) => manager.isVar(innerArg));
221
+ if (hasVarArg(candidate)) return manager.mkPattern([candidate]);
222
+ const args: number[] = [];
223
+ for (let index = 0; index < manager.getNumArgs(candidate); index++) {
224
+ const arg = manager.getArg(candidate, index);
225
+ if (manager.kinds[arg] !== KIND_APP) return manager.mkPattern([candidate]);
226
+ args.push(arg);
227
+ }
228
+ for (let index = 0; index < args.length; index++) {
229
+ const arg = args[index];
230
+ if (hasVarArg(arg)) continue;
231
+ args[index] = args[args.length - 1];
232
+ index--;
233
+ args.pop();
234
+ if (manager.isGround(arg)) continue;
235
+ for (let argIndex = 0; argIndex < manager.getNumArgs(arg); argIndex++) {
236
+ const innerArg = manager.getArg(arg, argIndex);
237
+ if (manager.kinds[innerArg] !== KIND_APP) return manager.mkPattern([candidate]);
238
+ args.push(innerArg);
239
+ }
240
+ }
241
+ return manager.mkPattern(args);
242
+ }
243
+
244
+ private candidatesToMultiPatterns(maxPatterns: number, candidates: number[], result: number[]) {
245
+ const prePatterns: (PrePattern | null)[] = [{ exprs: [], freeVars: new Set(), index: 0 }];
246
+ let numSplits = 0;
247
+ for (let index = 0; index < prePatterns.length; index++) {
248
+ const current = prePatterns[index];
249
+ if (current === null) continue;
250
+ if (current.freeVars.size === this.numBindings) {
251
+ result.push(this.manager.mkPattern(current.exprs));
252
+ if (result.length >= maxPatterns) return;
253
+ } else if (current.index < candidates.length) {
254
+ const candidate = candidates[current.index];
255
+ const candidateFreeVars = this.candidateInfos.get(candidate)?.freeVars ?? new Set<number>();
256
+ if (!isSubset(candidateFreeVars, current.freeVars)) {
257
+ prePatterns.push({
258
+ exprs: [...current.exprs, candidate],
259
+ freeVars: new Set([...current.freeVars, ...candidateFreeVars]),
260
+ index: current.index + 1,
261
+ });
262
+ if (numSplits < MAX_SPLITS) {
263
+ prePatterns[index] = null;
264
+ current.index++;
265
+ prePatterns.push(current);
266
+ numSplits++;
267
+ }
268
+ } else {
269
+ prePatterns[index] = null;
270
+ current.index++;
271
+ prePatterns.push(current);
272
+ }
273
+ }
274
+ }
275
+ }
276
+
277
+ private mkPatterns(numBindings: number, body: number) {
278
+ this.numBindings = numBindings;
279
+ this.collect(body);
280
+ const result: number[] = [];
281
+ if (this.candidates.size > 0) {
282
+ const looseCandidates = this.filterLoopingPatterns().filter(
283
+ (candidate) => !this.containsSubpattern(candidate),
284
+ );
285
+ // m_tmp1: the candidates that do not cover every variable, which may form a multi-pattern.
286
+ const partialCandidates: number[] = [];
287
+ for (const candidate of looseCandidates) {
288
+ const info = this.candidateInfos.get(candidate);
289
+ if (info !== undefined && info.freeVars.size === numBindings)
290
+ result.push(this.mkPattern(candidate));
291
+ else partialCandidates.push(candidate);
292
+ }
293
+ const numExtraMultiPatterns = result.length === 0 ? 1 : 0;
294
+ if (numExtraMultiPatterns > 0 && partialCandidates.length > 0) {
295
+ // std::stable_sort with m_pattern_weight_lt.
296
+ const weightOf = (candidate: number) => this.candidateInfos.get(candidate);
297
+ const sorted = partialCandidates
298
+ .map((candidate, index) => ({ candidate, index }))
299
+ .sort((left, right) => {
300
+ const leftInfo = weightOf(left.candidate);
301
+ const rightInfo = weightOf(right.candidate);
302
+ if (leftInfo === undefined || rightInfo === undefined) return left.index - right.index;
303
+ if (leftInfo.freeVars.size !== rightInfo.freeVars.size)
304
+ return rightInfo.freeVars.size - leftInfo.freeVars.size;
305
+ if (leftInfo.size !== rightInfo.size) return leftInfo.size - rightInfo.size;
306
+ return left.index - right.index;
307
+ })
308
+ .map((entry) => entry.candidate);
309
+ this.candidatesToMultiPatterns(numExtraMultiPatterns, sorted, result);
310
+ }
311
+ }
312
+ this.candidateInfos = new Map();
313
+ this.candidates.reset();
314
+ return result;
315
+ }
316
+
317
+ // reduce_quantifier for a quantifier without patterns: arithmetic, then looping and non-nested
318
+ // arithmetic patterns, are allowed when no pattern is found without them.
319
+ infer(numBindings: number, body: number, weight: number): InferredPatterns {
320
+ this.isArithForbidden = true;
321
+ this.isNestedArithOnly = true;
322
+ this.isBlockingLoopPatterns = true;
323
+ const patterns = this.mkPatterns(numBindings, body);
324
+ if (patterns.length > 0) return { patterns, weight };
325
+ this.isArithForbidden = false;
326
+ this.isBlockingLoopPatterns = false;
327
+ const arithPatterns = this.mkPatterns(numBindings, body);
328
+ if (arithPatterns.length > 0)
329
+ return { patterns: arithPatterns, weight: Math.max(weight, PI_ARITH_WEIGHT) };
330
+ this.isNestedArithOnly = false;
331
+ const nonNestedPatterns = this.mkPatterns(numBindings, body);
332
+ return {
333
+ patterns: nonNestedPatterns,
334
+ weight: nonNestedPatterns.length > 0 ? Math.max(weight, PI_NON_NESTED_ARITH_WEIGHT) : weight,
335
+ };
336
+ }
337
+
338
+ // The patterns of a quantifier that pull_quant changed, found once with the settings that infer
339
+ // restores: arithmetic is allowed, but only nested, and looping patterns are blocked.
340
+ inferPulled(numBindings: number, body: number) {
341
+ this.isArithForbidden = false;
342
+ this.isNestedArithOnly = true;
343
+ this.isBlockingLoopPatterns = true;
344
+ return this.mkPatterns(numBindings, body);
345
+ }
346
+ }
347
+
348
+ interface InferredPatterns {
349
+ patterns: number[];
350
+ weight: number;
351
+ }