About the Execution of ITS-Tools for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1214.420 | 365915.00 | 445912.00 | 4457.40 | 4 16 1 1 1 16 1 1 1 1 4 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800869.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 50K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779677084160
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 02:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:44:45] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2026-05-25 02:44:45] [INFO ] Transformed 163 places.
[2026-05-25 02:44:45] [INFO ] Transformed 148 transitions.
[2026-05-25 02:44:45] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9055026948558326076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10134435391175295546.kers'
[2026-05-25 02:44:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9055026948558326076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10134435391175295546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 163 cols 417 entries
Finished phase 1 with 134 SingleSign rule and 10 generalized
[2026-05-25 02:44:45] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10134435391175295546.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, 1, +inf, 3, 1, 1, 1, +inf, 22, 1, 1, 1, 1]
RANDOM walk for 10000 steps (332 resets) in 57 ms. (172 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120003 steps (3415 resets) in 212 ms. (563 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 3, 1, 1, +inf, 22, 1, 1]
[2026-05-25 02:44:45] [INFO ] Invariant cache hit.
[2026-05-25 02:44:46] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-25 02:44:46] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2026-05-25 02:44:46] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-25 02:44:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:44:46] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-25 02:44:46] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-25 02:44:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2026-05-25 02:44:46] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:44:46] [INFO ] Added : 63 causal constraints over 14 iterations in 350 ms. Result :sat
Minimization took 194 ms.
[2026-05-25 02:44:47] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:47] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 02:44:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:47] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:47] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 02:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2026-05-25 02:44:47] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2026-05-25 02:44:48] [INFO ] Added : 144 causal constraints over 30 iterations in 640 ms. Result :sat
Minimization took 164 ms.
[2026-05-25 02:44:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:48] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:48] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 02:44:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:48] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-25 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2026-05-25 02:44:48] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:44:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2026-05-25 02:44:49] [INFO ] Added : 145 causal constraints over 30 iterations in 764 ms. Result :sat
Minimization took 136 ms.
[2026-05-25 02:44:49] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 02:44:49] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:49] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 02:44:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:50] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2026-05-25 02:44:50] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 02:44:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2026-05-25 02:44:50] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 02:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2026-05-25 02:44:50] [INFO ] Added : 107 causal constraints over 22 iterations in 441 ms. Result :sat
Minimization took 122 ms.
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 02:44:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-25 02:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2026-05-25 02:44:51] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:44:51] [INFO ] Added : 145 causal constraints over 29 iterations in 452 ms. Result :sat
Minimization took 133 ms.
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:51] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:52] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 02:44:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:52] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:52] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 02:44:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2026-05-25 02:44:52] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:44:52] [INFO ] Added : 114 causal constraints over 23 iterations in 316 ms. Result :sat
Minimization took 122 ms.
[2026-05-25 02:44:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:52] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 02:44:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 02:44:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2026-05-25 02:44:53] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:44:53] [INFO ] Added : 108 causal constraints over 22 iterations in 299 ms. Result :sat
Minimization took 129 ms.
[2026-05-25 02:44:53] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-25 02:44:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:53] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 02:44:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2026-05-25 02:44:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2026-05-25 02:44:54] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:44:54] [INFO ] Added : 118 causal constraints over 24 iterations in 493 ms. Result :sat
Minimization took 124 ms.
[2026-05-25 02:44:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 02:44:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:55] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-25 02:44:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 356 ms
[2026-05-25 02:44:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2026-05-25 02:44:56] [INFO ] Added : 136 causal constraints over 28 iterations in 581 ms. Result :sat
Minimization took 135 ms.
[2026-05-25 02:44:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:56] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 02:44:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:44:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:56] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-25 02:44:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-25 02:44:57] [INFO ] Added : 138 causal constraints over 29 iterations in 494 ms. Result :sat
Minimization took 135 ms.
[2026-05-25 02:44:57] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:57] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-25 02:44:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:44:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:44:57] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-25 02:44:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 02:44:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2026-05-25 02:44:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2026-05-25 02:44:58] [INFO ] Added : 145 causal constraints over 29 iterations in 576 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, 1, 1, +inf, 22, 1, 1]
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 22, 1, 1]
Support contains 10 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 156 transition count 119
Reduce places removed 27 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 129 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 123 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 70 place count 123 transition count 107
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 82 place count 117 transition count 107
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 128 place count 94 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 136 place count 90 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 90 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 89 transition count 83
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 148 place count 89 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 158 place count 79 transition count 73
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 171 place count 79 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 78 transition count 72
Applied a total of 172 rules in 67 ms. Remains 78 /163 variables (removed 85) and now considering 72/148 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 78/163 places, 72/148 transitions.
findPositiveTsemiflow completed in 383 ms - Found solution {0=1, 13=1, 14=1, 15=1, 31=1, 32=1, 40=1, 47=1, 67=1, 69=1} and attempted to minimize in 0 ms success -> {0=1, 13=1, 14=1, 15=1, 31=1, 32=1, 40=1, 47=1, 67=1, 69=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 22, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7785925780061506489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4636878983020099566.kers'
[2026-05-25 02:45:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7785925780061506489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4636878983020099566.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 72 rows 76 cols 306 entries
Finished phase 1 with 46 SingleSign rule and 17 generalized
[2026-05-25 02:45:09] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4636878983020099566.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (112990 resets) in 903 ms. (1106 steps per ms)
BEST_FIRST walk for 10000005 steps (777160 resets) in 5360 ms. (1865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
[2026-05-25 02:45:15] [INFO ] Invariant cache hit.
[2026-05-25 02:45:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:15] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 02:45:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 02:45:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 02:45:15] [INFO ] [Real]Added 6 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:15] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:15] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:45:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-25 02:45:16] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 3 ms.
[2026-05-25 02:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2026-05-25 02:45:16] [INFO ] Added : 23 causal constraints over 7 iterations in 166 ms. Result :sat
Minimization took 56 ms.
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Added 6 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:45:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:45:16] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 3 ms.
[2026-05-25 02:45:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2026-05-25 02:45:16] [INFO ] Added : 67 causal constraints over 14 iterations in 256 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:45:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2026-05-25 02:45:17] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 5 ms.
[2026-05-25 02:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2026-05-25 02:45:17] [INFO ] Added : 62 causal constraints over 13 iterations in 192 ms. Result :sat
Minimization took 56 ms.
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 16 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:17] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 11 ms.
[2026-05-25 02:45:17] [INFO ] Added : 60 causal constraints over 12 iterations in 121 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:17] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 4 ms.
[2026-05-25 02:45:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:45:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:17] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 4 ms.
[2026-05-25 02:45:17] [INFO ] Added : 57 causal constraints over 12 iterations in 102 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 15 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2026-05-25 02:45:18] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 5 ms.
[2026-05-25 02:45:18] [INFO ] Added : 39 causal constraints over 9 iterations in 75 ms. Result :sat
Minimization took 41 ms.
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Added 6 Read/Feed constraints in 17 ms returned sat
[2026-05-25 02:45:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:45:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 269 ms
[2026-05-25 02:45:18] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 3 ms.
[2026-05-25 02:45:18] [INFO ] Added : 49 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:18] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:45:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 221 ms
[2026-05-25 02:45:19] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 4 ms.
[2026-05-25 02:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-25 02:45:19] [INFO ] Added : 62 causal constraints over 13 iterations in 204 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 02:45:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:19] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 4 ms.
[2026-05-25 02:45:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:45:19] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:19] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 3 ms.
[2026-05-25 02:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2026-05-25 02:45:19] [INFO ] Added : 63 causal constraints over 14 iterations in 254 ms. Result :sat
Minimization took 75 ms.
[2026-05-25 02:45:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:45:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2026-05-25 02:45:20] [INFO ] Computed and/alt/rep : 68/293/68 causal constraints (skipped 3 transitions) in 5 ms.
[2026-05-25 02:45:20] [INFO ] Added : 63 causal constraints over 13 iterations in 144 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 78/78 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-25 02:45:20] [INFO ] Invariant cache hit.
[2026-05-25 02:45:20] [INFO ] Implicit Places using invariants in 104 ms returned [14, 23, 43, 48, 67, 75]
[2026-05-25 02:45:20] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 72/72 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 71
Applied a total of 2 rules in 6 ms. Remains 75 /76 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15705686617757609863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2528100227190515453.kers'
[2026-05-25 02:45:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15705686617757609863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2528100227190515453.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 71 rows 73 cols 288 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-25 02:45:20] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2528100227190515453.kers
Total runtime 0 ms.
[2026-05-25 02:45:20] [INFO ] Implicit Places using invariants in 97 ms returned [14, 23, 64, 72]
[2026-05-25 02:45:20] [INFO ] Actually due to overlaps returned [64, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 71/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 72 transition count 70
Applied a total of 3 rules in 7 ms. Remains 72 /73 variables (removed 1) and now considering 70/71 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17941490614931333370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3572946211712850371.kers'
[2026-05-25 02:45:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17941490614931333370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3572946211712850371.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 70 cols 277 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-25 02:45:20] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3572946211712850371.kers
Total runtime 1 ms.
[2026-05-25 02:45:21] [INFO ] Implicit Places using invariants in 59 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 71/78 places, 70/72 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 69
Applied a total of 2 rules in 6 ms. Remains 70 /71 variables (removed 1) and now considering 69/70 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3723837739877922503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12627582724585156751.kers'
[2026-05-25 02:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3723837739877922503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12627582724585156751.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 69 rows 68 cols 271 entries
Finished phase 1 with 57 SingleSign rule and 3 generalized
[2026-05-25 02:45:21] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12627582724585156751.kers
Total runtime 1 ms.
[2026-05-25 02:45:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 02:45:21] [INFO ] Invariant cache hit.
[2026-05-25 02:45:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:45:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 70/78 places, 69/72 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 489 ms. Remains : 70/78 places, 69/72 transitions.
findPositiveTsemiflow completed in 91 ms - Found solution {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1} and attempted to minimize in 0 ms success -> {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
[2026-05-25 02:45:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (125149 resets) in 706 ms. (1414 steps per ms)
BEST_FIRST walk for 10000003 steps (834026 resets) in 5006 ms. (1997 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
[2026-05-25 02:45:37] [INFO ] Invariant cache hit.
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:45:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:45:37] [INFO ] [Real]Added 5 Read/Feed constraints in 17 ms returned sat
[2026-05-25 02:45:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2026-05-25 02:45:37] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:45:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2026-05-25 02:45:37] [INFO ] Added : 27 causal constraints over 7 iterations in 329 ms. Result :sat
Minimization took 41 ms.
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Real]Added 5 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:45:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:45:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2026-05-25 02:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2026-05-25 02:45:37] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:38] [INFO ] Added : 67 causal constraints over 14 iterations in 210 ms. Result :sat
Minimization took 62 ms.
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Added 5 Read/Feed constraints in 6 ms returned sat
[2026-05-25 02:45:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2026-05-25 02:45:38] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:38] [INFO ] Added : 64 causal constraints over 13 iterations in 113 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2026-05-25 02:45:38] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2026-05-25 02:45:39] [INFO ] Added : 60 causal constraints over 12 iterations in 175 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:39] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:39] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:45:39] [INFO ] Added : 64 causal constraints over 13 iterations in 344 ms. Result :sat
Minimization took 89 ms.
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:45:39] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 2 ms.
[2026-05-25 02:45:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:45:39] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:39] [INFO ] Added : 60 causal constraints over 12 iterations in 142 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 02:45:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Real]Added 5 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:45:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:45:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 326 ms
[2026-05-25 02:45:40] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2026-05-25 02:45:41] [INFO ] Added : 63 causal constraints over 13 iterations in 591 ms. Result :sat
Minimization took 74 ms.
[2026-05-25 02:45:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:45:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:45:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2026-05-25 02:45:41] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 681 ms
[2026-05-25 02:45:42] [INFO ] Added : 63 causal constraints over 13 iterations in 808 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:42] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:45:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:45:42] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2026-05-25 02:45:42] [INFO ] Added : 62 causal constraints over 13 iterations in 164 ms. Result :sat
Minimization took 48 ms.
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:45:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:45:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:45:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2026-05-25 02:45:42] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:45:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2026-05-25 02:45:43] [INFO ] Added : 65 causal constraints over 13 iterations in 218 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, 1, +inf, 1, 1, 1]
Support contains 10 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/70 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-25 02:45:43] [INFO ] Invariant cache hit.
[2026-05-25 02:45:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 02:45:43] [INFO ] Invariant cache hit.
[2026-05-25 02:45:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:45:43] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2026-05-25 02:45:43] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-25 02:45:43] [INFO ] Invariant cache hit.
[2026-05-25 02:45:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 69/139 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 16 (OVERLAPS) 0/139 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 133 constraints, problems are : Problem set: 0 solved, 68 unsolved in 6908 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 69/139 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (OVERLAPS) 0/139 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/139 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 17 (OVERLAPS) 0/139 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 215 constraints, problems are : Problem set: 0 solved, 68 unsolved in 16257 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 23246ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 23253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23507 ms. Remains : 70/70 places, 69/69 transitions.
findPositiveTsemiflow completed in 91 ms - Found solution {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1} and attempted to minimize in 0 ms success -> {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1}
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
[2026-05-25 02:46:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (125212 resets) in 714 ms. (1398 steps per ms)
BEST_FIRST walk for 9000003 steps (750067 resets) in 4724 ms. (1904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
[2026-05-25 02:46:22] [INFO ] Invariant cache hit.
[2026-05-25 02:46:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:22] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:46:22] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:46:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:22] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:22] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:46:22] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2026-05-25 02:46:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2026-05-25 02:46:22] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:46:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 205 ms
[2026-05-25 02:46:22] [INFO ] Added : 27 causal constraints over 7 iterations in 306 ms. Result :sat
Minimization took 42 ms.
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Added 5 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:46:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2026-05-25 02:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-25 02:46:23] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 5 ms.
[2026-05-25 02:46:23] [INFO ] Added : 67 causal constraints over 14 iterations in 215 ms. Result :sat
Minimization took 63 ms.
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:46:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2026-05-25 02:46:23] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 5 ms.
[2026-05-25 02:46:23] [INFO ] Added : 64 causal constraints over 13 iterations in 125 ms. Result :sat
Minimization took 59 ms.
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 13 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2026-05-25 02:46:24] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 6 ms.
[2026-05-25 02:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2026-05-25 02:46:24] [INFO ] Added : 60 causal constraints over 12 iterations in 188 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:46:24] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:46:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:46:24] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:46:24] [INFO ] Added : 64 causal constraints over 13 iterations in 122 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Real]Added 5 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:46:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:46:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 278 ms
[2026-05-25 02:46:25] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 5 ms.
[2026-05-25 02:46:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 311 ms
[2026-05-25 02:46:25] [INFO ] Added : 63 causal constraints over 13 iterations in 563 ms. Result :sat
Minimization took 69 ms.
[2026-05-25 02:46:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:46:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 02:46:25] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2026-05-25 02:46:26] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 6 ms.
[2026-05-25 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 353 ms
[2026-05-25 02:46:26] [INFO ] Added : 63 causal constraints over 13 iterations in 481 ms. Result :sat
Minimization took 62 ms.
[2026-05-25 02:46:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:26] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:46:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:46:26] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:46:26] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-25 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 02:46:26] [INFO ] Added : 62 causal constraints over 13 iterations in 196 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 02:46:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 02:46:27] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2026-05-25 02:46:27] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 7 ms.
[2026-05-25 02:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2026-05-25 02:46:27] [INFO ] Added : 65 causal constraints over 13 iterations in 252 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
Support contains 9 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/70 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-25 02:46:27] [INFO ] Invariant cache hit.
[2026-05-25 02:46:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 02:46:27] [INFO ] Invariant cache hit.
[2026-05-25 02:46:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:46:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-25 02:46:28] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 70/70 places, 69/69 transitions.
findPositiveTsemiflow completed in 90 ms - Found solution {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1} and attempted to minimize in 0 ms success -> {0=1, 13=1, 14=1, 29=1, 34=1, 41=1, 60=1, 62=1, 65=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0, 0, 4, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 1, 1, 1]
[2026-05-25 02:46:38] [INFO ] Flatten gal took : 46 ms
[2026-05-25 02:46:38] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (5071 resets) in 1100 ms. (36 steps per ms) remains 14/14 properties
[2026-05-25 02:46:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4149080900289252421.gal : 11 ms
[2026-05-25 02:46:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7119984705476269500.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4149080900289252421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7119984705476269500.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7119984705476269500.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :15 after 23
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :23 after 43
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :43 after 96
BEST_FIRST walk for 40001 steps (3265 resets) in 403 ms. (99 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :96 after 476
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1229 after 1305
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2029 after 2060
BEST_FIRST walk for 40001 steps (3358 resets) in 216 ms. (184 steps per ms) remains 14/14 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5355 after 7217
BEST_FIRST walk for 40003 steps (3275 resets) in 254 ms. (156 steps per ms) remains 14/14 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :16985 after 20482
BEST_FIRST walk for 40001 steps (3302 resets) in 202 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3250 resets) in 199 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3356 resets) in 180 ms. (220 steps per ms) remains 14/14 properties
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :50047 after 50268
BEST_FIRST walk for 40000 steps (3347 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3354 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :65713 after 68832
BEST_FIRST walk for 40001 steps (3331 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3326 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3346 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3353 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :107472 after 110329
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :187673 after 195814
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :355013 after 355797
Interrupted probabilistic random walk after 527505 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :12 out of 14
Probabilistic random walk after 527505 steps, saw 263862 distinct states, run finished after 3005 ms. (steps per millisecond=175 ) properties seen :12
[2026-05-25 02:46:42] [INFO ] Invariant cache hit.
[2026-05-25 02:46:42] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/63 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 69/134 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/139 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/63 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 69/134 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/139 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/139 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/139 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/139 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/139 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :676164 after 679363
At refinement iteration 25 (OVERLAPS) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 251 ms.
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 69 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 68 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 64 transition count 63
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 62
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 63 transition count 62
Applied a total of 15 rules in 12 ms. Remains 63 /70 variables (removed 7) and now considering 62/69 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 63/70 places, 62/69 transitions.
RANDOM walk for 40000 steps (5016 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3318 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3301 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Probably explored full state space saw : 248263 states, properties seen :0
Probabilistic random walk after 496537 steps, saw 248263 distinct states, run finished after 2208 ms. (steps per millisecond=224 ) properties seen :0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,829116,9.38717,223664,2,9860,40,903773,8,0,354,919497,0
Total reachable state count : 829116
Verifying 14 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,9.38992,223664,1,0,40,903773,8,0,355,919497,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,23183,9.39101,223664,2,1620,40,903773,9,0,357,919497,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,392,9.39135,223664,2,335,40,903773,10,0,359,919497,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,392,9.39165,223664,2,335,40,903773,11,0,360,919497,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,119248,9.39258,223664,2,2825,40,903773,12,0,362,919497,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,256,9.39288,223664,2,176,40,903773,13,0,364,919497,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,256,9.39315,223664,2,176,40,903773,14,0,365,919497,0
Invariant property MIN5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,9.39546,223664,1,0,40,903773,14,0,365,919497,0
Reachability property MAX6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,864,9.39602,223664,2,564,40,903773,15,0,367,919497,0
Invariant property MIN6 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,864,9.39639,223664,2,564,40,903773,16,0,368,919497,0
Reachability property MAX7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,1,9.39663,223664,2,71,40,903773,17,0,370,919497,0
Invariant property MIN7 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,1,9.39684,223664,2,71,40,903773,18,0,371,919497,0
Reachability property MAX8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,392,9.39702,223664,2,335,40,903773,19,0,373,919497,0
Invariant property MIN8 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,392,9.3972,223664,2,335,40,903773,20,0,374,919497,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 612029 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Exhaustive walk after 612029 steps, saw 306142 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
FORMULA DoubleExponent-PT-003-UpperBounds-00 4 TECHNIQUES REACHABILITY_MIN
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-10 4 TECHNIQUES REACHABILITY_MIN
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
[2026-05-25 02:46:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (125193 resets) in 640 ms. (1560 steps per ms)
BEST_FIRST walk for 2000000 steps (166494 resets) in 961 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
[2026-05-25 02:46:52] [INFO ] Invariant cache hit.
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:46:52] [INFO ] [Real]Added 5 Read/Feed constraints in 12 ms returned sat
[2026-05-25 02:46:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2026-05-25 02:46:52] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2026-05-25 02:46:52] [INFO ] Added : 67 causal constraints over 17 iterations in 319 ms. Result :sat
Minimization took 76 ms.
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:46:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:46:52] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2026-05-25 02:46:52] [INFO ] Computed and/alt/rep : 67/290/67 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2026-05-25 02:46:53] [INFO ] Added : 66 causal constraints over 14 iterations in 266 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 69/69 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 69 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 68 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 68 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 67 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 63 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 62 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 61 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 61 transition count 61
Applied a total of 19 rules in 14 ms. Remains 61 /70 variables (removed 9) and now considering 61/69 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 61/70 places, 61/69 transitions.
findPositiveTsemiflow completed in 307 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8936362137517199811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15231956390573414055.kers'
[2026-05-25 02:47:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8936362137517199811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15231956390573414055.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 61 rows 59 cols 266 entries
Finished phase 1 with 46 SingleSign rule and 5 generalized
[2026-05-25 02:47:03] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15231956390573414055.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156143 resets) in 700 ms. (1426 steps per ms)
BEST_FIRST walk for 2000001 steps (191819 resets) in 907 ms. (2202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
[2026-05-25 02:47:05] [INFO ] Invariant cache hit.
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:47:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:05] [INFO ] [Real]Added 10 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:47:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:47:05] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:47:05] [INFO ] Added : 51 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 58 ms.
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Real]Added 10 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:47:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:47:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:47:05] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:47:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 186 ms
[2026-05-25 02:47:06] [INFO ] Added : 55 causal constraints over 12 iterations in 353 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:47:06] [INFO ] Invariant cache hit.
[2026-05-25 02:47:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 02:47:06] [INFO ] Invariant cache hit.
[2026-05-25 02:47:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:06] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2026-05-25 02:47:06] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-25 02:47:06] [INFO ] Invariant cache hit.
[2026-05-25 02:47:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 81 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4600 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5685ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5881 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 313 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
[2026-05-25 02:47:22] [INFO ] Flatten gal took : 17 ms
[2026-05-25 02:47:22] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:47:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2471550752860858413.gal : 2 ms
[2026-05-25 02:47:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality689678422798749488.prop : 0 ms
RANDOM walk for 40000 steps (6226 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2471550752860858413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality689678422798749488.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality689678422798749488.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
BEST_FIRST walk for 40001 steps (3794 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
BEST_FIRST walk for 40001 steps (3879 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
Finished probabilistic random walk after 1538 steps, run visited all 2 properties in 13 ms. (steps per millisecond=118 )
Probabilistic random walk after 1538 steps, saw 792 distinct states, run finished after 16 ms. (steps per millisecond=96 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
[2026-05-25 02:47:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156200 resets) in 654 ms. (1526 steps per ms)
BEST_FIRST walk for 2000001 steps (192365 resets) in 915 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
[2026-05-25 02:47:24] [INFO ] Invariant cache hit.
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:47:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:24] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:47:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:47:24] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:47:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2026-05-25 02:47:24] [INFO ] Added : 50 causal constraints over 11 iterations in 321 ms. Result :sat
Minimization took 44 ms.
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Real]Added 10 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:47:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:47:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:47:24] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2026-05-25 02:47:24] [INFO ] Added : 56 causal constraints over 13 iterations in 243 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:47:25] [INFO ] Invariant cache hit.
[2026-05-25 02:47:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 02:47:25] [INFO ] Invariant cache hit.
[2026-05-25 02:47:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:25] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2026-05-25 02:47:25] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 310 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
[2026-05-25 02:47:35] [INFO ] Flatten gal took : 22 ms
[2026-05-25 02:47:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 02:47:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14729480995908326234.gal : 5 ms
[2026-05-25 02:47:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10122527068696047441.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14729480995908326234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10122527068696047441.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6265 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10122527068696047441.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
BEST_FIRST walk for 40002 steps (3818 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40001 steps (3881 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1693 steps, run visited all 2 properties in 14 ms. (steps per millisecond=120 )
Probabilistic random walk after 1693 steps, saw 870 distinct states, run finished after 14 ms. (steps per millisecond=120 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
[2026-05-25 02:47:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156393 resets) in 639 ms. (1562 steps per ms)
BEST_FIRST walk for 2000000 steps (192096 resets) in 903 ms. (2212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
[2026-05-25 02:47:37] [INFO ] Invariant cache hit.
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:47:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:37] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:47:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:47:37] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:47:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2026-05-25 02:47:37] [INFO ] Added : 49 causal constraints over 10 iterations in 240 ms. Result :sat
Minimization took 39 ms.
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Real]Added 10 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:47:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:47:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:47:37] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:47:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2026-05-25 02:47:38] [INFO ] Added : 51 causal constraints over 11 iterations in 357 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:47:38] [INFO ] Invariant cache hit.
[2026-05-25 02:47:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:47:38] [INFO ] Invariant cache hit.
[2026-05-25 02:47:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:38] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2026-05-25 02:47:38] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 308 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
[2026-05-25 02:47:48] [INFO ] Flatten gal took : 19 ms
RANDOM walk for 40000 steps (6328 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2026-05-25 02:47:48] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:47:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16992765138925392404.gal : 2 ms
[2026-05-25 02:47:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8999467574956751827.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16992765138925392404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8999467574956751827.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8999467574956751827.prop.
BEST_FIRST walk for 40000 steps (3890 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
BEST_FIRST walk for 40000 steps (3861 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
Finished probabilistic random walk after 2086 steps, run visited all 2 properties in 15 ms. (steps per millisecond=139 )
Probabilistic random walk after 2086 steps, saw 1067 distinct states, run finished after 15 ms. (steps per millisecond=139 ) properties seen :2
ITS runner timed out or was interrupted.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2026-05-25 02:47:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156157 resets) in 674 ms. (1481 steps per ms)
BEST_FIRST walk for 2000001 steps (191740 resets) in 979 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2026-05-25 02:47:50] [INFO ] Invariant cache hit.
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:47:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:50] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:47:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:47:50] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:47:50] [INFO ] Added : 55 causal constraints over 13 iterations in 160 ms. Result :sat
Minimization took 58 ms.
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Real]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:47:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:47:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:47:50] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:47:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 313 ms
[2026-05-25 02:47:51] [INFO ] Added : 56 causal constraints over 13 iterations in 534 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:47:51] [INFO ] Invariant cache hit.
[2026-05-25 02:47:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:47:51] [INFO ] Invariant cache hit.
[2026-05-25 02:47:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:47:51] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2026-05-25 02:47:51] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 315 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 1 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2026-05-25 02:48:02] [INFO ] Flatten gal took : 12 ms
[2026-05-25 02:48:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:48:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16952470119026510997.gal : 6 ms
[2026-05-25 02:48:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16537502028260093067.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16952470119026510997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16537502028260093067.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16537502028260093067.prop.
RANDOM walk for 40000 steps (6249 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
BEST_FIRST walk for 40001 steps (3905 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40003 steps (3824 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,10366,0.062769,6672,2,2678,17,11854,6,0,308,9318,0
Total reachable state count : 10366
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,16,0.06324,6760,2,192,17,11854,7,0,311,9318,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,680,0.06376,6936,2,895,17,11854,8,0,313,9318,0
Finished probabilistic random walk after 2957 steps, run visited all 2 properties in 23 ms. (steps per millisecond=128 )
Probabilistic random walk after 2957 steps, saw 1503 distinct states, run finished after 23 ms. (steps per millisecond=128 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
[2026-05-25 02:48:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156036 resets) in 629 ms. (1587 steps per ms)
BEST_FIRST walk for 2000001 steps (192276 resets) in 894 ms. (2234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
[2026-05-25 02:48:03] [INFO ] Invariant cache hit.
[2026-05-25 02:48:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:03] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:48:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:03] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:48:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:48:03] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:48:03] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:48:04] [INFO ] Added : 56 causal constraints over 12 iterations in 180 ms. Result :sat
Minimization took 72 ms.
[2026-05-25 02:48:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Real]Added 10 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:48:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2026-05-25 02:48:04] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:48:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 361 ms
[2026-05-25 02:48:04] [INFO ] Added : 52 causal constraints over 12 iterations in 493 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:48:04] [INFO ] Invariant cache hit.
[2026-05-25 02:48:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 02:48:04] [INFO ] Invariant cache hit.
[2026-05-25 02:48:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:05] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-25 02:48:05] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 311 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 5] Max Struct:[+inf, +inf]
RANDOM walk for 40000 steps (6226 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2026-05-25 02:48:15] [INFO ] Flatten gal took : 24 ms
[2026-05-25 02:48:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:48:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11027916931910672232.gal : 1 ms
[2026-05-25 02:48:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17610602305732614462.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11027916931910672232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17610602305732614462.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17610602305732614462.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40002 steps (3807 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,10366,0.061869,6672,2,2678,17,11854,6,0,308,9318,0
Total reachable state count : 10366
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3,0.062282,6744,2,98,17,11854,7,0,311,9318,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,680,0.062832,6936,2,895,17,11854,8,0,313,9318,0
BEST_FIRST walk for 40002 steps (3879 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 4332 steps, run visited all 2 properties in 34 ms. (steps per millisecond=127 )
Probabilistic random walk after 4332 steps, saw 2191 distinct states, run finished after 34 ms. (steps per millisecond=127 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
[2026-05-25 02:48:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156380 resets) in 636 ms. (1569 steps per ms)
BEST_FIRST walk for 2000000 steps (192144 resets) in 906 ms. (2205 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
[2026-05-25 02:48:17] [INFO ] Invariant cache hit.
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:17] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:48:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:48:17] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:17] [INFO ] Added : 50 causal constraints over 12 iterations in 128 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Real]Added 10 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:48:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:48:17] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
[2026-05-25 02:48:17] [INFO ] Added : 54 causal constraints over 12 iterations in 400 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:48:18] [INFO ] Invariant cache hit.
[2026-05-25 02:48:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 02:48:18] [INFO ] Invariant cache hit.
[2026-05-25 02:48:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:18] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-25 02:48:18] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 307 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 6] Max Struct:[+inf, +inf]
RANDOM walk for 40000 steps (6278 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2026-05-25 02:48:28] [INFO ] Flatten gal took : 19 ms
[2026-05-25 02:48:28] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:48:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13135095193821531907.gal : 1 ms
[2026-05-25 02:48:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5608339693408916868.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13135095193821531907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5608339693408916868.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5608339693408916868.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40002 steps (3855 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
BEST_FIRST walk for 40001 steps (3779 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.099178,8020,2,3614,19,17661,6,0,308,15113,0
Total reachable state count : 37490
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,286,0.099815,8140,2,644,19,17661,7,0,311,15113,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,2321,0.100495,8284,2,1226,19,17661,8,0,313,15113,0
Finished probabilistic random walk after 6283 steps, run visited all 2 properties in 49 ms. (steps per millisecond=128 )
Probabilistic random walk after 6283 steps, saw 3167 distinct states, run finished after 49 ms. (steps per millisecond=128 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
[2026-05-25 02:48:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156332 resets) in 643 ms. (1552 steps per ms)
BEST_FIRST walk for 2000002 steps (192134 resets) in 928 ms. (2152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
[2026-05-25 02:48:30] [INFO ] Invariant cache hit.
[2026-05-25 02:48:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:30] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:48:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:48:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:30] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:48:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:48:30] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:48:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:48:30] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 390 ms
[2026-05-25 02:48:30] [INFO ] Added : 54 causal constraints over 11 iterations in 542 ms. Result :sat
Minimization took 62 ms.
[2026-05-25 02:48:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Real]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:48:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 02:48:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:48:31] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 4 ms.
[2026-05-25 02:48:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 449 ms
[2026-05-25 02:48:31] [INFO ] Added : 55 causal constraints over 14 iterations in 687 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:48:31] [INFO ] Invariant cache hit.
[2026-05-25 02:48:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 02:48:31] [INFO ] Invariant cache hit.
[2026-05-25 02:48:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2026-05-25 02:48:32] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 308 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[7, 7] Max Struct:[+inf, +inf]
[2026-05-25 02:48:42] [INFO ] Flatten gal took : 19 ms
[2026-05-25 02:48:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:48:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17188131151516632083.gal : 1 ms
[2026-05-25 02:48:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9850888576699170401.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17188131151516632083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9850888576699170401.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6194 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9850888576699170401.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
BEST_FIRST walk for 40002 steps (3901 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40000 steps (3793 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.180294,7976,2,3614,19,17661,6,0,308,15113,0
Total reachable state count : 37490
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,250,0.180859,8112,2,634,19,17661,7,0,311,15113,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1813,0.181394,8240,2,1157,19,17661,8,0,313,15113,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 8940 steps, run visited all 2 properties in 74 ms. (steps per millisecond=120 )
Probabilistic random walk after 8940 steps, saw 4496 distinct states, run finished after 74 ms. (steps per millisecond=120 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
[2026-05-25 02:48:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156641 resets) in 650 ms. (1536 steps per ms)
BEST_FIRST walk for 2000000 steps (192018 resets) in 921 ms. (2169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
[2026-05-25 02:48:44] [INFO ] Invariant cache hit.
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:44] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:48:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:48:44] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-25 02:48:44] [INFO ] Added : 51 causal constraints over 11 iterations in 182 ms. Result :sat
Minimization took 73 ms.
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Real]Added 10 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:48:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:48:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:48:44] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:48:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 557 ms
[2026-05-25 02:48:45] [INFO ] Added : 53 causal constraints over 11 iterations in 680 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:48:45] [INFO ] Invariant cache hit.
[2026-05-25 02:48:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 02:48:45] [INFO ] Invariant cache hit.
[2026-05-25 02:48:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:45] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2026-05-25 02:48:45] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 316 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 8] Max Struct:[+inf, +inf]
[2026-05-25 02:48:56] [INFO ] Flatten gal took : 23 ms
[2026-05-25 02:48:56] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16870485567689056858.gal : 1 ms
[2026-05-25 02:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4021891768964100508.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16870485567689056858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4021891768964100508.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4021891768964100508.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
RANDOM walk for 40000 steps (6199 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40001 steps (3801 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
BEST_FIRST walk for 40001 steps (3846 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.112977,8000,2,3614,19,17661,6,0,308,15113,0
Total reachable state count : 37490
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,237,0.113658,8116,2,629,19,17661,7,0,311,15113,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1318,0.114313,8264,2,1038,19,17661,8,0,313,15113,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 10842 steps, run visited all 2 properties in 61 ms. (steps per millisecond=177 )
Probabilistic random walk after 10842 steps, saw 5433 distinct states, run finished after 61 ms. (steps per millisecond=177 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
[2026-05-25 02:48:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156069 resets) in 653 ms. (1529 steps per ms)
BEST_FIRST walk for 2000001 steps (191624 resets) in 927 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
[2026-05-25 02:48:57] [INFO ] Invariant cache hit.
[2026-05-25 02:48:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:57] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:48:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:58] [INFO ] [Real]Added 10 Read/Feed constraints in 20 ms returned sat
[2026-05-25 02:48:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:48:58] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 340 ms
[2026-05-25 02:48:58] [INFO ] Added : 54 causal constraints over 11 iterations in 495 ms. Result :sat
Minimization took 66 ms.
[2026-05-25 02:48:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Real]Added 10 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:48:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:48:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:48:58] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 02:48:58] [INFO ] Added : 54 causal constraints over 11 iterations in 205 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:48:59] [INFO ] Invariant cache hit.
[2026-05-25 02:48:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 02:48:59] [INFO ] Invariant cache hit.
[2026-05-25 02:48:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:48:59] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2026-05-25 02:48:59] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 325 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 9] Max Struct:[+inf, +inf]
[2026-05-25 02:49:09] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:49:09] [INFO ] Flatten gal took : 16 ms
[2026-05-25 02:49:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3531049512999471285.gal : 1 ms
[2026-05-25 02:49:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12356312811584314153.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3531049512999471285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12356312811584314153.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6298 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12356312811584314153.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
BEST_FIRST walk for 40003 steps (3846 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40001 steps (3795 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Finished probabilistic random walk after 15509 steps, run visited all 2 properties in 62 ms. (steps per millisecond=250 )
Probabilistic random walk after 15509 steps, saw 7767 distinct states, run finished after 62 ms. (steps per millisecond=250 ) properties seen :2
ITS runner timed out or was interrupted.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.107197,8012,2,3614,19,17661,6,0,308,15113,0
Total reachable state count : 37490
Verifying 2 reachability properties.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
[2026-05-25 02:49:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156063 resets) in 639 ms. (1562 steps per ms)
BEST_FIRST walk for 2000002 steps (192312 resets) in 910 ms. (2195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
[2026-05-25 02:49:11] [INFO ] Invariant cache hit.
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:49:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:11] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:49:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:49:11] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2026-05-25 02:49:11] [INFO ] Added : 51 causal constraints over 11 iterations in 194 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Real]Added 10 Read/Feed constraints in 13 ms returned sat
[2026-05-25 02:49:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:49:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:49:11] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 603 ms
[2026-05-25 02:49:12] [INFO ] Added : 54 causal constraints over 12 iterations in 748 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:49:12] [INFO ] Invariant cache hit.
[2026-05-25 02:49:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 02:49:12] [INFO ] Invariant cache hit.
[2026-05-25 02:49:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2026-05-25 02:49:12] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 313 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
[2026-05-25 02:49:23] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:49:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:49:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality467091924467853721.gal : 1 ms
[2026-05-25 02:49:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12083265082847346809.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality467091924467853721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12083265082847346809.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6246 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality12083265082847346809.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
BEST_FIRST walk for 40002 steps (3811 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
BEST_FIRST walk for 40002 steps (3855 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
Finished probabilistic random walk after 21266 steps, run visited all 2 properties in 102 ms. (steps per millisecond=208 )
Probabilistic random walk after 21266 steps, saw 10646 distinct states, run finished after 103 ms. (steps per millisecond=206 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
[2026-05-25 02:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156405 resets) in 636 ms. (1569 steps per ms)
BEST_FIRST walk for 2000001 steps (191898 resets) in 909 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
[2026-05-25 02:49:25] [INFO ] Invariant cache hit.
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:49:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:25] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:49:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:49:25] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:49:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 230 ms
[2026-05-25 02:49:25] [INFO ] Added : 54 causal constraints over 11 iterations in 381 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:49:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:49:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:49:25] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2026-05-25 02:49:25] [INFO ] Added : 47 causal constraints over 10 iterations in 251 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:49:26] [INFO ] Invariant cache hit.
[2026-05-25 02:49:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 02:49:26] [INFO ] Invariant cache hit.
[2026-05-25 02:49:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-25 02:49:26] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 308 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[11, 11] Max Struct:[+inf, +inf]
[2026-05-25 02:49:36] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:49:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:49:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6841170762465325336.gal : 0 ms
[2026-05-25 02:49:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1313841757820768178.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6841170762465325336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1313841757820768178.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1313841757820768178.prop.
RANDOM walk for 40000 steps (6254 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40002 steps (3867 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
BEST_FIRST walk for 40003 steps (3774 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.102132,8008,2,3614,19,17660,6,0,308,15112,0
Total reachable state count : 37490
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,16,0.102762,8144,2,192,19,17660,7,0,311,15112,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,428,0.103791,8272,2,823,19,17660,8,0,313,15112,0
Finished probabilistic random walk after 28243 steps, run visited all 2 properties in 136 ms. (steps per millisecond=207 )
Probabilistic random walk after 28243 steps, saw 14135 distinct states, run finished after 136 ms. (steps per millisecond=207 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
[2026-05-25 02:49:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156383 resets) in 661 ms. (1510 steps per ms)
BEST_FIRST walk for 2000000 steps (192072 resets) in 911 ms. (2192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
[2026-05-25 02:49:38] [INFO ] Invariant cache hit.
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:49:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:38] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:49:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:49:38] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2026-05-25 02:49:38] [INFO ] Added : 51 causal constraints over 11 iterations in 186 ms. Result :sat
Minimization took 40 ms.
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Real]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:49:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:49:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:49:38] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2026-05-25 02:49:39] [INFO ] Added : 52 causal constraints over 11 iterations in 248 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:49:39] [INFO ] Invariant cache hit.
[2026-05-25 02:49:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 02:49:39] [INFO ] Invariant cache hit.
[2026-05-25 02:49:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:39] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-25 02:49:39] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 318 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[12, 12] Max Struct:[+inf, +inf]
[2026-05-25 02:49:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:49:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:49:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13222790120619954955.gal : 1 ms
[2026-05-25 02:49:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7663590618417319314.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13222790120619954955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7663590618417319314.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7663590618417319314.prop.
RANDOM walk for 40000 steps (6352 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40001 steps (3824 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
BEST_FIRST walk for 40001 steps (3844 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37490,0.107763,8032,2,3614,19,17660,6,0,308,15112,0
Total reachable state count : 37490
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3,0.108277,8148,2,98,19,17660,7,0,311,15112,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,190,0.108729,8296,2,573,19,17660,8,0,313,15112,0
Finished probabilistic random walk after 36784 steps, run visited all 2 properties in 168 ms. (steps per millisecond=218 )
Probabilistic random walk after 36784 steps, saw 18406 distinct states, run finished after 168 ms. (steps per millisecond=218 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
[2026-05-25 02:49:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156291 resets) in 648 ms. (1540 steps per ms)
BEST_FIRST walk for 2000000 steps (192124 resets) in 899 ms. (2222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
[2026-05-25 02:49:51] [INFO ] Invariant cache hit.
[2026-05-25 02:49:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:49:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:51] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-25 02:49:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:49:51] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:51] [INFO ] Added : 51 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 02:49:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:49:51] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:49:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:49:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:49:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:49:52] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:49:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:49:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:49:52] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:49:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 825 ms
[2026-05-25 02:49:53] [INFO ] Added : 55 causal constraints over 13 iterations in 980 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:49:53] [INFO ] Invariant cache hit.
[2026-05-25 02:49:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 02:49:53] [INFO ] Invariant cache hit.
[2026-05-25 02:49:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:49:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2026-05-25 02:49:53] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 316 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 13] Max Struct:[+inf, +inf]
[2026-05-25 02:50:03] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:50:03] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:50:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10791768110892901936.gal : 1 ms
[2026-05-25 02:50:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18029103608688710595.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10791768110892901936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18029103608688710595.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6228 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18029103608688710595.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
BEST_FIRST walk for 40002 steps (3871 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40003 steps (3912 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :36710 after 37490
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,57710,0.196286,11188,2,4200,21,31474,6,0,308,28240,0
Total reachable state count : 57710
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,52,0.196874,11284,2,335,21,31474,7,0,311,28240,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,144,0.197275,11412,2,414,21,31474,8,0,313,28240,0
Finished probabilistic random walk after 46915 steps, run visited all 2 properties in 157 ms. (steps per millisecond=298 )
Probabilistic random walk after 46915 steps, saw 23472 distinct states, run finished after 157 ms. (steps per millisecond=298 ) properties seen :2
ITS runner timed out or was interrupted.
Current structural bounds on expressions (after reachability check) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
[2026-05-25 02:50:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156379 resets) in 638 ms. (1564 steps per ms)
BEST_FIRST walk for 2000001 steps (191978 resets) in 901 ms. (2217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
[2026-05-25 02:50:05] [INFO ] Invariant cache hit.
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:50:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:05] [INFO ] [Real]Added 10 Read/Feed constraints in 12 ms returned sat
[2026-05-25 02:50:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:50:05] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2026-05-25 02:50:05] [INFO ] Added : 51 causal constraints over 11 iterations in 188 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Real]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:50:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:50:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:50:05] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:50:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2026-05-25 02:50:06] [INFO ] Added : 54 causal constraints over 12 iterations in 345 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:50:06] [INFO ] Invariant cache hit.
[2026-05-25 02:50:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:50:06] [INFO ] Invariant cache hit.
[2026-05-25 02:50:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:06] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2026-05-25 02:50:06] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 309 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 14] Max Struct:[+inf, +inf]
[2026-05-25 02:50:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 02:50:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:50:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17175192756800312121.gal : 0 ms
[2026-05-25 02:50:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15687076667132170955.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17175192756800312121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15687076667132170955.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6265 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15687076667132170955.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
BEST_FIRST walk for 40001 steps (3837 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40001 steps (3829 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :36710 after 37490
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,57710,0.204476,11176,2,4200,21,31474,6,0,308,28240,0
Total reachable state count : 57710
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,16,0.205056,11268,2,192,21,31474,7,0,311,28240,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,38,0.205447,11396,2,229,21,31474,8,0,313,28240,0
Finished probabilistic random walk after 58708 steps, run visited all 2 properties in 301 ms. (steps per millisecond=195 )
Probabilistic random walk after 58708 steps, saw 29369 distinct states, run finished after 301 ms. (steps per millisecond=195 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
[2026-05-25 02:50:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156025 resets) in 656 ms. (1522 steps per ms)
BEST_FIRST walk for 2000001 steps (192098 resets) in 918 ms. (2176 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
[2026-05-25 02:50:18] [INFO ] Invariant cache hit.
[2026-05-25 02:50:18] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-25 02:50:18] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:50:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:19] [INFO ] [Real]Added 10 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:50:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:50:19] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:50:19] [INFO ] Added : 51 causal constraints over 11 iterations in 132 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 02:50:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 02:50:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:50:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2026-05-25 02:50:19] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:50:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 278 ms
[2026-05-25 02:50:19] [INFO ] Added : 53 causal constraints over 13 iterations in 461 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:50:19] [INFO ] Invariant cache hit.
[2026-05-25 02:50:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 02:50:20] [INFO ] Invariant cache hit.
[2026-05-25 02:50:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:20] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-25 02:50:20] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 329 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 15] Max Struct:[+inf, +inf]
[2026-05-25 02:50:30] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:50:30] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:50:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1378998890782834929.gal : 0 ms
[2026-05-25 02:50:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8378701375444710615.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1378998890782834929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8378701375444710615.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8378701375444710615.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
RANDOM walk for 40000 steps (6270 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
SDD size :100 after 286
BEST_FIRST walk for 40001 steps (3815 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
BEST_FIRST walk for 40002 steps (3853 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10105 after 10366
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :36710 after 37490
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,57710,0.24104,11184,2,4200,21,31474,6,0,308,28240,0
Total reachable state count : 57710
Verifying 2 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3,0.241588,11320,2,98,21,31474,7,0,311,28240,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,2,0.241963,11404,2,65,21,31474,8,0,313,28240,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 72293 steps, run visited all 2 properties in 389 ms. (steps per millisecond=185 )
Probabilistic random walk after 72293 steps, saw 36162 distinct states, run finished after 390 ms. (steps per millisecond=185 ) properties seen :2
Current structural bounds on expressions (after reachability check) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
[2026-05-25 02:50:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (156355 resets) in 647 ms. (1543 steps per ms)
BEST_FIRST walk for 2000001 steps (192033 resets) in 914 ms. (2185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
[2026-05-25 02:50:32] [INFO ] Invariant cache hit.
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:50:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:32] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:50:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-25 02:50:32] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-25 02:50:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2026-05-25 02:50:32] [INFO ] Added : 51 causal constraints over 11 iterations in 171 ms. Result :sat
Minimization took 39 ms.
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:50:33] [INFO ] [Real]Added 10 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:50:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:50:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 02:50:33] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:50:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:50:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:50:33] [INFO ] Computed and/alt/rep : 56/307/56 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-25 02:50:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2026-05-25 02:50:33] [INFO ] Added : 56 causal constraints over 12 iterations in 323 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:50:33] [INFO ] Invariant cache hit.
[2026-05-25 02:50:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 02:50:33] [INFO ] Invariant cache hit.
[2026-05-25 02:50:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:50:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-25 02:50:33] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 61/61 places, 61/61 transitions.
findPositiveTsemiflow completed in 322 ms - Found solution {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1} and attempted to minimize in 0 ms success -> {6=1, 7=1, 16=1, 22=1, 37=1, 39=1, 42=1, 55=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 16] Max Struct:[+inf, +inf]
[2026-05-25 02:50:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:50:44] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:50:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14826373329863982394.gal : 1 ms
[2026-05-25 02:50:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14645621279328815543.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14826373329863982394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14645621279328815543.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6239 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3857 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14645621279328815543.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 100
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :100 after 286
BEST_FIRST walk for 40002 steps (3755 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :286 after 838
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10105 after 10366
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :46467 after 47052
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :92337 after 95298
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :190516 after 192674
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :391359 after 392391
Interrupted probabilistic random walk after 506735 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 506735 steps, saw 253514 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-25 02:50:47] [INFO ] Invariant cache hit.
[2026-05-25 02:50:47] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/56 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 61/117 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/122 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 81 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 61/117 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,751266,5.2185,101160,2,6038,24,447324,8,0,310,405416,0
Total reachable state count : 751266
Verifying 2 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,5.21917,101160,1,0,24,447324,8,0,311,405416,0
Invariant property MIN1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,5.21941,101160,1,0,24,447324,8,0,311,405416,0
After SMT solving in domain Int declared 117/122 variables, and 85 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2219ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DoubleExponent-PT-003-UpperBounds-01 16 TECHNIQUES REACHABILITY_MIN
FORMULA DoubleExponent-PT-003-UpperBounds-05 16 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 02:50:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (156429 resets) in 622 ms. (1605 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 364683 ms.
BK_STOP 1779677450075
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;