@cavelang/solver-z3 0.34.0 → 0.36.0

package/BENCHMARK.md

@@ -1,8 +1,43 @@
 # Z3 feasibility benchmark
 
+## Current macOS measurements
+
+Measured on 2026-09-08 on macOS arm64 with `z3-solver` 5.2.0, whose embedded
+backend reports `Z3 5.1.0.0`. Each Node version ran in a separate process,
+sequentially, against the current worktree after the solver input-capture and
+explanation-ownership changes. The fixture uses `Solve.run`; it does not measure
+explanation construction. Each run completed one first optimized check and 25
+warm checks, all returning `optimal`, then closed the runtime and exited.
+
+| Measurement | Node 24.16.0 | Node 26.5.0 |
+|---|---:|---:|
+| Cold Wasm initialization | 69 ms | 75 ms |
+| First optimized check | 85.69 ms | 95.06 ms |
+| Warm mean | 5.16 ms | 5.15 ms |
+| Warm p50 | 5 ms | 4.92 ms |
+| Warm p95 | 6.09 ms | 5.97 ms |
+| RSS before initialization | 149,045,248 bytes | 151,977,984 bytes |
+| RSS after 26 checks | 284,917,760 bytes | 248,299,520 bytes |
+| Peak process RSS | 295,780,352 bytes | 256,851,968 bytes |
+
+Both runs measured 25 installed dependency files totaling 35,820,846 bytes,
+including 34,938,413 bytes of Wasm. The sum of individually gzip-compressed files
+was 8,066,680 bytes. This measures installed package contents, not an npm tarball.
+
+These are single-process observations with 25 warm samples each, not a latency
+budget or a controlled comparison against the earlier implementation. Platform,
+dependency version, cache state and concurrent machine activity can affect the
+results; the Linux measurements below are not a performance baseline for this
+Mac. Use `pnpm --filter @cavelang/solver-z3 benchmark` to reproduce the fixture.
+
+## Earlier Linux measurements
+
 Measured on 2026-07-15 on Linux x64 with `z3-solver` 4.16.0, both at
-the project's minimum Node.js 22.18 runtime and the available Node.js 24.14
-runtime. CI runs the full adapter and lifecycle suite on Node.js 22.
+the former minimum Node.js 22.18 runtime and the available Node.js 24.14
+runtime. These figures describe that measured dependency version, not the
+current adapter's performance. The runtime CI matrix now runs portable solver
+and adapter suites plus the large forced-GC cleanup diagnostic on its pinned
+Node 24 and 26 / Linux, macOS, and Windows entries.
 
 The fixture optimizes an exact architecture-choice model with a finite enum,
 bounded integer, exact-real cost, conditional constraint, and lexicographic
@@ -30,6 +65,24 @@ with its published dependencies in a clean consumer, solved a model, called
 `close()`, and exited without a worker hang. `scripts/benchmark.ts` reproduces
 the local measurements.
 
+Each successful JSON summary identifies the installed `z3-solver` package
+version separately from its embedded backend version, the canonical fixture
+model digest, and the number of verified checks. Keep these fields with saved
+measurements so results can be matched to the dependency and workload used.
+
+The current benchmark verifies every answer, not only its status: optimality
+must be proved, the selected architecture must be `monolith`, team size must be
+12, and both assigned monthly cost and the sole objective value must equal the
+exact rational `321/4` (80.25). A wrong answer fails without publishing timing
+statistics. Verification runs after each timed solve interval. The measurements
+above predate this stronger answer assertion and retain their original status-only
+verification scope.
+
+The benchmark closes its runtime in a `finally` block after initialization,
+including when the first check or a warm check returns an unexpected status,
+or a solve throws. Failed runs retain their diagnostic and do not emit a
+successful measurement summary.
+
 ## Decision
 
 Accept Z3 as an optional Node.js backend. It produces satisfying assignments,
@@ -38,7 +91,7 @@ exact decimals round-trip as rationals; actual deadlines return `unknown`;
 simultaneous calls are queued; and explicit shutdown terminates workers.
 
 Do not add it to `@cavelang/solver`, the CLI, MCP, or website dependency graph
-by default. Cold start, roughly 34.5 MB installed size, and process-wide
+by default. Cold start, roughly 35.8 MB installed size in the current measurement, and process-wide
 threaded-Wasm state are material costs. A consumer should opt into
 `@cavelang/solver-z3`, initialize once, reuse it, and close it only during
 process shutdown. Browser shipping remains a separate decision gate.

package/README.md

@@ -5,6 +5,18 @@ Optional Node.js adapter from CAVE's solver-neutral model to the official
 Wasm module is dynamically imported and initialized only when `create()` is
 called.
 
+| Task | Start here |
+| --- | --- |
+| Run a first model and close its runtime | [Quick start](#quick-start) |
+| Manage shared runtime ownership, failures and limits | [Runtime contract](#runtime-contract) |
+| Understand supported models and proof requirements | [Compilation semantics](#compilation-semantics) |
+| Check the browser support boundary | [Browser delivery decision](#browser-delivery-decision) |
+| Run the named workflow from the CLI | [Named workflow CLI fixture](#named-workflow-cli-fixture) |
+| Investigate timeout and interrupt recovery | [Deadline responsiveness diagnostic](#deadline-responsiveness-diagnostic) |
+| Investigate memory pressure and runtime recovery | [Memory recovery diagnostic](#memory-recovery-diagnostic) |
+
+## Quick start
+
 ```ts
 import { Model, Solve } from '@cavelang/solver'
 import { create } from '@cavelang/solver-z3'
@@ -28,12 +40,28 @@ const model: Model.t = {
 }
 
 const z3 = await create()
-const result = await Solve.run(z3, model, {
-  limits: { timeoutMs: 2_000 }
-})
-await z3.close()
+try {
+  const result = await Solve.run(z3, model, {
+    limits: { timeoutMs: 2_000 }
+  })
+  console.log(result)
+} finally {
+  await z3.close()
+}
 ```
 
+This example owns its runtime and closes it even when model validation or solving
+throws. In a shared service, keep runtime ownership at the service lifecycle: an
+individual request must not close the runtime used by other requests.
+
+Use `Solve.run` or `Solve.runWithExplanation` for application requests. These
+entry points validate options and limits, capture and validate the model, freeze
+the submitted graph, negotiate capabilities and capture the adapter result.
+The runtime's `solve` method is the low-level adapter interface: it queues the
+supplied model for compilation and assumes that preparation has already happened.
+Its targeted timeout and cycle checks do not replace model validation or protect
+a directly supplied mutable model from changes while queued.
+
 ## Runtime contract
 
 - `create()` initializes once and returns the same process runtime until it is
@@ -41,10 +69,55 @@ await z3.close()
 - Solve requests enter an explicit FIFO queue. Z3's TypeScript/Wasm binding is
   not thread-safe, so simultaneous requests never run checks concurrently or
   share solver state accidentally.
-- `close()` waits for queued checks, terminates all Emscripten workers, and is
+  Feasibility, optimization and unsatisfiable-core checks release their owned
+  solver/optimizer only after the operation settles. If both the operation and
+  release fail, both errors survive in order, with the operation error as cause;
+  neither an unprintable value nor a release error hides the original failure.
+  A release failure alone is propagated unchanged. Each release is attempted
+  once; this does not guarantee recovery from damaged native state.
+- `close()` waits for queued checks, requests worker termination and awaits
+  Node's worker exit acknowledgments before clearing Emscripten's pool. It is
   idempotent. Short-lived commands must call it before exit.
+  Closing marks the runtime unavailable to new solves immediately, but existing
+  queued work settles before worker termination begins. `close()` does not
+  forcibly terminate an active native check; if that check never settles, close
+  remains pending as well. The check timeout and shutdown therefore share the
+  cooperative-cancellation boundary.
+  If worker termination fails, shutdown still attempts every worker in that
+  batch and awaits all attempts before rejecting. It retains the pool's message
+  handlers; one failure is rethrown unchanged and multiple failures are grouped
+  in an `AggregateError` whose message includes each failure diagnostic. A failed runtime shutdown remains failed on subsequent
+  `close()` or `create()` calls.
+  Pending cleanup messages retain their handlers until worker exit; shutdown
+  does not assume they arrive within one timer turn. The pool can contain
+  persistent workers, so shutdown does not wait for the running pool to become
+  empty on its own.
+  Calls to `create()` during shutdown wait for it to finish, then share one
+  new runtime. They never receive the closing instance. Repeated calls to the
+  old runtime's `close()` cannot clear the replacement.
 - Every check receives Z3's internal timeout plus an independent wall-clock
-  interrupt. The portable memory limit is applied through Z3's process-wide
+  interrupt. After expiry, CAVE repeats the interrupt every 50 ms while the
+  check remains pending and stops the timer when the check resolves or rejects.
+  An exception from an interrupt request stays within the solve operation instead
+  of escaping the timer callback. Cancellation retries continue, retaining the
+  first interrupt failure without accumulating repeated errors. The helper waits
+  for the native check to settle before reporting failure, so solver/optimizer
+  cleanup cannot race pending work. If the check also rejects, its error and the
+  first interrupt error are retained together, with the check error as cause.
+  Their combined message includes both underlying diagnostics, so the public
+  backend-error reason retains them after error conversion. Unprintable thrown
+  values use a safe placeholder; later interrupt failures do not replace the first.
+  Cancellation is cooperative: the timer does not impose a hard process deadline,
+  and initialization, queue wait and model compilation are outside this check timer.
+  A live regression times out an 80-variable pigeonhole model, then immediately
+  solves a satisfiable Boolean model on the same runtime. It checks the returned
+  assignment and preserves the earlier timeout result. This verifies recovery
+  for that workload, not termination or recovery from every native stall.
+  This adapter accepts `timeoutMs` in 1..2147483647; larger deadlines
+  return `unknown` with a `backend-error` before compilation, preventing timer
+  overflow from becoming an immediate interrupt. This adapter-specific bound
+  does not change other adapters' portable limit contract.
+  The portable memory limit is applied through Z3's process-wide
   `memory_max_size` parameter while requests are serialized.
 - Preflight declaration and expression limits remain in `@cavelang/solver`.
   This adapter additionally enforces `maxOutputBytes` on the serialized result.
@@ -55,17 +128,66 @@ await z3.close()
 ## Compilation semantics
 
 Booleans, bounded integers, exact rationals, conditionals, arithmetic, and
-hard constraints compile directly. Decimal strings are reduced by
+hard constraints compile directly. A live truth-table regression checks negation,
+conjunction, disjunction, implication, Boolean equality/inequality and conditional
+selection for all four Boolean input pairs. It also checks a conditional whose
+branches mix an exact real half with an integer, preserving the selected value.
+Decimal strings are reduced by
 `@cavelang/solver` and passed to Z3 as `bigint` numerator/denominator pairs,
 never as JavaScript floating point. Finite enums use bounded integer codes and
 are decoded through the domain's canonical lexical order, so declaration
 reordering cannot change an unconstrained assignment.
+Enum literal lookup uses a value-to-code map built once from each sorted domain
+for the compilation call. This removes repeated linear domain scans while
+retaining the sorted array for decoding assignments. The extra maps use space
+proportional to enum members and are rebuilt for each request; domain mutation
+and reordering cannot reuse stale codes. Empty strings, prototype-like names
+and distinct Unicode spellings retain their exact member identities.
+
+Expression compilation uses an explicit traversal stack and caches shared
+subexpressions within one model. Models accepted with raised depth limits can
+reach Z3 without recursive JavaScript call-stack exhaustion. Repeated operands
+remain repeated operations, and compiled expressions never cross requests.
+Wide conjunctions and disjunctions compile in groups of at most 1,024 operands,
+preserving every operand through associativity. This avoids JavaScript argument
+limits in both the adapter and the Z3 binding, including for expressions within
+the default node budget.
+Generated variable-domain bounds are also submitted in batches of at most
+1,024 assertions, for both feasibility and optimization. Raising the variable
+limit therefore does not create one unbounded JavaScript argument list. Large
+models may also need an explicit `maxNumericDigits` increase for their aggregate
+bound and literal digits; raising the variable limit does not raise that budget.
 
 Named hard constraints use tracked Boolean literals, so an unsatisfiable core
-maps back to portable constraint IDs. Objective declaration order is Z3's
+maps back to portable constraint IDs. After optimization proves infeasibility,
+a separate tracked feasibility check extracts the optional core. That check
+has its own configured timeout; if it returns no infeasibility proof, the
+original result retains its proof with no core. A live regression checks the
+same stable core IDs through both feasibility and optimization. Trackers use fresh Z3 symbols to avoid
+collisions with user variable names; requesting a core cannot add a constraint
+on a user variable through a shared symbol. Objective declaration order is Z3's
 lexicographic order. Explicit weighted soft constraints form the final,
 lowest-priority objective; their weights are never inferred from CAVE belief
-confidence.
+confidence. A live tradeoff regression minimizes `x` and `y` under `x + y >= 10`
+with both variables bounded to 0..10. Reversing objective order switches the
+assignment from `(0, 10)` to `(10, 0)`; a weight-1,000,000 preference for `x = 5`
+cannot override either explicit priority. Returned objective values retain
+declaration order.
+`Solve.run` charges soft weights to the model's aggregate `maxNumericDigits`
+allowance before exact validation and backend invocation. Compilation reduces each weight and passes its
+`numerator/denominator` text directly to Z3; it does not expand repeating decimals
+or convert weights to JavaScript numbers. A real-backend regression swaps two
+nonterminating rational weights that collapse to the same binary64 value and
+verifies that the chosen Boolean follows the stronger exact weight both ways.
+Fraction formatting copies the normalized components; exact reduction and native
+optimization remain separate costs. Numeric preflight is not a wall-clock bound,
+and the check timer does not cover compilation.
+
+An `optimal` result requires each explicit objective's lower and upper bounds
+to be the same finite rational, attained by the returned assignment. This check
+uses exact arithmetic for every lexicographic objective. Unbounded objectives,
+unattained strict bounds, or a model that does not attain the proved bound
+return `unknown` with reason `indeterminate`, never a proof of optimality.
 
 See [BENCHMARK.md](BENCHMARK.md) for artifact, initialization, solve, memory,
 packaging, and lifecycle measurements. The spike accepts Z3 for optional
@@ -103,3 +225,139 @@ uses the workflow API, so model validation, capability negotiation, limits,
 deterministic tie-breaking, and `unknown` semantics cannot be bypassed. The
 JSON output is a versioned workflow/explanation report. The fixture's relative
 cost formula is deliberately illustrative and does not use belief confidence.
+Argument errors return exit code 2. Runtime startup, workflow execution and
+shutdown failures return code 1 with empty stdout and a diagnostic on stderr.
+If execution and shutdown both fail, the diagnostic retains the execution error
+followed by the shutdown error. A successful report is emitted only after the
+owned runtime closes successfully. Programmatic `runWorkflowFixture` calls
+return the same output fields and close only runtimes created by the fixture;
+caller-supplied adapters remain caller-owned. Exception formatting is guarded:
+values whose message or string conversion throws produce
+`[unprintable thrown value]`, so diagnostic rendering cannot skip owned cleanup
+or replace the error result. Backend-error diagnostics use the same fallback.
+
+All four operations accept `--max-explanation-bits <positive integer>` to set
+the local constraint-evaluation size budget (default: 1,000,000). The value is
+validated before loading Z3 and travels in the report's resolved limits.
+For example, `cave-solver-workflow architecture feasibility --max-explanation-bits 2000000`
+allows a larger local evaluation than the default. Exceeding the budget leaves
+the backend outcome intact and marks affected constraints indeterminate; retry
+with a larger value to request a fresh evaluation. This conservative fraction-size
+budget is separate from `--timeout-ms` and backend memory limits.
+All four operations also accept `--max-explanation-work <positive integer>`
+(default: 10,000,000) for cumulative estimated-bit charges within each report.
+It is validated before Z3 starts and recorded with the resolved limits. Exhaustion
+marks affected local evaluations indeterminate while preserving the backend result;
+use a larger allowance for a fresh report requiring more distinct arithmetic.
+This counter does not cover every report phase or guarantee elapsed time.
+The CLI accepts `--timeout-ms` only in Z3's supported range, 1..2147483647.
+Larger values fail as argument errors before adapter startup, rather than
+producing a backend-error workflow report. Both endpoints of the range remain
+valid, and a corrected invocation can run normally.
+
+The real-adapter suite also checks sensitivity batch preflight and provenance.
+A later sample that exceeds the generated-model digit budget is rejected before
+any Z3 submission. Raising the limit solves both distinct sample models, reports
+their exact assignments and the observed transition, and retains the authored
+model's digest in the batch, point and explanation reports. Generated sample
+models have their own distinct digests; they do not replace source identity.
+
+## Deadline responsiveness diagnostic
+
+Run `node scripts/z3-deadline-probe.mjs` from the repository root to exercise
+three fresh processes, each issuing ten 1 ms pigeonhole requests on one runtime
+and following every timeout result with a satisfiable recovery request. The
+parent imposes a 15-second allowance per process, retains partial event output
+and terminates an overrun. This is a diagnostic harness limit, not an adapter
+guarantee; the probe exits unsuccessfully if any process fails or overruns.
+
+A Node 26 suite observed a 208.5-second timeout test. The initial bounded probe
+reproduced a stall in one of three processes; the other 25 requests completed in
+118–191 ms. Retrying interrupts while native work remains pending then completed
+all 30 requests and recovery checks on each supported Node major: 118–220 ms on
+Node 24.21.0 and 113–237 ms on Node 26.8.1. These complete-call times include
+preparation. [Partial reproduction events and subsequent results](../../benchmarks/z3-deadline-retry-review.json)
+retain the failure evidence and source hashes. A deterministic test verifies
+repeated cancellation after a check ignores the first interrupt, and timer
+cleanup after settlement. The precise native cause remains unproven; successful
+retries do not establish a hard elapsed-time bound.
+
+A later [current-source checkpoint](../../benchmarks/z3-deadline-current-review.json)
+also completes all 30 timeout/recovery pairs per major and closes all three
+runtimes: 112–220 ms per complete call on Node 26.8.1 and 114–226 ms on Node
+24.21.0. The probe now fingerprints every solver and Z3 adapter TypeScript
+source, including the deadline helper and error formatting, plus its own source
+and the lockfile. Earlier reports retain their original narrower fingerprint
+scope; the historical stalled run remains evidence for the unresolved native
+cause. These finite runs do not guarantee recovery from every native stall.
+
+## Memory recovery diagnostic
+
+Run `pnpm --filter @cavelang/solver-z3 test:memory-stress` to exercise ten
+memory-limit failures followed by optimization of 3,000 bounded variables in
+the same runtime, with forced garbage collection during asynchronous checks.
+The command enables `--expose-gc`, logs environment and phase metadata, and
+verifies each recovery's complete assignment and exact optimum. Assertion
+failures exit unsuccessfully after worker cleanup. This diagnostic is separate
+from the ordinary test suite and does not establish recovery from every fatal
+Wasm error.
+
+A [current-source checkpoint](../../benchmarks/z3-memory-current-review.json)
+passes all ten default cycles on Node 26.8.1 and 24.21.0: each 1 MiB memory-limit
+failure is followed by the exact optimum of 3,000 and validation of all 3,000
+assignments in the same runtime. Both processes exit cleanly after runtime
+closure. The record includes phase output and solver/adapter source fingerprints.
+This checkpoint does not rerun `--large` or cover every fatal native error.
+
+Add `--large` to run three cycles that insert the original 75,000-variable
+domain-bound contradiction in both feasibility and optimization modes between
+each memory-limit failure and the 3,000-variable recovery probe. The large
+fixture explicitly permits 75,000 variables and 150,002 numeric digits: two
+one-digit bounds per variable, one constraint literal and an optional objective
+literal. These diagnostic settings let the intended backend stress run reach Z3
+without changing production validation defaults. Large phases
+log the complete result, wall time, and Node process memory counters. These
+counters describe process memory, not Z3's internal allocation accounting.
+The diagnostic submits subsequent requests before asserting large-phase
+results, preserving evidence of whether the same runtime remains usable.
+The runtime CI matrix runs the large diagnostic on each configured runtime/OS
+entry. Each large solve has a 120-second budget and each recovery solve has a
+30-second budget; the CI step has a
+20-minute timeout to bound native hangs across all three cycles. Its solve
+budgets total up to 14 minutes, leaving at least six minutes for initialization,
+validation, compilation, forced GC, logging and cleanup. The enclosing
+runtime job allows 40 minutes for that step plus setup, native suites and CLI
+checks; a runtime-policy test keeps at least 15 minutes outside the stress step. The larger
+budget accommodates shared-runner performance: Windows CI exceeded the previous
+30-second feasibility deadline while the following optimization and recovery
+still returned the expected results. A later Windows run reached recovery but
+exceeded its default 10-second budget, so that phase now also has an explicit
+diagnostic budget. This diagnostic checks cleanup correctness;
+it does not impose a 30-second performance requirement. Workload size, forced
+collection frequency and exact result assertions remain unchanged.
+
+The adapter defers native reference cleanup while its asynchronous feasibility
+or optimization check runs, draining releases once the native promise settles,
+including on rejection. The binding's garbage-collection finalizers otherwise
+call native reference decrements outside its check mutex, allowing AST deletion
+to overlap the solver thread. The large diagnostic exposed both an incorrect
+recovery optimum (`0` instead of `3000`) and a memory-access crash in that
+cleanup path. The guard belongs to CAVE's private Z3 instance; it changes no
+global JavaScript finalizer behavior and keeps synchronous cleanup immediate.
+Queued releases are attempted in order even when an earlier release throws.
+A lone cleanup failure propagates unchanged; multiple failures are retained in
+an `AggregateError`. If the native check also failed, its error comes first and
+remains the cause, followed by cleanup failures in release order. Unprintable
+thrown values cannot interrupt diagnostic formatting or skip later releases.
+Drained releases are not replayed by a subsequent check. This preserves cleanup
+attempts and error ownership; it does not promise that damaged native state is
+recoverable after a failed release.
+A [post-fix native recovery checkpoint](../../benchmarks/z3-cleanup-recovery-review.json)
+passes three large cycles on each supported Node major under forced garbage
+collection, retaining the 75,000-variable checks and exact recovery optimum.
+It verifies this workload and clean process exit, not arbitrary native failures.
+
+Process lifecycle tests launch fixtures using native paths converted with
+`fileURLToPath`, so Windows drive letters and percent-encoded checkout names
+reach Node correctly. These tests exercise worker shutdown and runtime reopening
+in a separate process.

package/dist/scripts/benchmark.js

@@ -1,12 +1,14 @@
+import assert from 'node:assert/strict';
 import { readFile, readdir, stat } from 'node:fs/promises';
 import { dirname, join } from 'node:path';
 import { createRequire } from 'node:module';
 import { gzipSync } from 'node:zlib';
 import { performance } from 'node:perf_hooks';
-import { Model, Solve } from '@cavelang/solver';
+import { Canonical, Model, Solve } from '@cavelang/solver';
 import { create } from '@cavelang/solver-z3';
 const require = createRequire(import.meta.url);
 const packageRoot = dirname(require.resolve('z3-solver/package.json'));
+const dependencyVersion = JSON.parse(await readFile(join(packageRoot, 'package.json'), 'utf8')).version;
 const files = async (directory) => {
     const entries = await readdir(directory, { withFileTypes: true });
     return (await Promise.all(entries.map(async (entry) => {
@@ -49,23 +51,41 @@ const architecture = {
         }],
     objectives: [{ id: 'min-monthly-cost', direction: 'minimize', expression: ref('monthly-cost') }]
 };
+const verify = (result, phase) => {
+    if (result.status !== 'optimal')
+        throw new Error(`${phase} fixture returned ${result.status}`);
+    assert.equal(result.optimalityProved, true, `${phase}: optimality must be proved`);
+    const cost = { sort: 'real', numerator: '321', denominator: '4' };
+    assert.deepEqual(result.assignment, {
+        choice: { sort: 'enum', domain: 'architecture', value: 'monolith' },
+        'team-size': { sort: 'int', value: '12' },
+        'monthly-cost': cost
+    }, `${phase}: incorrect benchmark assignment`);
+    assert.equal(result.objectives.length, 1, `${phase}: expected one objective`);
+    assert.equal(result.objectives[0]?.objectiveId, 'min-monthly-cost');
+    assert.deepEqual(result.objectives[0]?.value, cost, `${phase}: incorrect exact optimum`);
+};
 const beforeRssBytes = process.memoryUsage().rss;
 const runtime = await create();
-const firstStarted = performance.now();
-const first = await Solve.run(runtime, architecture);
-const firstCheckMs = performance.now() - firstStarted;
-if (first.status !== 'optimal')
-    throw new Error(`benchmark fixture returned ${first.status}`);
+let firstCheckMs;
 const warmRuns = 25;
 const warm = [];
-for (let index = 0; index < warmRuns; index += 1) {
-    const started = performance.now();
-    const result = await Solve.run(runtime, architecture);
-    if (result.status !== 'optimal')
-        throw new Error(`warm fixture returned ${result.status}`);
-    warm.push(performance.now() - started);
+try {
+    const firstStarted = performance.now();
+    const first = await Solve.run(runtime, architecture);
+    firstCheckMs = performance.now() - firstStarted;
+    verify(first, 'benchmark');
+    for (let index = 0; index < warmRuns; index += 1) {
+        const started = performance.now();
+        const result = await Solve.run(runtime, architecture);
+        const elapsed = performance.now() - started;
+        verify(result, 'warm');
+        warm.push(elapsed);
+    }
+}
+finally {
+    await runtime.close();
 }
-await runtime.close();
 warm.sort((left, right) => left - right);
 const mean = warm.reduce((sum, value) => sum + value, 0) / warm.length;
 console.log(JSON.stringify({
@@ -73,6 +93,8 @@ console.log(JSON.stringify({
     platform: `${process.platform}-${process.arch}`,
     node: process.version,
     backend: runtime.backend,
+    dependency: { name: 'z3-solver', version: dependencyVersion },
+    fixture: { modelDigest: Canonical.digest(architecture), verifiedChecks: warm.length + 1 },
     artifacts: {
         files: paths.length,
         installedBytes,

package/dist/scripts/benchmark.js.map

@@ -1 +1 @@
-{"version":3,"file":"benchmark.js","sourceRoot":"","sources":["../../scripts/benchmark.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AAC1D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAA;AAC7C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAE5C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC,CAAA;AAEtE,MAAM,KAAK,GAAG,KAAK,EAAE,SAAiB,EAAqB,EAAE;IAC3D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;IACjE,OAAO,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAC,KAAK,EAAC,EAAE;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;QACxC,OAAO,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACnD,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;AACb,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,CAAA;AACtC,IAAI,cAAc,GAAG,CAAC,CAAA;AACtB,IAAI,SAAS,GAAG,CAAC,CAAA;AACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;IACzB,cAAc,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IACzC,SAAS,IAAI,QAAQ,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,UAAU,CAAA;AACtE,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,EAAU,EAAoB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAA;AACxE,MAAM,YAAY,GAAY;IAC5B,MAAM,EAAE,KAAK,CAAC,MAAM;IACpB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,UAAU,EAAE,eAAe,CAAC,EAAE,CAAC;IACtE,SAAS,EAAE;QACT,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE;QACtD,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;QAClD,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE;KAC5D;IACD,WAAW,EAAE,CAAC;YACZ,EAAE,EAAE,mBAAmB;YACvB,UAAU,EAAE;gBACV,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,GAAG,CAAC,cAAc,CAAC;gBACzB,KAAK,EAAE;oBACL,IAAI,EAAE,IAAI;oBACV,SAAS,EAAE;wBACT,IAAI,EAAE,IAAI;wBACV,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;wBACnB,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,UAAU,EAAE;qBACpF;oBACD,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE;oBACvD,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE;iBACzD;aACF;SACF,CAAC;IACF,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;CACjG,CAAA;AAED,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG,CAAA;AAChD,MAAM,OAAO,GAAG,MAAM,MAAM,EAAE,CAAA;AAC9B,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;AACtC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;AACpD,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,YAAY,CAAA;AACrD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS;IAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;AAE7F,MAAM,QAAQ,GAAG,EAAE,CAAA;AACnB,MAAM,IAAI,GAAa,EAAE,CAAA;AACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;IACjD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;IACjC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IACrD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;IAC1F,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,CAAA;AACxC,CAAC;AAED,MAAM,OAAO,CAAC,KAAK,EAAE,CAAA;AACrB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAA;AACxC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;AAEtE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;IACzB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IACrC,QAAQ,EAAE,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,IAAI,EAAE;IAC/C,IAAI,EAAE,OAAO,CAAC,OAAO;IACrB,OAAO,EAAE,OAAO,CAAC,OAAO;IACxB,SAAS,EAAE;QACT,KAAK,EAAE,KAAK,CAAC,MAAM;QACnB,cAAc;QACd,SAAS;QACT,SAAS,EAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,IAAI;KACvE;IACD,SAAS,EAAE;QACT,kBAAkB,EAAE,OAAO,CAAC,gBAAgB;QAC5C,UAAU,EAAE,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC3C,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAChE,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjE,QAAQ;KACT;IACD,WAAW,EAAE;QACX,uBAAuB,EAAE,cAAc;QACvC,YAAY,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG;QACvC,OAAO,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,MAAM,GAAG,IAAI;KAC/C;CACF,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA"}
+{"version":3,"file":"benchmark.js","sourceRoot":"","sources":["../../scripts/benchmark.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,oBAAoB,CAAA;AACvC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AAC1D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAA;AAC7C,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAE5C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC,CAAA;AACtE,MAAM,iBAAiB,GAAI,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,EAAE,MAAM,CAAC,CAAyB,CAAC,OAAO,CAAA;AAEhI,MAAM,KAAK,GAAG,KAAK,EAAE,SAAiB,EAAqB,EAAE;IAC3D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;IACjE,OAAO,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAC,KAAK,EAAC,EAAE;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;QACxC,OAAO,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACnD,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;AACb,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,CAAA;AACtC,IAAI,cAAc,GAAG,CAAC,CAAA;AACtB,IAAI,SAAS,GAAG,CAAC,CAAA;AACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;IACzB,cAAc,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IACzC,SAAS,IAAI,QAAQ,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,UAAU,CAAA;AACtE,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,EAAU,EAAoB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAA;AACxE,MAAM,YAAY,GAAY;IAC5B,MAAM,EAAE,KAAK,CAAC,MAAM;IACpB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,UAAU,EAAE,eAAe,CAAC,EAAE,CAAC;IACtE,SAAS,EAAE;QACT,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE;QACtD,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;QAClD,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE;KAC5D;IACD,WAAW,EAAE,CAAC;YACZ,EAAE,EAAE,mBAAmB;YACvB,UAAU,EAAE;gBACV,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,GAAG,CAAC,cAAc,CAAC;gBACzB,KAAK,EAAE;oBACL,IAAI,EAAE,IAAI;oBACV,SAAS,EAAE;wBACT,IAAI,EAAE,IAAI;wBACV,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;wBACnB,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,UAAU,EAAE;qBACpF;oBACD,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE;oBACvD,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE;iBACzD;aACF;SACF,CAAC;IACF,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;CACjG,CAAA;AAED,MAAM,MAAM,GAAG,CAAC,MAA6C,EAAE,KAAa,EAAQ,EAAE;IACpF,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,qBAAqB,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;IAC9F,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,gBAAgB,EAAE,IAAI,EAAE,GAAG,KAAK,6BAA6B,CAAC,CAAA;IAClF,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,CAAA;IACjE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;QAClC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,UAAU,EAAE;QACnE,WAAW,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;QACzC,cAAc,EAAE,IAAI;KACrB,EAAE,GAAG,KAAK,kCAAkC,CAAC,CAAA;IAC9C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,0BAA0B,CAAC,CAAA;IAC7E,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,kBAAkB,CAAC,CAAA;IACnE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,KAAK,2BAA2B,CAAC,CAAA;AAC1F,CAAC,CAAA;AAED,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG,CAAA;AAChD,MAAM,OAAO,GAAG,MAAM,MAAM,EAAE,CAAA;AAC9B,IAAI,YAAoB,CAAA;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAA;AACnB,MAAM,IAAI,GAAa,EAAE,CAAA;AACzB,IAAI,CAAC;IACH,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;IACtC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IACpD,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,YAAY,CAAA;IAC/C,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAA;IAE1B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;QACjC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;QACrD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,OAAO,CAAA;QAC3C,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACpB,CAAC;AACH,CAAC;QAAS,CAAC;IACT,MAAM,OAAO,CAAC,KAAK,EAAE,CAAA;AACvB,CAAC;AAED,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAA;AACxC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;AAEtE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;IACzB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IACrC,QAAQ,EAAE,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,IAAI,EAAE;IAC/C,IAAI,EAAE,OAAO,CAAC,OAAO;IACrB,OAAO,EAAE,OAAO,CAAC,OAAO;IACxB,UAAU,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAE;IAC7D,OAAO,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;IACzF,SAAS,EAAE;QACT,KAAK,EAAE,KAAK,CAAC,MAAM;QACnB,cAAc;QACd,SAAS;QACT,SAAS,EAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,IAAI;KACvE;IACD,SAAS,EAAE;QACT,kBAAkB,EAAE,OAAO,CAAC,gBAAgB;QAC5C,UAAU,EAAE,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC3C,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAChE,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjE,QAAQ;KACT;IACD,WAAW,EAAE;QACX,uBAAuB,EAAE,cAAc;QACvC,YAAY,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG;QACvC,OAAO,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,MAAM,GAAG,IAAI;KAC/C;CACF,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA"}

package/dist/scripts/memory-stress.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=memory-stress.d.ts.map

package/dist/scripts/memory-stress.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-stress.d.ts","sourceRoot":"","sources":["../../scripts/memory-stress.ts"],"names":[],"mappings":""}

package/dist/scripts/memory-stress.js

@@ -0,0 +1,74 @@
+import * as assert from 'node:assert/strict';
+import { Model, Solve } from '@cavelang/solver';
+import { create } from '@cavelang/solver-z3';
+const gc = globalThis.gc;
+assert.ok(gc, 'run this diagnostic with node --expose-gc');
+assert.ok(process.argv.slice(2).every(argument => argument === '--large') && process.argv.length <= 3, 'usage: memory-stress.ts [--large]');
+const large = process.argv.includes('--large');
+const iterations = large ? 3 : 10;
+const runtime = await create();
+const count = 3_000;
+const model = {
+    schema: Model.schema,
+    variables: Array.from({ length: count }, (_, index) => ({ id: `x${index}`, sort: 'int', min: 0, max: 1 })),
+    constraints: [],
+    objectives: [{
+            id: 'total', direction: 'maximize',
+            expression: { kind: 'add', operands: Array.from({ length: count }, (_, index) => ({ kind: 'variable', id: `x${index}` })) }
+        }]
+};
+const small = { schema: Model.schema, variables: [{ id: 'ok', sort: 'bool' }], constraints: [] };
+const timer = setInterval(gc, 1);
+try {
+    console.log(JSON.stringify({ node: process.version, platform: process.platform, arch: process.arch, backend: runtime.backend, iterations, variables: count, largeVariables: large ? 75_000 : 0 }));
+    for (let iteration = 0; iteration < iterations; iteration++) {
+        const limited = await Solve.run(runtime, small, { limits: { maxMemoryBytes: 1024 * 1024 } });
+        console.log(JSON.stringify({ iteration, phase: 'limited', result: limited }));
+        assert.equal(limited.status, 'unknown');
+        if (limited.status === 'unknown') {
+            assert.equal(limited.reason.kind, 'resource-limit');
+            assert.equal(limited.reason.limit, 'maxMemoryBytes');
+        }
+        const largeResults = [];
+        if (large) {
+            const largeCount = 75_000;
+            const variables = Array.from({ length: largeCount }, (_, index) => ({ id: `v${index}`, sort: 'int', min: 0, max: 1 }));
+            for (const optimize of [false, true]) {
+                console.log(JSON.stringify({ iteration, phase: optimize ? 'large-optimization-start' : 'large-feasibility-start' }));
+                const started = performance.now();
+                const result = await Solve.run(runtime, {
+                    schema: Model.schema,
+                    variables,
+                    constraints: [{ id: 'outside-last-domain', expression: { kind: 'lt', left: { kind: 'variable', id: `v${largeCount - 1}` }, right: { kind: 'literal', sort: 'int', value: '0' } } }],
+                    ...(optimize ? { objectives: [{ id: 'constant', direction: 'minimize', expression: { kind: 'literal', sort: 'int', value: '0' } }] } : {})
+                }, { limits: {
+                        maxVariables: largeCount,
+                        // Two one-digit bounds per variable, plus the constraint and optional objective literals.
+                        maxNumericDigits: 2 * largeCount + 2,
+                        // This diagnostic checks cleanup correctness, not shared-runner latency.
+                        timeoutMs: 120_000
+                    } });
+                console.log(JSON.stringify({ iteration, phase: optimize ? 'large-optimization' : 'large-feasibility', result, wallMs: performance.now() - started, memory: process.memoryUsage() }));
+                // Probe subsequent requests before asserting so a poisoned runtime is visible.
+                largeResults.push(result);
+            }
+        }
+        console.log(JSON.stringify({ iteration, phase: 'recovery-start' }));
+        const result = await Solve.run(runtime, model, { limits: { maxVariables: count, timeoutMs: 30_000 } });
+        console.log(JSON.stringify({ iteration, phase: 'recovered', status: result.status, elapsedMs: result.elapsedMs, ...(result.status === 'unknown' ? { reason: result.reason } : {}), ...(result.status === 'optimal' ? { objectives: result.objectives } : {}) }));
+        assert.equal(result.status, 'optimal', JSON.stringify(result));
+        if (result.status === 'optimal') {
+            assert.deepEqual(result.objectives, [{ objectiveId: 'total', value: { sort: 'int', value: String(count) } }]);
+            assert.equal(Object.keys(result.assignment).length, count);
+            for (const value of Object.values(result.assignment))
+                assert.deepEqual(value, { sort: 'int', value: '1' });
+        }
+        for (const result of largeResults)
+            assert.equal(result.status, 'unsatisfied', JSON.stringify(result));
+    }
+}
+finally {
+    clearInterval(timer);
+    await runtime.close();
+}
+//# sourceMappingURL=memory-stress.js.map

package/dist/scripts/memory-stress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-stress.js","sourceRoot":"","sources":["../../scripts/memory-stress.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,oBAAoB,CAAA;AAC5C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAE5C,MAAM,EAAE,GAAI,UAAkC,CAAC,EAAE,CAAA;AACjD,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,2CAA2C,CAAC,CAAA;AAC1D,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,KAAK,SAAS,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EACnG,mCAAmC,CAAC,CAAA;AACtC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;AAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;AACjC,MAAM,OAAO,GAAG,MAAM,MAAM,EAAE,CAAA;AAC9B,MAAM,KAAK,GAAG,KAAK,CAAA;AACnB,MAAM,KAAK,GAAY;IACrB,MAAM,EAAE,KAAK,CAAC,MAAM;IACpB,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1G,WAAW,EAAE,EAAE;IACf,UAAU,EAAE,CAAC;YACX,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU;YAClC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE;SAC5H,CAAC;CACH,CAAA;AACD,MAAM,KAAK,GAAY,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAA;AACzG,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;AAChC,IAAI,CAAC;IACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAClM,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,UAAU,EAAE,SAAS,EAAE,EAAE,CAAC;QAC5D,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,cAAc,EAAE,IAAI,GAAG,IAAI,EAAE,EAAE,CAAC,CAAA;QAC5F,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;QAC7E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAA;YACnD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAA;QACtD,CAAC;QACD,MAAM,YAAY,GAAG,EAAE,CAAA;QACvB,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,UAAU,GAAG,MAAM,CAAA;YACzB,MAAM,SAAS,GAAqB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACxI,KAAK,MAAM,QAAQ,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,yBAAyB,EAAE,CAAC,CAAC,CAAA;gBACpH,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;gBACjC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE;oBACtC,MAAM,EAAE,KAAK,CAAC,MAAM;oBACpB,SAAS;oBACT,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,qBAAqB,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,UAAU,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;oBACnL,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,UAAmB,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,SAAkB,EAAE,IAAI,EAAE,KAAc,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtK,EAAE,EAAE,MAAM,EAAE;wBACX,YAAY,EAAE,UAAU;wBACxB,0FAA0F;wBAC1F,gBAAgB,EAAE,CAAC,GAAG,UAAU,GAAG,CAAC;wBACpC,yEAAyE;wBACzE,SAAS,EAAE,OAAO;qBACnB,EAAE,CAAC,CAAA;gBACJ,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,mBAAmB,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAA;gBACpL,+EAA+E;gBAC/E,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAA;QACnE,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,CAAA;QACtG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAChQ,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAA;QAC9D,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;YAC7G,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YAC1D,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;gBAAE,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;QAC5G,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,YAAY;YAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAA;IACvG,CAAC;AACH,CAAC;QAAS,CAAC;IACT,aAAa,CAAC,KAAK,CAAC,CAAA;IACpB,MAAM,OAAO,CAAC,KAAK,EAAE,CAAA;AACvB,CAAC"}

package/dist/src/cleanup.d.ts

@@ -0,0 +1,8 @@
+/**
+ * The binding's finalizers call this instance's low-level API directly, outside
+ * its async mutex. Native AST deletion must not race a pthread solver check.
+ * Guard the two async native operations CAVE uses; normal synchronous releases
+ * remain immediate, and queued releases drain before a check returns to CAVE.
+ */
+export declare const guardCleanup: (api: object) => void;
+//# sourceMappingURL=cleanup.d.ts.map

package/dist/src/cleanup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cleanup.d.ts","sourceRoot":"","sources":["../../src/cleanup.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,eAAO,MAAM,YAAY,GAAI,KAAK,MAAM,KAAG,IA8C1C,CAAA"}