tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,7 +1,3 @@
1
- // Ported from Z3 (src/model/model_macro_solver.cpp, src/ast/macros/macro_util.cpp,
2
- // src/ast/func_decl_dependencies.cpp), MIT license, see z3-license.txt. Collects the conditional
3
- // macros of a quantifier, f(x) = def when cond, and satisfies quantifiers by taking such a def as the
4
- // else case of the interpretation of f.
5
1
  import {
6
2
  FAMILY_BASIC,
7
3
  FAMILY_USER,
@@ -18,18 +14,17 @@ import {
18
14
  OP_OR,
19
15
  SORT_BOOL,
20
16
  type AstManager,
17
+ QUANTIFIER_FORALL,
21
18
  } from "./ast";
22
19
  import { FuncInterp, type ProtoModel } from "./proto-model";
23
20
  import { Rational } from "./rational";
24
21
  import type { Rewriter } from "./rewriter";
25
22
  import { replaceFreeVars } from "./var-subst";
26
23
 
27
- // cond_macro: f(x_0, ..., x_n) = def whenever cond holds. A hint has no condition.
28
24
  export interface CondMacro {
29
25
  decl: number;
30
26
  def: number;
31
27
  cond: number | null;
32
- isIneq: boolean;
33
28
  isSatisfyAtom: boolean;
34
29
  isHint: boolean;
35
30
  weight: number;
@@ -67,7 +62,7 @@ const isLiteral = (manager: AstManager, expr: number) =>
67
62
  const getPolyArgs = (manager: AstManager, expr: number) =>
68
63
  manager.getOp(expr) === OP_ADD ? manager.getArgs(expr) : [expr];
69
64
 
70
- const isMacroHead = (manager: AstManager, expr: number, numDecls: number) => {
65
+ export const isMacroHead = (manager: AstManager, expr: number, numDecls: number) => {
71
66
  if (!isUserApp(manager, expr) || manager.getNumArgs(expr) !== numDecls) return false;
72
67
  const seen = new Set<number>();
73
68
  for (let argIndex = 0; argIndex < manager.getNumArgs(expr); argIndex++) {
@@ -94,6 +89,20 @@ const isQuasiMacroHead = (manager: AstManager, expr: number, numDecls: number) =
94
89
  return found.size === numDecls;
95
90
  };
96
91
 
92
+ export const normalizeMacroDef = (manager: AstManager, head: number, expr: number) => {
93
+ const mapping = new Map<number, number>();
94
+ for (let index = 0; index < manager.getNumArgs(head); index++)
95
+ mapping.set(manager.values[manager.getArg(head, index)], index);
96
+ return [...mapping].every((entry) => entry[0] === entry[1])
97
+ ? expr
98
+ : replaceFreeVars(manager, expr, (variable, index, shift) => {
99
+ const target = mapping.get(index);
100
+ return target === undefined
101
+ ? variable
102
+ : manager.mkVar(target + shift, manager.sorts[variable]);
103
+ });
104
+ };
105
+
97
106
  const getHintHeadVars = (manager: AstManager, expr: number) => {
98
107
  const vars: number[] = [];
99
108
  if (!isUserApp(manager, expr)) return vars;
@@ -107,7 +116,7 @@ const getHintHeadVars = (manager: AstManager, expr: number) => {
107
116
  const isVarsOfSubset = (manager: AstManager, expr: number, vars: number[]) => {
108
117
  const visited = new Set<number>();
109
118
  const visit = (current: number): boolean => {
110
- if (manager.isGround(current) || visited.has(current)) return true;
119
+ if (manager.isGroundApp(current) || visited.has(current)) return true;
111
120
  visited.add(current);
112
121
  const kind = manager.kinds[current];
113
122
  if (kind === KIND_VAR) return vars.includes(current);
@@ -136,23 +145,22 @@ const isPolyHint = (manager: AstManager, poly: number, head: number, exception:
136
145
  );
137
146
  };
138
147
 
139
- // quantifier_macro_info::collect_macro_candidates, with an empty forbidden set. Each candidate holds
140
- // a reference to its definition and condition, which releaseCondMacros releases. Like macro_util,
141
- // the expressions of each step live until the step returns. The rewriter does macro_util's Boolean
142
- // and arithmetic rewriting, which keeps nothing between calls.
143
148
  export const collectMacroCandidates = (
144
149
  manager: AstManager,
145
150
  rewriter: Rewriter,
146
151
  quantifier: number,
147
152
  ) => {
148
153
  const data = manager.getQuantifier(quantifier);
149
- // qa: an existential quantifier becomes a universal one of the negated body until the candidates
150
- // are collected.
151
- const qa = data.isForall
152
- ? quantifier
153
- : manager.withTemporaries(() =>
154
- manager.mkQuantifier({ ...data, isForall: true, body: manager.mkNot(data.body) }),
155
- );
154
+ const qa =
155
+ data.kind === QUANTIFIER_FORALL
156
+ ? quantifier
157
+ : manager.withTemporaries(() =>
158
+ manager.mkQuantifier({
159
+ ...data,
160
+ kind: QUANTIFIER_FORALL,
161
+ body: manager.mkNot(data.body),
162
+ }),
163
+ );
156
164
  const candidates = manager.hasQuantifierFlags[manager.getQuantifier(qa).body]
157
165
  ? []
158
166
  : collectCandidates(manager, rewriter, qa);
@@ -160,7 +168,6 @@ export const collectMacroCandidates = (
160
168
  return candidates;
161
169
  };
162
170
 
163
- // ~cond_macro, for each candidate in order.
164
171
  export const releaseCondMacros = (manager: AstManager, candidates: CondMacro[]) => {
165
172
  for (const candidate of candidates) {
166
173
  if (candidate.cond !== null) manager.decRef(candidate.cond);
@@ -168,12 +175,10 @@ export const releaseCondMacros = (manager: AstManager, candidates: CondMacro[])
168
175
  }
169
176
  };
170
177
 
171
- // macro_util::collect_macro_candidates.
172
178
  const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier: number) => {
173
179
  const data = manager.getQuantifier(quantifier);
174
180
  const body = data.body;
175
181
  const candidates: CondMacro[] = [];
176
- // The expressions of a step without a reference live until the step returns.
177
182
  const scope = (step: () => void) => manager.withTemporaries(step, () => []);
178
183
  const mkNot = (expr: number) => rewriter.mkAppCore(OP_NOT, [expr], SORT_BOOL);
179
184
  const mkAnd = (args: number[]) =>
@@ -182,7 +187,6 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
182
187
  : args.length === 1
183
188
  ? args[0]
184
189
  : rewriter.mkAppCore(OP_AND, args, SORT_BOOL);
185
- const mkSub = (first: number, second: number) => rewriter.mkSub(first, second);
186
190
  const mkAdd = (args: number[], sort: number) =>
187
191
  args.length === 0
188
192
  ? manager.mkNumeralOfSort(Rational.zero, sort)
@@ -198,7 +202,6 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
198
202
  clause !== null &&
199
203
  clause.some((literal) => literal !== exceptLiteral && manager.isOccurring(decl, literal));
200
204
 
201
- // get_rest_clause_as_cond: the condition comes with a reference, which the caller releases.
202
205
  const getRestClauseAsCond = (exceptLiteral: number) =>
203
206
  clause === null
204
207
  ? null
@@ -212,69 +215,40 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
212
215
  (cond) => (cond === null ? [] : [cond]),
213
216
  );
214
217
 
215
- // A step with the rest of the clause as its condition, which it holds until it returns.
216
218
  const withRestClauseAsCond = (exceptLiteral: number, step: (cond: number | null) => void) => {
217
219
  const cond = getRestClauseAsCond(exceptLiteral);
218
220
  step(cond);
219
221
  if (cond !== null) manager.decRef(cond);
220
222
  };
221
223
 
222
- // normalize_expr: the variables of the head become (:var 0) ... (:var n-1) in order.
223
- const normalize = (head: number, expr: number) => {
224
- const mapping = new Map<number, number>();
225
- for (let index = 0; index < manager.getNumArgs(head); index++)
226
- mapping.set(manager.values[manager.getArg(head, index)], index);
227
- return [...mapping].every((entry) => entry[0] === entry[1])
228
- ? expr
229
- : replaceFreeVars(manager, expr, (variable, index, shift) => {
230
- const target = mapping.get(index);
231
- return target === undefined
232
- ? variable
233
- : manager.mkVar(target + shift, manager.sorts[variable]);
234
- });
235
- };
236
-
237
- // insert_macro: the candidate holds references to the normalized definition and condition.
238
- const insertMacro = (
239
- head: number,
240
- def: number,
241
- cond: number | null,
242
- isIneq: boolean,
243
- isHint: boolean,
244
- ) =>
224
+ const insertMacro = (head: number, def: number, cond: number | null, isHint: boolean) =>
245
225
  scope(() => {
246
- const normDef = normalize(head, def);
247
- const normCond = cond !== null ? normalize(head, cond) : isHint ? null : manager.trueExpr;
226
+ const normDef = normalizeMacroDef(manager, head, def);
227
+ const normCond =
228
+ cond !== null ? normalizeMacroDef(manager, head, cond) : isHint ? null : manager.trueExpr;
248
229
  manager.incRef(normDef);
249
230
  if (normCond !== null) manager.incRef(normCond);
250
231
  candidates.push({
251
232
  decl: manager.decls[head],
252
233
  def: normDef,
253
234
  cond: normCond,
254
- isIneq,
255
235
  isSatisfyAtom: true,
256
236
  isHint,
257
237
  weight: data.weight,
258
238
  });
259
239
  });
260
240
 
261
- // insert_quasi_macro: a head whose arguments are not distinct variables gets fresh variables,
262
- // and for a macro the equalities between them and the arguments join the condition. new_head,
263
- // extra_cond and new_cond hold references until it returns, and are released in the reverse
264
- // order of their declarations.
265
241
  const insertQuasiMacro = (
266
242
  head: number,
267
243
  numDecls: number,
268
244
  def: number,
269
245
  cond: number | null,
270
- isIneq: boolean,
271
246
  isHint: boolean,
272
247
  ) => {
273
248
  if (isMacroHead(manager, head, manager.getNumArgs(head))) {
274
- insertMacro(head, def, cond, isIneq, isHint);
249
+ insertMacro(head, def, cond, isHint);
275
250
  return;
276
251
  }
277
- // quasi_macro_head_to_macro_head and hint_to_macro_head: the condition comes before the head.
278
252
  const converted = manager.withTemporaries(
279
253
  () => {
280
254
  const seen = new Set<number>();
@@ -310,19 +284,13 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
310
284
  ? extraCond
311
285
  : manager.withTemporaries(() => mkAnd([cond, extraCond]));
312
286
  if (newCond === extraCond && extraCond !== null) manager.incRef(extraCond);
313
- insertMacro(converted.newHead, def, newCond, isIneq, isHint);
287
+ insertMacro(converted.newHead, def, newCond, isHint);
314
288
  if (newCond !== null) manager.decRef(newCond);
315
289
  if (extraCond !== null) manager.decRef(extraCond);
316
290
  manager.decRef(converted.newHead);
317
291
  };
318
292
 
319
- const collectArith = (
320
- lhs: number,
321
- rhs: number,
322
- atom: number,
323
- numDecls: number,
324
- isIneq: boolean,
325
- ) => {
293
+ const collectArith = (lhs: number, rhs: number, atom: number, numDecls: number) => {
326
294
  if (manager.getOp(lhs) !== OP_ADD && manager.getOp(atom) === OP_EQ) return;
327
295
  const lhsArgs = getPolyArgs(manager, lhs);
328
296
  const tryHead = (head: number, monomial: number, isNegated: boolean) => {
@@ -339,15 +307,11 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
339
307
  lhsArgs.filter((arg) => arg !== monomial),
340
308
  manager.sorts[lhs],
341
309
  );
342
- const def = isNegated ? mkSub(rest, rhs) : mkSub(rhs, rest);
343
- // A hint's right-hand side may contain variables that are not arguments of the head.
310
+ const def = isNegated ? rewriter.mkSub(rest, rhs) : rewriter.mkSub(rhs, rest);
344
311
  if (isHint && !isPolyHint(manager, def, head, null)) return;
345
- // add_arith_macro_candidate.
346
- if (isHint) insertQuasiMacro(head, numDecls, def, null, isIneq, true);
312
+ if (isHint) insertQuasiMacro(head, numDecls, def, null, true);
347
313
  else
348
- withRestClauseAsCond(atom, (cond) =>
349
- insertQuasiMacro(head, numDecls, def, cond, isIneq, false),
350
- );
314
+ withRestClauseAsCond(atom, (cond) => insertQuasiMacro(head, numDecls, def, cond, false));
351
315
  });
352
316
  return true;
353
317
  };
@@ -367,13 +331,11 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
367
331
  isRestContainingDecl(manager.decls[lhs], atom)
368
332
  )
369
333
  return false;
370
- withRestClauseAsCond(atom, (cond) =>
371
- insertQuasiMacro(lhs, numDecls, rhs, cond, false, false),
372
- );
334
+ withRestClauseAsCond(atom, (cond) => insertQuasiMacro(lhs, numDecls, rhs, cond, false));
373
335
  return true;
374
336
  };
375
337
  const insertHint = (lhs: number, rhs: number) => {
376
- if (isHintAtom(manager, lhs, rhs)) insertQuasiMacro(lhs, numDecls, rhs, null, false, true);
338
+ if (isHintAtom(manager, lhs, rhs)) insertQuasiMacro(lhs, numDecls, rhs, null, true);
377
339
  };
378
340
  const op = manager.getOp(atom);
379
341
  if (op === OP_EQ) {
@@ -397,8 +359,8 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
397
359
  if (op === OP_EQ || op === OP_LE || op === OP_GE) {
398
360
  const lhs = manager.getArg(atom, 0);
399
361
  const rhs = manager.getArg(atom, 1);
400
- collectArith(lhs, rhs, atom, numDecls, op !== OP_EQ);
401
- collectArith(rhs, lhs, atom, numDecls, op !== OP_EQ);
362
+ collectArith(lhs, rhs, atom, numDecls);
363
+ collectArith(rhs, lhs, atom, numDecls);
402
364
  }
403
365
  };
404
366
 
@@ -406,7 +368,12 @@ const collectCandidates = (manager: AstManager, rewriter: Rewriter, quantifier:
406
368
  return candidates;
407
369
  };
408
370
 
409
- const setElseInterp = (manager: AstManager, model: ProtoModel, decl: number, elseExpr: number) => {
371
+ export const setElseInterp = (
372
+ manager: AstManager,
373
+ model: ProtoModel,
374
+ decl: number,
375
+ elseExpr: number,
376
+ ) => {
410
377
  let interp = model.funcInterps.get(decl);
411
378
  if (interp === undefined) {
412
379
  interp = new FuncInterp(manager, manager.funcDecls[decl].domain.length);
@@ -417,8 +384,6 @@ const setElseInterp = (manager: AstManager, model: ProtoModel, decl: number, els
417
384
 
418
385
  type Process = (qs: number[], newQs: number[], residue: number[]) => boolean;
419
386
 
420
- // base_macro_solver::operator(): runs the solver until it removes no more quantifiers, and leaves
421
- // in qs the quantifiers of its last round.
422
387
  const runMacroSolver = (qs: number[], residue: number[], process: Process) => {
423
388
  let current = qs;
424
389
  let next: number[] = [];
@@ -429,7 +394,6 @@ const runMacroSolver = (qs: number[], residue: number[], process: Process) => {
429
394
  return next;
430
395
  };
431
396
 
432
- // simple_macro_solver: a macro for f satisfies its quantifier when no other quantifier uses f.
433
397
  const simpleMacroSolver =
434
398
  (manager: AstManager, model: ProtoModel, getInfo: GetInfo): Process =>
435
399
  (qs, newQs) => {
@@ -445,8 +409,6 @@ const simpleMacroSolver =
445
409
  newQs.push(quantifier);
446
410
  continue;
447
411
  }
448
- // The conditions of the macro can be ignored: the partial interpretation of f satisfies the
449
- // ground part, and MBQI adds instances when it does not satisfy the quantifier.
450
412
  info.theOne = macro.decl;
451
413
  setElseInterp(manager, model, macro.decl, macro.def);
452
414
  isRemoved = true;
@@ -456,8 +418,6 @@ const simpleMacroSolver =
456
418
 
457
419
  const GREEDY_MAX_DEPTH = 10;
458
420
 
459
- // hint_macro_solver: searches greedily for a set of hints and macros, one per function symbol,
460
- // that satisfies a set of quantifiers without cyclic definitions.
461
421
  const hintMacroSolver =
462
422
  (manager: AstManager, model: ProtoModel, getInfo: GetInfo): Process =>
463
423
  (qs, newQs) => {
@@ -548,7 +508,6 @@ const hintMacroSolver =
548
508
  const savedSatisfied = [...satisfied];
549
509
  const savedResidue = [...residue];
550
510
  fs.set(decl, entry[0]);
551
- // update_satisfied_residue.
552
511
  let isUseful = false;
553
512
  for (const quantifier of entry[1]) {
554
513
  if (satisfied.has(quantifier)) continue;
@@ -583,7 +542,6 @@ const hintMacroSolver =
583
542
  return false;
584
543
  };
585
544
 
586
- // collect_func_decls with ng_only: the uninterpreted functions applied in non-ground terms.
587
545
  const collectNgFuncDecls = (manager: AstManager, expr: number) => {
588
546
  const decls = new Set<number>();
589
547
  const visited = new Set<number>();
@@ -591,15 +549,12 @@ const collectNgFuncDecls = (manager: AstManager, expr: number) => {
591
549
  if (visited.has(current)) return;
592
550
  visited.add(current);
593
551
  const kind = manager.kinds[current];
594
- if (kind === KIND_VAR) return;
595
- if (kind === KIND_QUANTIFIER) return;
596
- for (let index = 0; index < manager.getNumArgs(current); index++) {
597
- const arg = manager.getArg(current, index);
598
- visit(arg);
599
- }
552
+ if (kind === KIND_VAR || kind === KIND_QUANTIFIER) return;
553
+ for (let index = 0; index < manager.getNumArgs(current); index++)
554
+ visit(manager.getArg(current, index));
600
555
  if (
601
556
  manager.getNumArgs(current) > 0 &&
602
- !manager.isGround(current) &&
557
+ !manager.isGroundApp(current) &&
603
558
  isUserApp(manager, current)
604
559
  )
605
560
  decls.add(manager.decls[current]);
@@ -608,18 +563,11 @@ const collectNgFuncDecls = (manager: AstManager, expr: number) => {
608
563
  return decls;
609
564
  };
610
565
 
611
- // non_auf_macro_solver: satisfies quantifiers outside the AUF fragment with their macros, even when
612
- // other quantifiers use the defined symbol.
613
- const nonAufMacroSolver =
614
- (
615
- manager: AstManager,
616
- model: ProtoModel,
617
- getInfo: GetInfo,
618
- dependencies: Map<number, Set<number>>,
619
- forceTemplate: number,
620
- ): Process =>
621
- (qs, newQs, residue) => {
622
- // func_decl_dependencies::insert: fails when f has a definition or the new one is cyclic.
566
+ const MBQI_FORCE_TEMPLATE = 10;
567
+
568
+ const nonAufMacroSolver = (manager: AstManager, model: ProtoModel, getInfo: GetInfo): Process => {
569
+ const dependencies = new Map<number, Set<number>>();
570
+ return (qs, newQs, residue) => {
623
571
  const addMacro = (decl: number, elseExpr: number) => {
624
572
  if (dependencies.has(decl)) return false;
625
573
  dependencies.set(decl, collectNgFuncDecls(manager, elseExpr));
@@ -643,7 +591,7 @@ const nonAufMacroSolver =
643
591
  const isBetterMacro = (first: CondMacro, second: CondMacro | null) => {
644
592
  if (second === null || !first.isHint) return true;
645
593
  if (!second.isHint) return false;
646
- return manager.isGround(first.def) && !manager.isGround(second.def);
594
+ return manager.isGroundApp(first.def) && !manager.isGroundApp(second.def);
647
595
  };
648
596
  const getMacroFor = (decl: number, quantifier: number) => {
649
597
  let result: CondMacro | null = null;
@@ -659,7 +607,7 @@ const nonAufMacroSolver =
659
607
  const info = getInfo(quantifier);
660
608
  for (const macro of info.condMacros) {
661
609
  if (macro.isHint) continue;
662
- if (isUnconditional(macro) && (!info.isAuf || macro.weight >= forceTemplate)) {
610
+ if (isUnconditional(macro) && (!info.isAuf || macro.weight >= MBQI_FORCE_TEMPLATE)) {
663
611
  fullMacros.set(macro.decl, { macro, quantifier });
664
612
  condMacros.delete(macro.decl);
665
613
  } else if (!fullMacros.has(macro.decl) && !info.isAuf) condMacros.add(macro.decl);
@@ -706,23 +654,21 @@ const nonAufMacroSolver =
706
654
  }
707
655
  return removed.size > 0;
708
656
  };
657
+ };
709
658
 
710
- // The macro part of model_finder::fix_model: returns the quantifiers left for the AUF solver.
711
659
  export const solveMacros = (
712
660
  manager: AstManager,
713
661
  model: ProtoModel,
714
662
  qs: number[],
715
663
  getInfo: GetInfo,
716
- forceTemplate: number,
717
664
  ) => {
718
665
  const residue: number[] = [];
719
666
  const afterSimple = runMacroSolver(qs, residue, simpleMacroSolver(manager, model, getInfo));
720
667
  const afterHint = runMacroSolver(afterSimple, residue, hintMacroSolver(manager, model, getInfo));
721
- const dependencies = new Map<number, Set<number>>();
722
668
  const afterNonAuf = runMacroSolver(
723
669
  afterHint,
724
670
  residue,
725
- nonAufMacroSolver(manager, model, getInfo, dependencies, forceTemplate),
671
+ nonAufMacroSolver(manager, model, getInfo),
726
672
  );
727
673
  return [...afterNonAuf, ...residue];
728
674
  };
@@ -0,0 +1,214 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_BV,
5
+ FAMILY_SEQ,
6
+ FAMILY_USER,
7
+ KIND_APP,
8
+ KIND_QUANTIFIER,
9
+ OP_BSDIV0,
10
+ OP_BSMOD0,
11
+ OP_BSREM0,
12
+ OP_BUDIV0,
13
+ OP_BUREM0,
14
+ OP_DIV0,
15
+ OP_NEG_ROOT,
16
+ OP_U_ACOS,
17
+ OP_U_ASIN,
18
+ OP_IDIV0,
19
+ OP_MOD0,
20
+ OP_POWER0,
21
+ OP_SEQ_NTH_U,
22
+ } from "./ast";
23
+ import { ObjHashtable } from "./hashtable";
24
+ import type { ProtoModel } from "./proto-model";
25
+ import {
26
+ type Format,
27
+ formatExpr,
28
+ formatSort,
29
+ getQuotedName,
30
+ LINE_BREAK,
31
+ mkCompose,
32
+ mkGroup,
33
+ mkIndent,
34
+ mkSeq1,
35
+ mkSeq5,
36
+ mkText,
37
+ type PrintEnvironment,
38
+ renderFormat,
39
+ } from "./smt2-printer";
40
+
41
+ const TAB_SIZE = 2;
42
+
43
+ const CONSIDERED_UNINTERPRETED_OPS = new Map([
44
+ [
45
+ FAMILY_ARITH,
46
+ new Set([OP_NEG_ROOT, OP_U_ASIN, OP_U_ACOS, OP_DIV0, OP_IDIV0, OP_MOD0, OP_POWER0]),
47
+ ],
48
+ [FAMILY_BV, new Set([OP_BSDIV0, OP_BUDIV0, OP_BSREM0, OP_BUREM0, OP_BSMOD0])],
49
+ [FAMILY_SEQ, new Set([OP_SEQ_NTH_U])],
50
+ ]);
51
+
52
+ const isConsideredUninterpreted = (manager: AstManager, decl: number) => {
53
+ const funcDecl = manager.funcDecls[decl];
54
+ return (
55
+ funcDecl.family === FAMILY_USER ||
56
+ (CONSIDERED_UNINTERPRETED_OPS.get(funcDecl.family)?.has(funcDecl.op) ?? false)
57
+ );
58
+ };
59
+
60
+ const collectFuncDecls = (manager: AstManager, expr: number) => {
61
+ const decls = new ObjHashtable((decl) => manager.getDeclHash(decl));
62
+ const visited = new Set<number>();
63
+ const todo = [expr];
64
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
65
+ if (visited.has(current)) continue;
66
+ visited.add(current);
67
+ if (manager.kinds[current] === KIND_QUANTIFIER) {
68
+ todo.push(manager.getQuantifier(current).body);
69
+ continue;
70
+ }
71
+ if (manager.kinds[current] !== KIND_APP || manager.getNumArgs(current) === 0) continue;
72
+ if (manager.funcDecls[manager.decls[current]].family === FAMILY_USER)
73
+ decls.add(manager.decls[current]);
74
+ manager.pushArgs(current, todo);
75
+ }
76
+ return decls;
77
+ };
78
+
79
+ const sortFuncDecls = (manager: AstManager, model: ProtoModel) => {
80
+ const visited = new Set<number>();
81
+ const result: number[] = [];
82
+ for (const decl of model.getFuncDecls()) {
83
+ if (visited.has(decl)) continue;
84
+ visited.add(decl);
85
+ const todo = [decl];
86
+ while (todo.length > 0) {
87
+ const current = todo[todo.length - 1];
88
+ const elseExpr = model.funcInterps.get(current)?.elseExpr ?? null;
89
+ if (elseExpr !== null) {
90
+ let isAllVisited = true;
91
+ for (const dependency of collectFuncDecls(manager, elseExpr)) {
92
+ if (
93
+ manager.funcDecls[dependency].domain.length === 0 ||
94
+ !model.funcInterps.has(dependency) ||
95
+ visited.has(dependency)
96
+ )
97
+ continue;
98
+ todo.push(dependency);
99
+ visited.add(dependency);
100
+ isAllVisited = false;
101
+ }
102
+ if (!isAllVisited) continue;
103
+ }
104
+ todo.pop();
105
+ result.push(current);
106
+ }
107
+ }
108
+ return result;
109
+ };
110
+
111
+ export const printModel = (
112
+ manager: AstManager,
113
+ environment: PrintEnvironment,
114
+ model: ProtoModel,
115
+ indent: number,
116
+ ) => {
117
+ const options = environment.options;
118
+ const render = (format: Format, amount = 0) => renderFormat(mkIndent(amount, format), options);
119
+ const formatValue = (expr: number) => formatExpr(manager, environment, expr).format;
120
+ const pad = " ".repeat(indent);
121
+ const output: string[] = [];
122
+
123
+ for (const sort of model.getUninterpretedSorts()) {
124
+ const universe = model.getKnownUniverse(sort);
125
+ const names = universe.map((value) =>
126
+ getQuotedName(manager.funcDecls[manager.decls[value]].name),
127
+ );
128
+ const header = `universe for ${render(formatSort(manager, sort), 13)}:\n ${names.map((name) => `${name} `).join("")}\n-----------`;
129
+ output.push(`${pad};; ${header.replaceAll("\n", `\n${pad};; `)}\n`);
130
+ output.push(`${pad};; definitions for universe elements:\n`);
131
+ for (const name of names)
132
+ output.push(
133
+ `${pad}(declare-fun ${name} () ${render(formatSort(manager, sort), indent + name.length + 16)})\n`,
134
+ );
135
+ output.push(`${pad};; cardinality constraint:\n`);
136
+ const conditions = names.map((name) => mkSeq1([mkText("x"), mkText(name)], "="));
137
+ const condition = conditions.length > 1 ? mkSeq1(conditions, "or") : conditions[0];
138
+ const cardinality = mkSeq1(
139
+ [
140
+ mkCompose(mkText("((x "), mkIndent(4, mkCompose(formatSort(manager, sort), mkText("))")))),
141
+ condition,
142
+ ],
143
+ "forall",
144
+ );
145
+ output.push(`${pad}${render(cardinality, indent)}\n`);
146
+ output.push(`${pad};; -----------\n`);
147
+ }
148
+
149
+ for (const decl of model.getConstDecls()) {
150
+ const name = getQuotedName(manager.funcDecls[decl].name);
151
+ const range = render(
152
+ formatSort(manager, manager.funcDecls[decl].range),
153
+ indent + name.length + 16,
154
+ );
155
+ const value = render(formatValue(model.constInterps.get(decl) as number));
156
+ output.push(`${pad}(define-fun ${name} () ${range}\n${pad}${" ".repeat(TAB_SIZE)}${value})\n`);
157
+ }
158
+
159
+ for (const decl of sortFuncDecls(manager, model)) {
160
+ if (!isConsideredUninterpreted(manager, decl)) continue;
161
+ const funcDecl = manager.funcDecls[decl];
162
+ const interp = model.funcInterps.get(decl);
163
+ if (interp === undefined) continue;
164
+ const formatted =
165
+ interp.elseExpr === null
166
+ ? {
167
+ format: mkText("#unspecified"),
168
+ names: Array.from({ length: interp.arity }, (_unused, index) => `x!${index + 1}`),
169
+ }
170
+ : formatExpr(manager, environment, interp.elseExpr, interp.arity, "x");
171
+ const varNames = formatted.names.map((name) => mkText(name));
172
+ // The port's declarations of division by zero leave out their domain, the sort of their range.
173
+ const domainSorts =
174
+ funcDecl.domain.length === interp.arity
175
+ ? funcDecl.domain
176
+ : Array.from({ length: interp.arity }, () => funcDecl.range);
177
+ const domain = mkSeq5(
178
+ domainSorts.map((sort, index) => mkSeq5([varNames[index], formatSort(manager, sort)])),
179
+ );
180
+ const entries = interp.entries.flatMap((entry, index) => {
181
+ const conditions = entry.args.map((arg, argIndex) =>
182
+ mkSeq1([varNames[argIndex], formatValue(arg)], "="),
183
+ );
184
+ const condition = conditions.length > 1 ? mkSeq1(conditions, "and") : conditions[0];
185
+ return [
186
+ ...(index > 0 ? [LINE_BREAK] : []),
187
+ mkGroup(
188
+ mkCompose(
189
+ mkText("(ite "),
190
+ mkIndent(5, condition),
191
+ mkIndent(TAB_SIZE, mkCompose(LINE_BREAK, formatValue(entry.result))),
192
+ ),
193
+ ),
194
+ ];
195
+ });
196
+ const body =
197
+ interp.entries.length === 0
198
+ ? formatted.format
199
+ : mkCompose(
200
+ ...entries,
201
+ mkIndent(TAB_SIZE, mkCompose(LINE_BREAK, formatted.format)),
202
+ ...interp.entries.map(() => mkText(")")),
203
+ );
204
+ const definition = mkCompose(
205
+ mkCompose(
206
+ mkText(`(define-fun ${getQuotedName(funcDecl.name)} `),
207
+ mkCompose(domain, mkText(" "), formatSort(manager, funcDecl.range)),
208
+ ),
209
+ mkIndent(TAB_SIZE, mkCompose(LINE_BREAK, body, mkText(")"))),
210
+ );
211
+ output.push(`${pad}${render(definition, indent)}\n`);
212
+ }
213
+ return output.join("");
214
+ };