About the Execution of ITS-Tools for CANInsertWithFailure-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6122.596 | 2800814.00 | 3292230.00 | 13009.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 9 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.r034-tall-177946842100709.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 CANInsertWithFailure-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100709
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.2K Mar 6 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 6 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 6 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 698K 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 CANInsertWithFailure-PT-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779663610991
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 23:00:12] [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-24 23:00:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 23:00:12] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-05-24 23:00:12] [INFO ] Transformed 324 places.
[2026-05-24 23:00:12] [INFO ] Transformed 660 transitions.
[2026-05-24 23:00:12] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 209 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, 1, 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, 1, 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-5671772914181073505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8689528935415098693.kers'
[2026-05-24 23:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5671772914181073505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8689528935415098693.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 23:00:12] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8689528935415098693.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 10, 1, 10, 10, 1, 10, 10, 10, 10, 1, 10, 1]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (45 resets) in 53 ms. (185 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (62 resets) in 124 ms. (960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2026-05-24 23:00:12] [INFO ] Invariant cache hit.
[2026-05-24 23:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-24 23:00:12] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:12] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-05-24 23:00:13] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:00:13] [INFO ] [Real]Added 190 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:00:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-24 23:00:13] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:13] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2026-05-24 23:00:13] [INFO ] [Nat]Added 190 Read/Feed constraints in 74 ms returned sat
[2026-05-24 23:00:13] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 34 ms.
[2026-05-24 23:00:13] [INFO ] Added : 46 causal constraints over 10 iterations in 496 ms. Result :sat
Minimization took 353 ms.
[2026-05-24 23:00:14] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned unsat
[2026-05-24 23:00:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Real]Added 190 Read/Feed constraints in 23 ms returned sat
[2026-05-24 23:00:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-24 23:00:14] [INFO ] [Nat]Added 190 Read/Feed constraints in 85 ms returned sat
[2026-05-24 23:00:14] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 32 ms.
[2026-05-24 23:00:15] [INFO ] Added : 41 causal constraints over 9 iterations in 367 ms. Result :sat
Minimization took 390 ms.
[2026-05-24 23:00:15] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:15] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:15] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-24 23:00:15] [INFO ] [Real]Added 190 Read/Feed constraints in 26 ms returned sat
[2026-05-24 23:00:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:15] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:16] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-24 23:00:16] [INFO ] [Nat]Added 190 Read/Feed constraints in 61 ms returned sat
[2026-05-24 23:00:16] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 30 ms.
[2026-05-24 23:00:16] [INFO ] Added : 54 causal constraints over 11 iterations in 440 ms. Result :sat
Minimization took 404 ms.
[2026-05-24 23:00:17] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Real]Added 190 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:00:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-24 23:00:17] [INFO ] [Nat]Added 190 Read/Feed constraints in 80 ms returned sat
[2026-05-24 23:00:17] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 30 ms.
[2026-05-24 23:00:18] [INFO ] Added : 55 causal constraints over 11 iterations in 392 ms. Result :sat
Minimization took 348 ms.
[2026-05-24 23:00:18] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Real]Added 190 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:00:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-24 23:00:18] [INFO ] [Nat]Added 190 Read/Feed constraints in 52 ms returned sat
[2026-05-24 23:00:18] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 33 ms.
[2026-05-24 23:00:19] [INFO ] Added : 39 causal constraints over 8 iterations in 314 ms. Result :sat
Minimization took 431 ms.
[2026-05-24 23:00:19] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:19] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:19] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-24 23:00:19] [INFO ] [Real]Added 190 Read/Feed constraints in 26 ms returned sat
[2026-05-24 23:00:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:19] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:20] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-05-24 23:00:20] [INFO ] [Nat]Added 190 Read/Feed constraints in 52 ms returned sat
[2026-05-24 23:00:20] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 28 ms.
[2026-05-24 23:00:20] [INFO ] Added : 46 causal constraints over 10 iterations in 342 ms. Result :sat
Minimization took 359 ms.
[2026-05-24 23:00:20] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:20] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:21] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-24 23:00:21] [INFO ] [Real]Added 190 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:00:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:21] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:21] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2026-05-24 23:00:21] [INFO ] [Nat]Added 190 Read/Feed constraints in 69 ms returned sat
[2026-05-24 23:00:21] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2026-05-24 23:00:21] [INFO ] Added : 40 causal constraints over 8 iterations in 330 ms. Result :sat
Minimization took 409 ms.
[2026-05-24 23:00:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Real]Added 190 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:00:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-24 23:00:22] [INFO ] [Nat]Added 190 Read/Feed constraints in 81 ms returned sat
[2026-05-24 23:00:22] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 38 ms.
[2026-05-24 23:00:23] [INFO ] Added : 54 causal constraints over 11 iterations in 449 ms. Result :sat
Minimization took 384 ms.
[2026-05-24 23:00:23] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:23] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:23] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-24 23:00:23] [INFO ] [Real]Added 190 Read/Feed constraints in 23 ms returned sat
[2026-05-24 23:00:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:23] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:24] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-24 23:00:24] [INFO ] [Nat]Added 190 Read/Feed constraints in 48 ms returned sat
[2026-05-24 23:00:24] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 31 ms.
[2026-05-24 23:00:24] [INFO ] Added : 29 causal constraints over 6 iterations in 271 ms. Result :sat
Minimization took 382 ms.
[2026-05-24 23:00:24] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:24] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:24] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-24 23:00:24] [INFO ] [Real]Added 190 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:00:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-24 23:00:25] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:25] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2026-05-24 23:00:25] [INFO ] [Nat]Added 190 Read/Feed constraints in 76 ms returned sat
[2026-05-24 23:00:25] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 31 ms.
[2026-05-24 23:00:25] [INFO ] Added : 47 causal constraints over 10 iterations in 377 ms. Result :sat
Minimization took 411 ms.
[2026-05-24 23:00:26] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Real]Added 190 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:00:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-24 23:00:26] [INFO ] [Nat]Added 190 Read/Feed constraints in 67 ms returned sat
[2026-05-24 23:00:26] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2026-05-24 23:00:27] [INFO ] Added : 57 causal constraints over 12 iterations in 442 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5] Max Struct:[10, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 11 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 277 place count 185 transition count 522
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 329 place count 185 transition count 470
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 330 place count 185 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 184 transition count 469
Partial Free-agglomeration rule applied 128 times.
Drop transitions (Partial Free agglomeration) removed 128 transitions
Iterating global reduction 4 with 128 rules applied. Total rules applied 459 place count 184 transition count 469
Applied a total of 459 rules in 123 ms. Remains 184 /324 variables (removed 140) and now considering 469/660 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 184/324 places, 469/660 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9270442281405142589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13439500992361188630.kers'
[2026-05-24 23:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9270442281405142589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13439500992361188630.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 469 rows 184 cols 1058 entries
Finished phase 1 with 162 SingleSign rule and 10 generalized
[2026-05-24 23:00:27] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13439500992361188630.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (16529 resets) in 2263 ms. (441 steps per ms)
BEST_FIRST walk for 11000011 steps (16652 resets) in 5621 ms. (1956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2026-05-24 23:00:35] [INFO ] Invariant cache hit.
[2026-05-24 23:00:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:35] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:35] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-24 23:00:35] [INFO ] State equation strengthened by 375 read => feed constraints.
[2026-05-24 23:00:35] [INFO ] [Real]Added 375 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:00:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:35] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:35] [INFO ] [Nat]Added 375 Read/Feed constraints in 58 ms returned sat
[2026-05-24 23:00:35] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 23 ms.
[2026-05-24 23:00:36] [INFO ] Added : 11 causal constraints over 3 iterations in 149 ms. Result :sat
Minimization took 407 ms.
[2026-05-24 23:00:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Real]Added 375 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:00:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:36] [INFO ] [Nat]Added 375 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:00:36] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 22 ms.
[2026-05-24 23:00:36] [INFO ] Added : 15 causal constraints over 3 iterations in 166 ms. Result :sat
Minimization took 375 ms.
[2026-05-24 23:00:37] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Real]Added 375 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:00:37] [INFO ] [Nat]Added 375 Read/Feed constraints in 44 ms returned sat
[2026-05-24 23:00:37] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 23 ms.
[2026-05-24 23:00:37] [INFO ] Added : 10 causal constraints over 2 iterations in 109 ms. Result :sat
Minimization took 359 ms.
[2026-05-24 23:00:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Real]Added 375 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:00:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:38] [INFO ] [Nat]Added 375 Read/Feed constraints in 63 ms returned sat
[2026-05-24 23:00:38] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 23 ms.
[2026-05-24 23:00:38] [INFO ] Added : 10 causal constraints over 2 iterations in 116 ms. Result :sat
Minimization took 480 ms.
[2026-05-24 23:00:39] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Real]Added 375 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:39] [INFO ] [Nat]Added 375 Read/Feed constraints in 49 ms returned sat
[2026-05-24 23:00:39] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 24 ms.
[2026-05-24 23:00:39] [INFO ] Added : 7 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 543 ms.
[2026-05-24 23:00:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Real]Added 375 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:00:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:00:40] [INFO ] [Nat]Added 375 Read/Feed constraints in 52 ms returned sat
[2026-05-24 23:00:40] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 19 ms.
[2026-05-24 23:00:40] [INFO ] Added : 7 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 446 ms.
[2026-05-24 23:00:41] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Real]Added 375 Read/Feed constraints in 26 ms returned sat
[2026-05-24 23:00:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Nat]Added 375 Read/Feed constraints in 49 ms returned sat
[2026-05-24 23:00:41] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 22 ms.
[2026-05-24 23:00:41] [INFO ] Added : 9 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 423 ms.
[2026-05-24 23:00:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:41] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Real]Added 375 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:00:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Nat]Added 375 Read/Feed constraints in 79 ms returned sat
[2026-05-24 23:00:42] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 25 ms.
[2026-05-24 23:00:42] [INFO ] Added : 10 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 401 ms.
[2026-05-24 23:00:42] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:00:42] [INFO ] [Real]Added 375 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:00:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Nat]Added 375 Read/Feed constraints in 44 ms returned sat
[2026-05-24 23:00:43] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 18 ms.
[2026-05-24 23:00:43] [INFO ] Added : 11 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 447 ms.
[2026-05-24 23:00:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Real]Added 375 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:00:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:43] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:44] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:00:44] [INFO ] [Nat]Added 375 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:00:44] [INFO ] Computed and/alt/rep : 329/967/329 causal constraints (skipped 130 transitions) in 19 ms.
[2026-05-24 23:00:44] [INFO ] Added : 8 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 415 ms.
[2026-05-24 23:00:44] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:44] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-24 23:00:44] [INFO ] [Real]Added 375 Read/Feed constraints in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-14 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 469/469 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 468
Applied a total of 2 rules in 20 ms. Remains 183 /184 variables (removed 1) and now considering 468/469 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 183/184 places, 468/469 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16182801899029783297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10129079187360903053.kers'
[2026-05-24 23:00:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16182801899029783297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10129079187360903053.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:00:44] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10129079187360903053.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (16970 resets) in 2295 ms. (435 steps per ms)
BEST_FIRST walk for 10000009 steps (16279 resets) in 5123 ms. (1951 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2026-05-24 23:00:52] [INFO ] Invariant cache hit.
[2026-05-24 23:00:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:52] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:52] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:00:52] [INFO ] [Real]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:00:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:52] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:52] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:00:52] [INFO ] [Nat]Added 401 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:00:52] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:00:52] [INFO ] Added : 10 causal constraints over 2 iterations in 117 ms. Result :sat
Minimization took 477 ms.
[2026-05-24 23:00:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:00:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:53] [INFO ] [Nat]Added 401 Read/Feed constraints in 41 ms returned sat
[2026-05-24 23:00:53] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 17 ms.
[2026-05-24 23:00:53] [INFO ] Added : 18 causal constraints over 4 iterations in 203 ms. Result :sat
Minimization took 390 ms.
[2026-05-24 23:00:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:00:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Nat]Added 401 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:00:54] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:00:54] [INFO ] Added : 7 causal constraints over 2 iterations in 112 ms. Result :sat
Minimization took 379 ms.
[2026-05-24 23:00:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Nat]Added 401 Read/Feed constraints in 39 ms returned sat
[2026-05-24 23:00:55] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:00:55] [INFO ] Added : 13 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 451 ms.
[2026-05-24 23:00:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Nat]Added 401 Read/Feed constraints in 38 ms returned sat
[2026-05-24 23:00:56] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:00:56] [INFO ] Added : 7 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 439 ms.
[2026-05-24 23:00:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Real]Added 401 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:00:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:56] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:00:57] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:00:57] [INFO ] Added : 7 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 491 ms.
[2026-05-24 23:00:57] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:00:57] [INFO ] [Nat]Added 401 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:00:58] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 22 ms.
[2026-05-24 23:00:58] [INFO ] Added : 8 causal constraints over 2 iterations in 115 ms. Result :sat
Minimization took 476 ms.
[2026-05-24 23:00:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:00:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-24 23:00:58] [INFO ] [Nat]Added 401 Read/Feed constraints in 36 ms returned sat
[2026-05-24 23:00:58] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 21 ms.
[2026-05-24 23:00:59] [INFO ] Added : 14 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 424 ms.
[2026-05-24 23:00:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Real]Added 401 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:00:59] [INFO ] [Nat]Added 401 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:00:59] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:00:59] [INFO ] Added : 10 causal constraints over 3 iterations in 140 ms. Result :sat
Minimization took 386 ms.
[2026-05-24 23:01:00] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:01:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:01:00] [INFO ] [Nat]Added 401 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:01:00] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 18 ms.
[2026-05-24 23:01:00] [INFO ] Added : 8 causal constraints over 2 iterations in 104 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 10 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:01:01] [INFO ] Invariant cache hit.
[2026-05-24 23:01:01] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-24 23:01:01] [INFO ] Invariant cache hit.
[2026-05-24 23:01:01] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:01:02] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2026-05-24 23:01:02] [INFO ] Redundant transitions in 26 ms returned []
Running 458 sub problems to find dead transitions.
[2026-05-24 23:01:02] [INFO ] Invariant cache hit.
[2026-05-24 23:01:02] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 9 (OVERLAPS) 468/650 variables, 182/276 constraints. Problems are: Problem set: 0 solved, 458 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31742 ms. Remains : 183/183 places, 468/468 transitions.
RANDOM walk for 40000 steps (683 resets) in 1050 ms. (38 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
[2026-05-24 23:01:33] [INFO ] Flatten gal took : 80 ms
[2026-05-24 23:01:33] [INFO ] Flatten gal took : 61 ms
[2026-05-24 23:01:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16374375809787756001.gal : 22 ms
[2026-05-24 23:01:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14681680431653148300.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/ReachabilityCardinality16374375809787756001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14681680431653148300.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/ReachabilityCardinality14681680431653148300.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :12 after 13
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :21 after 23
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :23 after 102
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :102 after 432
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :432 after 484
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :484 after 1162
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :1162 after 2209
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :2209 after 3361
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :3361 after 17272
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :17272 after 52498
Interrupted probabilistic random walk after 692841 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 20
Probabilistic random walk after 692841 steps, saw 90549 distinct states, run finished after 3007 ms. (steps per millisecond=230 ) properties seen :0
[2026-05-24 23:01:36] [INFO ] Invariant cache hit.
[2026-05-24 23:01:36] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 9/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/19 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/19 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/21 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 468/649 variables, 181/202 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 401/603 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 0/603 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/651 variables, 2/605 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/651 variables, 0/605 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/651 variables, 0/605 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 605 constraints, problems are : Problem set: 10 solved, 10 unsolved in 2134 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 9/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/19 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/19 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/21 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/22 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/203 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/604 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 10/614 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/614 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/651 variables, 2/616 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 0/616 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/651 variables, 0/616 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 616 constraints, problems are : Problem set: 10 solved, 10 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6218ms problems are : Problem set: 10 solved, 10 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 183/183 places, 468/468 transitions.
RANDOM walk for 40000 steps (689 resets) in 438 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (62 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (63 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :52498 after 1.22223e+06
Interrupted probabilistic random walk after 812920 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 10
Probabilistic random walk after 812920 steps, saw 105213 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
[2026-05-24 23:01:46] [INFO ] Invariant cache hit.
[2026-05-24 23:01:46] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/179 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 468/649 variables, 181/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 401/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/651 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/651 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 596 constraints, problems are : Problem set: 0 solved, 10 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/651 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/651 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 608 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5356 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6322ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 7 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:01:52] [INFO ] Invariant cache hit.
[2026-05-24 23:01:53] [INFO ] Implicit Places using invariants in 461 ms returned []
[2026-05-24 23:01:53] [INFO ] Invariant cache hit.
[2026-05-24 23:01:53] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:01:54] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2026-05-24 23:01:54] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1677 ms. Remains : 183/183 places, 468/468 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 357 edges and 183 vertex of which 130 / 183 are part of one of the 2 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 383 transitions.
Graph (complete) has 146 edges and 55 vertex of which 24 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 24 transition count 48
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 15 transition count 39
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 15 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 14 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 14 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 14 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 13 transition count 33
Applied a total of 55 rules in 21 ms. Remains 13 /183 variables (removed 170) and now considering 33/468 (removed 435) transitions.
Running SMT prover for 10 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2177876404269583859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11935778430018570001.kers'
[2026-05-24 23:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2177876404269583859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11935778430018570001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 13 cols 59 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 23:01:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11935778430018570001.kers
Total runtime 2 ms.
[2026-05-24 23:01:54] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-24 23:01:54] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2026-05-24 23:01:54] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2026-05-24 23:01:54] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2026-05-24 23:01:54] [INFO ] Flatten gal took : 3 ms
[2026-05-24 23:01:54] [INFO ] Flatten gal took : 2 ms
[2026-05-24 23:01:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11959190894705081448.gal : 1 ms
[2026-05-24 23:01:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3999731305737156230.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/ReachabilityCardinality11959190894705081448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3999731305737156230.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/ReachabilityCardinality3999731305737156230.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
Invariant property MIN9 does not hold.
Invariant property MIN8 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN2 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :7 after 28
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :28 after 84
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :84 after 462
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :462 after 3003
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3003 after 88375
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88375 after 151861
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :151861 after 457027
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,1.20091e+06,0.027834,4960,2,134,22,5596,7,0,80,5735,0
Total reachable state count : 1200914
Verifying 10 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,12870,0.028292,5016,2,70,22,5596,8,0,83,5735,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,9,0.028647,5220,2,14,22,5596,9,0,85,5735,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,45,0.028839,5220,2,22,22,5596,10,0,87,5735,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,6435,0.02897,5220,2,62,22,5596,11,0,89,5735,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,24310,0.029092,5220,2,78,22,5596,12,0,91,5735,0
Invariant property MIN5 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
MIN5,495,0.029202,5220,2,38,22,5596,13,0,93,5735,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,1287,0.029315,5220,2,46,22,5596,14,0,95,5735,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,151164,0.029439,5220,2,102,22,5596,14,0,96,5735,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,1,0.029545,5220,2,14,22,5596,15,0,98,5735,0
Invariant property MIN9 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
MIN9,165,0.029653,5220,2,30,22,5596,16,0,100,5735,0
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:01:54] [INFO ] Flatten gal took : 39 ms
[2026-05-24 23:01:54] [INFO ] Applying decomposition
[2026-05-24 23:01:54] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17461682522769360874.txt' '-o' '/tmp/graph17461682522769360874.bin' '-w' '/tmp/graph17461682522769360874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17461682522769360874.bin' '-l' '-1' '-v' '-w' '/tmp/graph17461682522769360874.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:01:55] [INFO ] Decomposing Gal with order
[2026-05-24 23:01:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:01:55] [INFO ] Removed a total of 343 redundant transitions.
[2026-05-24 23:01:55] [INFO ] Flatten gal took : 93 ms
[2026-05-24 23:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 16 ms.
[2026-05-24 23:01:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13817099879958622334.gal : 8 ms
[2026-05-24 23:01:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8184225689404349024.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/ReachabilityCardinality13817099879958622334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8184225689404349024.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality8184225689404349024.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 139
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :139 after 139
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :139 after 139
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :139 after 142
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :142 after 156
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :156 after 285
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :285 after 4364
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :4364 after 81868
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :81868 after 791652
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :791652 after 4.8833e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14482827918988392049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5105401519685201385.kers'
[2026-05-24 23:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14482827918988392049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5105401519685201385.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:02:45] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5105401519685201385.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]
RANDOM walk for 1000000 steps (16974 resets) in 2303 ms. (434 steps per ms)
BEST_FIRST walk for 10000007 steps (16316 resets) in 5131 ms. (1948 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]
[2026-05-24 23:02:52] [INFO ] Invariant cache hit.
[2026-05-24 23:02:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 23:02:52] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:52] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-24 23:02:52] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:02:52] [INFO ] [Real]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:02:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:02:53] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:02:53] [INFO ] Added : 10 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 475 ms.
[2026-05-24 23:02:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:02:53] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:02:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:02:54] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 21 ms.
[2026-05-24 23:02:54] [INFO ] Added : 18 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 393 ms.
[2026-05-24 23:02:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:02:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:54] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Nat]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:02:55] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 18 ms.
[2026-05-24 23:02:55] [INFO ] Added : 7 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 379 ms.
[2026-05-24 23:02:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:02:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-24 23:02:55] [INFO ] [Nat]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:02:55] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 18 ms.
[2026-05-24 23:02:56] [INFO ] Added : 13 causal constraints over 3 iterations in 160 ms. Result :sat
Minimization took 467 ms.
[2026-05-24 23:02:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:02:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:02:56] [INFO ] [Nat]Added 401 Read/Feed constraints in 41 ms returned sat
[2026-05-24 23:02:56] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 21 ms.
[2026-05-24 23:02:56] [INFO ] Added : 7 causal constraints over 2 iterations in 101 ms. Result :sat
Minimization took 441 ms.
[2026-05-24 23:02:57] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Real]Added 401 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:02:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-24 23:02:57] [INFO ] [Nat]Added 401 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:02:57] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:02:57] [INFO ] Added : 7 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 485 ms.
[2026-05-24 23:02:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:02:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:02:58] [INFO ] [Nat]Added 401 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:02:58] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 28 ms.
[2026-05-24 23:02:58] [INFO ] Added : 8 causal constraints over 2 iterations in 109 ms. Result :sat
Minimization took 471 ms.
[2026-05-24 23:02:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:02:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:02:59] [INFO ] [Nat]Added 401 Read/Feed constraints in 36 ms returned sat
[2026-05-24 23:02:59] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 17 ms.
[2026-05-24 23:02:59] [INFO ] Added : 14 causal constraints over 3 iterations in 140 ms. Result :sat
Minimization took 421 ms.
[2026-05-24 23:03:00] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:03:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:03:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:03:00] [INFO ] [Nat]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:03:00] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 17 ms.
[2026-05-24 23:03:00] [INFO ] Added : 10 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 392 ms.
[2026-05-24 23:03:01] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:03:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:03:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:03:01] [INFO ] [Nat]Added 401 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:03:01] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 21 ms.
[2026-05-24 23:03:01] [INFO ] Added : 8 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[9, 9, 9, 9, 9, 9, 9, 9, 9, 9]
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 7 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 7 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:03:01] [INFO ] Invariant cache hit.
[2026-05-24 23:03:02] [INFO ] Implicit Places using invariants in 266 ms returned []
[2026-05-24 23:03:02] [INFO ] Invariant cache hit.
[2026-05-24 23:03:02] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:03:03] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2026-05-24 23:03:03] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1445 ms. Remains : 183/183 places, 468/468 transitions.
[2026-05-24 23:03:03] [INFO ] Flatten gal took : 31 ms
[2026-05-24 23:03:03] [INFO ] Flatten gal took : 14 ms
[2026-05-24 23:03:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3868151976816732007.gal : 7 ms
[2026-05-24 23:03:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12814232941789485904.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/ReachabilityCardinality3868151976816732007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12814232941789485904.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/ReachabilityCardinality12814232941789485904.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :12 after 13
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :21 after 23
RANDOM walk for 40000 steps (672 resets) in 752 ms. (53 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (9 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :23 after 102
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :102 after 432
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :432 after 484
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :484 after 1162
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :1162 after 2209
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :2209 after 3361
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :3361 after 17272
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :17272 after 52498
Interrupted probabilistic random walk after 800973 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 20
Probabilistic random walk after 800973 steps, saw 104188 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2026-05-24 23:03:06] [INFO ] Invariant cache hit.
[2026-05-24 23:03:06] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 10/24 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/24 constraints. Problems are: Problem set: 10 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/205 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/606 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 0/606 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/651 variables, 2/608 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 0/608 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/651 variables, 0/608 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 608 constraints, problems are : Problem set: 10 solved, 10 unsolved in 3136 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/3 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/12 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/13 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/181 variables, 2/15 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 9/24 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/26 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/26 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 468/649 variables, 181/207 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 401/608 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 10/618 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 0/618 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/651 variables, 2/620 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/651 variables, 0/620 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/651 variables, 0/620 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 620 constraints, problems are : Problem set: 10 solved, 10 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8163ms problems are : Problem set: 10 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 183/183 places, 468/468 transitions.
RANDOM walk for 40000 steps (680 resets) in 350 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (66 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (65 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (63 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (66 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (65 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :52498 after 1.22223e+06
Interrupted probabilistic random walk after 957320 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 10
Probabilistic random walk after 957320 steps, saw 124309 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
[2026-05-24 23:03:18] [INFO ] Invariant cache hit.
[2026-05-24 23:03:18] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/179 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 468/649 variables, 181/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 401/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/651 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/651 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 596 constraints, problems are : Problem set: 0 solved, 10 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/651 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/651 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 608 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6266ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:03:24] [INFO ] Invariant cache hit.
[2026-05-24 23:03:25] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-24 23:03:25] [INFO ] Invariant cache hit.
[2026-05-24 23:03:25] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:03:26] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2026-05-24 23:03:26] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1570 ms. Remains : 183/183 places, 468/468 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 357 edges and 183 vertex of which 130 / 183 are part of one of the 2 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 383 transitions.
Graph (complete) has 146 edges and 55 vertex of which 24 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 24 transition count 48
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 15 transition count 39
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 15 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 14 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 14 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 14 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 13 transition count 33
Applied a total of 55 rules in 12 ms. Remains 13 /183 variables (removed 170) and now considering 33/468 (removed 435) transitions.
Running SMT prover for 10 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4375372943412502835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2698710414161868073.kers'
[2026-05-24 23:03:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4375372943412502835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2698710414161868073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 13 cols 59 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 23:03:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2698710414161868073.kers
Total runtime 0 ms.
[2026-05-24 23:03:26] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-24 23:03:26] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2026-05-24 23:03:26] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2026-05-24 23:03:26] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2026-05-24 23:03:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 23:03:26] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:03:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12746166595129399541.gal : 5 ms
[2026-05-24 23:03:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7008634615773374496.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/ReachabilityCardinality12746166595129399541.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7008634615773374496.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/ReachabilityCardinality7008634615773374496.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
Invariant property MIN9 does not hold.
Invariant property MIN8 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN2 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :7 after 28
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :28 after 84
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :84 after 462
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :462 after 3003
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3003 after 88375
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88375 after 151861
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :151861 after 457027
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,1.20091e+06,0.048435,4972,2,134,22,5596,7,0,80,5735,0
Total reachable state count : 1200914
Verifying 10 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,12870,0.048966,5028,2,70,22,5596,8,0,83,5735,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,9,0.049307,5232,2,14,22,5596,9,0,85,5735,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,45,0.04948,5232,2,22,22,5596,10,0,87,5735,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,6435,0.049652,5232,2,62,22,5596,11,0,89,5735,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,24310,0.049794,5232,2,78,22,5596,12,0,91,5735,0
Invariant property MIN5 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
MIN5,495,0.049916,5232,2,38,22,5596,13,0,93,5735,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,1287,0.050036,5232,2,46,22,5596,14,0,95,5735,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,151164,0.050168,5232,2,102,22,5596,14,0,96,5735,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,1,0.050286,5232,2,14,22,5596,15,0,98,5735,0
Invariant property MIN9 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
MIN9,165,0.050402,5232,2,30,22,5596,16,0,100,5735,0
Over-approximation ignoring read arcs solved 0 properties in 242 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:03:26] [INFO ] Flatten gal took : 16 ms
[2026-05-24 23:03:26] [INFO ] Applying decomposition
[2026-05-24 23:03:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6333114369563737357.txt' '-o' '/tmp/graph6333114369563737357.bin' '-w' '/tmp/graph6333114369563737357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6333114369563737357.bin' '-l' '-1' '-v' '-w' '/tmp/graph6333114369563737357.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:03:26] [INFO ] Decomposing Gal with order
[2026-05-24 23:03:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:03:26] [INFO ] Removed a total of 350 redundant transitions.
[2026-05-24 23:03:26] [INFO ] Flatten gal took : 46 ms
[2026-05-24 23:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2026-05-24 23:03:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10545344412686114164.gal : 5 ms
[2026-05-24 23:03:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9083795243505047907.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/ReachabilityCardinality10545344412686114164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9083795243505047907.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality9083795243505047907.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :14 after 14
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :14 after 14
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :14 after 14
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :14 after 135
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :135 after 151
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :151 after 261
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :261 after 6465
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6465 after 118381
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :118381 after 4.72728e+06
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.72728e+06 after 9.11471e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5540322562807978273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4486271989236085864.kers'
[2026-05-24 23:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5540322562807978273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4486271989236085864.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:04:17] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4486271989236085864.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 1000000 steps (17024 resets) in 2296 ms. (435 steps per ms)
BEST_FIRST walk for 10000009 steps (16260 resets) in 5108 ms. (1957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2026-05-24 23:04:24] [INFO ] Invariant cache hit.
[2026-05-24 23:04:24] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:24] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:04:24] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:04:24] [INFO ] [Real]Added 401 Read/Feed constraints in 41 ms returned sat
[2026-05-24 23:04:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:24] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:24] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:04:24] [INFO ] [Nat]Added 401 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:04:24] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:24] [INFO ] Added : 10 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 469 ms.
[2026-05-24 23:04:25] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Real]Added 401 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:04:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:04:25] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:04:25] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:25] [INFO ] Added : 18 causal constraints over 4 iterations in 192 ms. Result :sat
Minimization took 391 ms.
[2026-05-24 23:04:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:04:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:04:26] [INFO ] [Nat]Added 401 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:04:26] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:26] [INFO ] Added : 7 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 384 ms.
[2026-05-24 23:04:27] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:04:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:04:27] [INFO ] [Nat]Added 401 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:04:27] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:04:27] [INFO ] Added : 13 causal constraints over 3 iterations in 146 ms. Result :sat
Minimization took 460 ms.
[2026-05-24 23:04:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:04:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Nat]Added 401 Read/Feed constraints in 38 ms returned sat
[2026-05-24 23:04:28] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 22 ms.
[2026-05-24 23:04:28] [INFO ] Added : 7 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 444 ms.
[2026-05-24 23:04:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Real]Added 401 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:04:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:04:29] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:29] [INFO ] Added : 7 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 500 ms.
[2026-05-24 23:04:29] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 23:04:29] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:04:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Nat]Added 401 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:04:30] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:04:30] [INFO ] Added : 8 causal constraints over 2 iterations in 102 ms. Result :sat
Minimization took 481 ms.
[2026-05-24 23:04:30] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:04:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Nat]Added 401 Read/Feed constraints in 37 ms returned sat
[2026-05-24 23:04:31] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:04:31] [INFO ] Added : 14 causal constraints over 3 iterations in 155 ms. Result :sat
Minimization took 432 ms.
[2026-05-24 23:04:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:04:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:04:31] [INFO ] [Nat]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:04:32] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:32] [INFO ] Added : 10 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 392 ms.
[2026-05-24 23:04:32] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Real]Added 401 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:04:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:04:32] [INFO ] [Nat]Added 401 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:04:32] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:04:32] [INFO ] Added : 8 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 7 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:04:33] [INFO ] Invariant cache hit.
[2026-05-24 23:04:33] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-24 23:04:33] [INFO ] Invariant cache hit.
[2026-05-24 23:04:33] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:04:34] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2026-05-24 23:04:34] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 183/183 places, 468/468 transitions.
[2026-05-24 23:04:34] [INFO ] Flatten gal took : 29 ms
[2026-05-24 23:04:34] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:04:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7932523348341616233.gal : 3 ms
[2026-05-24 23:04:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8334523818048873112.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/ReachabilityCardinality7932523348341616233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8334523818048873112.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/ReachabilityCardinality8334523818048873112.prop.
RANDOM walk for 40000 steps (692 resets) in 496 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 12
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :12 after 13
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :13 after 21
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :21 after 23
BEST_FIRST walk for 4003 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :23 after 102
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :102 after 432
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :432 after 484
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :484 after 1162
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :1162 after 2209
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :2209 after 3361
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :3361 after 17272
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :17272 after 52498
Interrupted probabilistic random walk after 635516 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 20
Probabilistic random walk after 635516 steps, saw 82125 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2026-05-24 23:04:37] [INFO ] Invariant cache hit.
[2026-05-24 23:04:37] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/599 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 2/651 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 601 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 468/649 variables, 181/200 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 401/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 20/621 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :52498 after 1.22223e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/651 variables, and 621 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10023ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 17 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 183/183 places, 468/468 transitions.
RANDOM walk for 40000 steps (677 resets) in 513 ms. (77 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 716413 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 20
Probabilistic random walk after 716413 steps, saw 94468 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
[2026-05-24 23:04:51] [INFO ] Invariant cache hit.
[2026-05-24 23:04:51] [INFO ] State equation strengthened by 401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 468/649 variables, 181/198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 401/599 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 2/651 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/651 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 601 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5441 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 151/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/179 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/181 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 468/649 variables, 181/200 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 401/601 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 20/621 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 2/651 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/651 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 32768
SDD size :1.22223e+06 after 4.07334e+06
At refinement iteration 16 (OVERLAPS) 0/651 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 623 constraints, problems are : Problem set: 0 solved, 20 unsolved in 24384 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 401/401 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29842ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 8 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 183/183 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-24 23:05:21] [INFO ] Invariant cache hit.
[2026-05-24 23:05:21] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-24 23:05:21] [INFO ] Invariant cache hit.
[2026-05-24 23:05:21] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:05:22] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2026-05-24 23:05:22] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1457 ms. Remains : 183/183 places, 468/468 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 357 edges and 183 vertex of which 130 / 183 are part of one of the 2 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 383 transitions.
Graph (complete) has 146 edges and 55 vertex of which 24 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 24 transition count 48
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 15 transition count 39
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 15 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 14 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 14 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 14 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 13 transition count 33
Applied a total of 55 rules in 11 ms. Remains 13 /183 variables (removed 170) and now considering 33/468 (removed 435) transitions.
Running SMT prover for 20 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5569995995975753807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17571573594923922420.kers'
[2026-05-24 23:05:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5569995995975753807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17571573594923922420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 13 cols 59 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 23:05:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17571573594923922420.kers
Total runtime 0 ms.
[2026-05-24 23:05:22] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:19
TRAPS : Iteration 0
[2026-05-24 23:05:22] [INFO ] After 35ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2026-05-24 23:05:22] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2026-05-24 23:05:22] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
TRAPS : Iteration 0
[2026-05-24 23:05:22] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
[2026-05-24 23:05:22] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
[2026-05-24 23:05:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 23:05:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 23:05:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5529783104761002657.gal : 1 ms
[2026-05-24 23:05:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6785795275526365662.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/ReachabilityCardinality5529783104761002657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6785795275526365662.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/ReachabilityCardinality6785795275526365662.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 7
Invariant property MIN9 does not hold.
Invariant property MIN8 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN2 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :7 after 28
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :28 after 84
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :84 after 462
Reachability property MAX9 is true.
Reachability property MAX8 is true.
Reachability property MAX6 is true.
Reachability property MAX2 is true.
Reachability property MAX1 is true.
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :462 after 3003
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3003 after 11440
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11440 after 90376
Reachability property MAX5 is true.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :90376 after 141140
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :141140 after 161359
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :161359 after 184693
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,1.20091e+06,0.028909,5020,2,134,33,5686,8,0,81,5735,0
Total reachable state count : 1200914
Verifying 20 reachability properties.
Reachability property MAX0 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
MAX0,45,0.029257,5032,2,28,33,5686,9,0,84,5735,0
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,12870,0.029574,5280,2,70,33,5686,10,0,86,5735,0
Reachability property MAX1 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
MAX1,3,0.029686,5280,2,14,33,5686,11,0,88,5735,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,9,0.029799,5280,2,14,33,5686,12,0,90,5735,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,6,0.029903,5280,2,16,33,5686,13,0,92,5735,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,45,0.030014,5280,2,22,33,5686,14,0,94,5735,0
Reachability property MAX3 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
MAX3,36,0.030116,5280,2,26,33,5686,15,0,96,5735,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,6435,0.030231,5280,2,62,33,5686,16,0,98,5735,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,55,0.030332,5280,2,30,33,5686,17,0,100,5735,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,24310,0.030451,5280,2,78,33,5686,18,0,102,5735,0
Reachability property MAX5 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
MAX5,15,0.030552,5280,2,20,33,5686,19,0,104,5735,0
Invariant property MIN5 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
MIN5,495,0.030665,5280,2,38,33,5686,20,0,106,5735,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,21,0.030776,5280,2,22,33,5686,21,0,108,5735,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,1287,0.030886,5280,2,46,33,5686,22,0,110,5735,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,156,0.030986,5280,2,36,33,5686,22,0,111,5735,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,151164,0.031111,5280,2,102,33,5686,22,0,112,5735,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,1,0.031217,5280,2,14,33,5686,23,0,114,5735,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,1,0.031323,5280,2,14,33,5686,24,0,116,5735,0
Reachability property MAX9 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
MAX9,10,0.031423,5280,2,18,33,5686,25,0,118,5735,0
Invariant property MIN9 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
MIN9,165,0.031536,5280,2,30,33,5686,26,0,120,5735,0
Over-approximation ignoring read arcs solved 0 properties in 298 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:05:23] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:05:23] [INFO ] Applying decomposition
[2026-05-24 23:05:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13284847924881869751.txt' '-o' '/tmp/graph13284847924881869751.bin' '-w' '/tmp/graph13284847924881869751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13284847924881869751.bin' '-l' '-1' '-v' '-w' '/tmp/graph13284847924881869751.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:05:23] [INFO ] Decomposing Gal with order
[2026-05-24 23:05:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:05:23] [INFO ] Removed a total of 338 redundant transitions.
[2026-05-24 23:05:23] [INFO ] Flatten gal took : 31 ms
[2026-05-24 23:05:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 10 ms.
[2026-05-24 23:05:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10823834058856645180.gal : 4 ms
[2026-05-24 23:05:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6279386504793451642.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/ReachabilityCardinality10823834058856645180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6279386504793451642.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality6279386504793451642.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :26 after 26
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :26 after 26
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :26 after 26
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :26 after 26
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :26 after 866
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :866 after 1115
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :1115 after 23627
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :23627 after 330796
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :330796 after 2.02892e+07
Detected timeout of ITS tools.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1689913034459139521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9011806739244667423.kers'
[2026-05-24 23:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1689913034459139521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9011806739244667423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:06:13] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9011806739244667423.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (170 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:06:13] [INFO ] Invariant cache hit.
[2026-05-24 23:06:13] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:06:13] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:06:13] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-24 23:06:13] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:06:13] [INFO ] [Real]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:06:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:06:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:06:13] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:06:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:06:13] [INFO ] [Nat]Added 401 Read/Feed constraints in 50 ms returned sat
[2026-05-24 23:06:13] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 16 ms.
[2026-05-24 23:06:13] [INFO ] Added : 10 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 467 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 179 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 179 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 178 transition count 463
Applied a total of 16 rules in 17 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2344360820122022197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2795638612921764418.kers'
[2026-05-24 23:06:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2344360820122022197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2795638612921764418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:06:14] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2795638612921764418.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17282 resets) in 2123 ms. (470 steps per ms)
BEST_FIRST walk for 1000001 steps (1645 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:06:16] [INFO ] Invariant cache hit.
[2026-05-24 23:06:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:06:16] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:06:16] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:06:16] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:06:16] [INFO ] [Real]Added 415 Read/Feed constraints in 37 ms returned sat
[2026-05-24 23:06:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:06:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:06:17] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:06:17] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:06:17] [INFO ] [Nat]Added 415 Read/Feed constraints in 44 ms returned sat
[2026-05-24 23:06:17] [INFO ] Computed and/alt/rep : 318/1005/318 causal constraints (skipped 135 transitions) in 22 ms.
[2026-05-24 23:06:17] [INFO ] Added : 10 causal constraints over 2 iterations in 131 ms. Result :sat
Minimization took 379 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:06:17] [INFO ] Invariant cache hit.
[2026-05-24 23:06:17] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-24 23:06:17] [INFO ] Invariant cache hit.
[2026-05-24 23:06:18] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:06:19] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
[2026-05-24 23:06:19] [INFO ] Redundant transitions in 4 ms returned []
Running 453 sub problems to find dead transitions.
[2026-05-24 23:06:19] [INFO ] Invariant cache hit.
[2026-05-24 23:06:19] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 8 (OVERLAPS) 463/640 variables, 177/270 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 415/685 constraints. Problems are: Problem set: 3 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/641 variables, and 685 constraints, problems are : Problem set: 3 solved, 450 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 81/93 constraints. Problems are: Problem set: 3 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 450 unsolved
At refinement iteration 4 (OVERLAPS) 463/640 variables, 177/270 constraints. Problems are: Problem set: 3 solved, 450 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 415/685 constraints. Problems are: Problem set: 28 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 425/1110 constraints. Problems are: Problem set: 28 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/641 variables, and 1110 constraints, problems are : Problem set: 28 solved, 425 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 425/453 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 28 solved, 425 unsolved
Search for dead transitions found 28 dead transitions in 60087ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/178 places, 435/463 transitions.
Graph (complete) has 760 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 160 transition count 401
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 160 transition count 401
Applied a total of 35 rules in 8 ms. Remains 160 /178 variables (removed 18) and now considering 401/435 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5713582065815386940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12750734484582813662.kers'
[2026-05-24 23:07:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5713582065815386940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12750734484582813662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 160 cols 871 entries
Finished phase 1 with 145 SingleSign rule and 2 generalized
[2026-05-24 23:07:19] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12750734484582813662.kers
Total runtime 3 ms.
[2026-05-24 23:07:20] [INFO ] Implicit Places using invariants in 103 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 105 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 158/178 places, 401/463 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 156 transition count 399
Applied a total of 20 rules in 37 ms. Remains 156 /158 variables (removed 2) and now considering 399/401 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17984338960773912600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1020064140381872673.kers'
[2026-05-24 23:07:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17984338960773912600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1020064140381872673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:07:20] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1020064140381872673.kers
Total runtime 1 ms.
[2026-05-24 23:07:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:07:20] [INFO ] Invariant cache hit.
[2026-05-24 23:07:20] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:07:21] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/178 places, 399/463 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63731 ms. Remains : 156/178 places, 399/463 transitions.
[2026-05-24 23:07:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20252 resets) in 2118 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (1850 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:07:24] [INFO ] Invariant cache hit.
[2026-05-24 23:07:24] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:07:24] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-24 23:07:24] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:07:24] [INFO ] [Real]Added 352 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:07:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:07:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:07:24] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:07:24] [INFO ] [Nat]Added 352 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:07:24] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 19 ms.
[2026-05-24 23:07:24] [INFO ] Added : 9 causal constraints over 2 iterations in 105 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:07:24] [INFO ] Invariant cache hit.
[2026-05-24 23:07:24] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-24 23:07:24] [INFO ] Invariant cache hit.
[2026-05-24 23:07:24] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:07:26] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2026-05-24 23:07:26] [INFO ] Redundant transitions in 18 ms returned []
Running 389 sub problems to find dead transitions.
[2026-05-24 23:07:26] [INFO ] Invariant cache hit.
[2026-05-24 23:07:26] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 399/554 variables, 155/167 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 352/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 399/554 variables, 155/168 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 352/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61450 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:08:26] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:08:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:08:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality161646484527895622.gal : 2 ms
[2026-05-24 23:08:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4593892176180995682.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/ReachabilityCardinality161646484527895622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4593892176180995682.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/ReachabilityCardinality4593892176180995682.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 46
RANDOM walk for 40000 steps (807 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 70
BEST_FIRST walk for 40004 steps (70 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 344
BEST_FIRST walk for 40004 steps (73 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :344 after 416
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :416 after 1364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1364 after 2905
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2905 after 23054
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23054 after 77770
Interrupted probabilistic random walk after 1306251 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 2
Probabilistic random walk after 1306251 steps, saw 153841 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2026-05-24 23:08:29] [INFO ] Invariant cache hit.
[2026-05-24 23:08:29] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/242 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (805 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1794352 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :0 out of 1
Probabilistic random walk after 1794352 steps, saw 215700 distinct states, run finished after 3001 ms. (steps per millisecond=597 ) properties seen :0
[2026-05-24 23:08:32] [INFO ] Invariant cache hit.
[2026-05-24 23:08:32] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:08:33] [INFO ] Invariant cache hit.
[2026-05-24 23:08:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 23:08:33] [INFO ] Invariant cache hit.
[2026-05-24 23:08:33] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:08:34] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2026-05-24 23:08:34] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1316 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 4 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11618749231249339362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1806576874028414842.kers'
[2026-05-24 23:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11618749231249339362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1806576874028414842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:08:34] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1806576874028414842.kers
Total runtime 0 ms.
[2026-05-24 23:08:34] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:08:34] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 23:08:34] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:08:34] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:08:34] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:08:34] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:08:34] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:08:34] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:08:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9192864021286066870.gal : 0 ms
[2026-05-24 23:08:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14925766698995791738.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/ReachabilityCardinality9192864021286066870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14925766698995791738.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/ReachabilityCardinality14925766698995791738.prop.
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 3 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,9,0.001598,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.001849,4156,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 56 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:08:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:08:34] [INFO ] Applying decomposition
[2026-05-24 23:08:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4629830892895920253.txt' '-o' '/tmp/graph4629830892895920253.bin' '-w' '/tmp/graph4629830892895920253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4629830892895920253.bin' '-l' '-1' '-v' '-w' '/tmp/graph4629830892895920253.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:08:34] [INFO ] Decomposing Gal with order
[2026-05-24 23:08:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:08:34] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:08:34] [INFO ] Flatten gal took : 24 ms
[2026-05-24 23:08:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 8 ms.
[2026-05-24 23:08:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13235826599364715668.gal : 2 ms
[2026-05-24 23:08:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3675109686171749409.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/ReachabilityCardinality13235826599364715668.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3675109686171749409.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality3675109686171749409.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 63
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :63 after 317
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :317 after 4468
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4468 after 462026
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :462026 after 2.36576e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.36576e+07 after 3.92659e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3152198415486536994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16489831444292186510.kers'
[2026-05-24 23:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3152198415486536994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16489831444292186510.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:09:24] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16489831444292186510.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20247 resets) in 2120 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (1854 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:09:27] [INFO ] Invariant cache hit.
[2026-05-24 23:09:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:09:27] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:09:27] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:09:27] [INFO ] [Real]Added 352 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:09:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:09:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:09:27] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:09:27] [INFO ] [Nat]Added 352 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:09:27] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 21 ms.
[2026-05-24 23:09:27] [INFO ] Added : 9 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 217 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:09:28] [INFO ] Invariant cache hit.
[2026-05-24 23:09:28] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 23:09:28] [INFO ] Invariant cache hit.
[2026-05-24 23:09:28] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:09:29] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2026-05-24 23:09:29] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1293 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:09:29] [INFO ] Flatten gal took : 19 ms
[2026-05-24 23:09:29] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:09:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11731702923533723277.gal : 2 ms
[2026-05-24 23:09:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14476864479826862876.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/ReachabilityCardinality11731702923533723277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14476864479826862876.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/ReachabilityCardinality14476864479826862876.prop.
RANDOM walk for 40000 steps (803 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
BEST_FIRST walk for 40004 steps (70 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 344
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :344 after 416
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :416 after 1364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1364 after 2905
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2905 after 23054
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23054 after 77770
Interrupted probabilistic random walk after 1339263 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 2
Probabilistic random walk after 1339263 steps, saw 159132 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2026-05-24 23:09:32] [INFO ] Invariant cache hit.
[2026-05-24 23:09:32] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (815 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1793909 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :0 out of 1
Probabilistic random walk after 1793909 steps, saw 215644 distinct states, run finished after 3001 ms. (steps per millisecond=597 ) properties seen :0
[2026-05-24 23:09:36] [INFO ] Invariant cache hit.
[2026-05-24 23:09:36] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:09:36] [INFO ] Invariant cache hit.
[2026-05-24 23:09:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-24 23:09:36] [INFO ] Invariant cache hit.
[2026-05-24 23:09:37] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:09:38] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2026-05-24 23:09:38] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1368 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3132902021487995137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8794740901058001188.kers'
[2026-05-24 23:09:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3132902021487995137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8794740901058001188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:09:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8794740901058001188.kers
Total runtime 0 ms.
[2026-05-24 23:09:38] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:09:38] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 23:09:38] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:09:38] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:09:38] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:09:38] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:09:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:09:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13763660329497795223.gal : 1 ms
[2026-05-24 23:09:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13102818664017244780.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/ReachabilityCardinality13763660329497795223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13102818664017244780.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/ReachabilityCardinality13102818664017244780.prop.
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 3 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,9,0.00155,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.001796,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 64 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:09:38] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:09:38] [INFO ] Applying decomposition
[2026-05-24 23:09:38] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12313985729567097450.txt' '-o' '/tmp/graph12313985729567097450.bin' '-w' '/tmp/graph12313985729567097450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12313985729567097450.bin' '-l' '-1' '-v' '-w' '/tmp/graph12313985729567097450.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:09:38] [INFO ] Decomposing Gal with order
[2026-05-24 23:09:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:09:38] [INFO ] Removed a total of 323 redundant transitions.
[2026-05-24 23:09:38] [INFO ] Flatten gal took : 17 ms
[2026-05-24 23:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 9 ms.
[2026-05-24 23:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12218298263694370055.gal : 7 ms
[2026-05-24 23:09:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9916163123715022922.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/ReachabilityCardinality12218298263694370055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9916163123715022922.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality9916163123715022922.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 59
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :59 after 335
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :335 after 523
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :523 after 4013
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4013 after 32265
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :32265 after 3.80201e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.30548e+08 after 5.32601e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10715732804054660098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606541868015716505.kers'
[2026-05-24 23:10:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10715732804054660098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606541868015716505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:10:28] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12606541868015716505.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (20268 resets) in 2155 ms. (463 steps per ms)
BEST_FIRST walk for 1000001 steps (1876 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-24 23:10:31] [INFO ] Invariant cache hit.
[2026-05-24 23:10:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:10:31] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-24 23:10:31] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:10:31] [INFO ] [Real]Added 352 Read/Feed constraints in 26 ms returned sat
[2026-05-24 23:10:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:10:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:10:31] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:10:31] [INFO ] [Nat]Added 352 Read/Feed constraints in 36 ms returned sat
[2026-05-24 23:10:31] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 17 ms.
[2026-05-24 23:10:31] [INFO ] Added : 9 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:10:31] [INFO ] Invariant cache hit.
[2026-05-24 23:10:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 23:10:31] [INFO ] Invariant cache hit.
[2026-05-24 23:10:31] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:10:33] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2026-05-24 23:10:33] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1350 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:10:33] [INFO ] Flatten gal took : 15 ms
[2026-05-24 23:10:33] [INFO ] Flatten gal took : 9 ms
[2026-05-24 23:10:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17503388083318151418.gal : 2 ms
[2026-05-24 23:10:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14817413944574711114.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/ReachabilityCardinality17503388083318151418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14817413944574711114.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/ReachabilityCardinality14817413944574711114.prop.
RANDOM walk for 40000 steps (802 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (72 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (72 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 344
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :344 after 416
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :416 after 1364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1364 after 2905
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2905 after 23054
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23054 after 77770
Interrupted probabilistic random walk after 1336267 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 2
Probabilistic random walk after 1336267 steps, saw 158625 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2026-05-24 23:10:36] [INFO ] Invariant cache hit.
[2026-05-24 23:10:36] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (812 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1224811 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :0 out of 2
Probabilistic random walk after 1224811 steps, saw 144673 distinct states, run finished after 3001 ms. (steps per millisecond=408 ) properties seen :0
[2026-05-24 23:10:40] [INFO ] Invariant cache hit.
[2026-05-24 23:10:40] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 274/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 230/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/187 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/224 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/233 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 274/507 variables, 72/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 230/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 798ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:10:40] [INFO ] Invariant cache hit.
[2026-05-24 23:10:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 23:10:40] [INFO ] Invariant cache hit.
[2026-05-24 23:10:41] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:10:42] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2026-05-24 23:10:42] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 3 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15595596983872175889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12797265491167440242.kers'
[2026-05-24 23:10:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15595596983872175889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12797265491167440242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:10:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12797265491167440242.kers
Total runtime 0 ms.
[2026-05-24 23:10:42] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:10:42] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:10:42] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:10:42] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:10:42] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:10:42] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:10:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:10:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:10:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6416178951108918264.gal : 0 ms
[2026-05-24 23:10:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17319190106068472911.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/ReachabilityCardinality6416178951108918264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17319190106068472911.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/ReachabilityCardinality17319190106068472911.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :6 after 9
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,20,0.002743,4144,2,10,10,87,6,0,14,87,0
Total reachable state count : 20
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.002905,4172,2,3,10,87,7,0,17,87,0
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.003114,4172,2,3,10,87,8,0,19,87,0
Over-approximation ignoring read arcs solved 0 properties in 66 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:10:42] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:10:42] [INFO ] Applying decomposition
[2026-05-24 23:10:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2513136893534703389.txt' '-o' '/tmp/graph2513136893534703389.bin' '-w' '/tmp/graph2513136893534703389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2513136893534703389.bin' '-l' '-1' '-v' '-w' '/tmp/graph2513136893534703389.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:10:42] [INFO ] Decomposing Gal with order
[2026-05-24 23:10:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:10:42] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:10:42] [INFO ] Flatten gal took : 15 ms
[2026-05-24 23:10:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 6 ms.
[2026-05-24 23:10:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9510329885842688518.gal : 3 ms
[2026-05-24 23:10:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8925091780798014233.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/ReachabilityCardinality9510329885842688518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8925091780798014233.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality8925091780798014233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 35
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :35 after 35
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :35 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 401
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :401 after 817
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :817 after 13518
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :13518 after 190375
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :190375 after 1.78242e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.43866e+08 after 4.95088e+08
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00 in 319249 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15604757674148647557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12239019456133291543.kers'
[2026-05-24 23:11:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15604757674148647557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12239019456133291543.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:11:32] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12239019456133291543.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (168 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (15 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:11:32] [INFO ] Invariant cache hit.
[2026-05-24 23:11:32] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:11:32] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:11:32] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:11:32] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:11:32] [INFO ] [Real]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:11:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:11:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:11:32] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:11:32] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-24 23:11:32] [INFO ] [Nat]Added 401 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:11:32] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 22 ms.
[2026-05-24 23:11:33] [INFO ] Added : 18 causal constraints over 4 iterations in 199 ms. Result :sat
Minimization took 391 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 463
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 177 transition count 462
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 177 transition count 462
Applied a total of 17 rules in 17 ms. Remains 177 /183 variables (removed 6) and now considering 462/468 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 177/183 places, 462/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3642827350485377310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6783470314387051144.kers'
[2026-05-24 23:11:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3642827350485377310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6783470314387051144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 177 cols 1044 entries
Finished phase 1 with 155 SingleSign rule and 10 generalized
[2026-05-24 23:11:33] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6783470314387051144.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17316 resets) in 2201 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (1651 resets) in 513 ms. (1945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:11:36] [INFO ] Invariant cache hit.
[2026-05-24 23:11:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:11:36] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:11:36] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 23:11:36] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:11:36] [INFO ] [Real]Added 416 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:11:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:11:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:11:36] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:11:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:11:36] [INFO ] [Nat]Added 416 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:11:36] [INFO ] Computed and/alt/rep : 316/1000/316 causal constraints (skipped 136 transitions) in 21 ms.
[2026-05-24 23:11:36] [INFO ] Added : 9 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 177/177 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-24 23:11:37] [INFO ] Invariant cache hit.
[2026-05-24 23:11:37] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 23:11:37] [INFO ] Invariant cache hit.
[2026-05-24 23:11:37] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:11:39] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2026-05-24 23:11:39] [INFO ] Redundant transitions in 5 ms returned []
Running 452 sub problems to find dead transitions.
[2026-05-24 23:11:39] [INFO ] Invariant cache hit.
[2026-05-24 23:11:39] [INFO ] State equation strengthened by 416 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 462/638 variables, 176/268 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 416/684 constraints. Problems are: Problem set: 7 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/639 variables, and 684 constraints, problems are : Problem set: 7 solved, 445 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 7 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 7 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 80/92 constraints. Problems are: Problem set: 7 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/92 constraints. Problems are: Problem set: 7 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 462/638 variables, 176/268 constraints. Problems are: Problem set: 7 solved, 445 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 416/684 constraints. Problems are: Problem set: 28 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 424/1108 constraints. Problems are: Problem set: 28 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/639 variables, and 1108 constraints, problems are : Problem set: 28 solved, 424 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 424/452 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 28 solved, 424 unsolved
Search for dead transitions found 28 dead transitions in 60090ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 434/462 transitions.
Graph (complete) has 760 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 159 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 159 transition count 400
Applied a total of 35 rules in 7 ms. Remains 159 /177 variables (removed 18) and now considering 400/434 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18112622991736805679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12920336709338300981.kers'
[2026-05-24 23:12:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18112622991736805679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12920336709338300981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 159 cols 869 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-24 23:12:39] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12920336709338300981.kers
Total runtime 2 ms.
[2026-05-24 23:12:39] [INFO ] Implicit Places using invariants in 104 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 115 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/177 places, 400/462 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 155 transition count 398
Applied a total of 20 rules in 15 ms. Remains 155 /157 variables (removed 2) and now considering 398/400 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5925153727926216465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9079904152632000672.kers'
[2026-05-24 23:12:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5925153727926216465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9079904152632000672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:12:39] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9079904152632000672.kers
Total runtime 1 ms.
[2026-05-24 23:12:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 23:12:39] [INFO ] Invariant cache hit.
[2026-05-24 23:12:39] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:12:41] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/177 places, 398/462 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 64354 ms. Remains : 155/177 places, 398/462 transitions.
[2026-05-24 23:12:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20400 resets) in 2103 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (1838 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:12:44] [INFO ] Invariant cache hit.
[2026-05-24 23:12:44] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:12:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:12:44] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:12:44] [INFO ] [Real]Added 353 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:12:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:12:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:12:44] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-24 23:12:44] [INFO ] [Nat]Added 353 Read/Feed constraints in 48 ms returned sat
[2026-05-24 23:12:44] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:12:44] [INFO ] Added : 9 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:12:44] [INFO ] Invariant cache hit.
[2026-05-24 23:12:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 23:12:44] [INFO ] Invariant cache hit.
[2026-05-24 23:12:44] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:12:46] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2026-05-24 23:12:46] [INFO ] Redundant transitions in 5 ms returned []
Running 388 sub problems to find dead transitions.
[2026-05-24 23:12:46] [INFO ] Invariant cache hit.
[2026-05-24 23:12:46] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/552 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 353/519 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/552 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 353/519 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 388/907 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (OVERLAPS) 1/553 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 908 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62239 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:13:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:13:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:13:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17268764710462880842.gal : 1 ms
[2026-05-24 23:13:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17044474365027926499.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/ReachabilityCardinality17268764710462880842.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17044474365027926499.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/ReachabilityCardinality17044474365027926499.prop.
RANDOM walk for 40000 steps (812 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
BEST_FIRST walk for 40004 steps (70 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 278
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :278 after 334
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :334 after 433
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :433 after 1377
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1377 after 4240
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4240 after 24655
Interrupted probabilistic random walk after 1399802 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :0 out of 2
Probabilistic random walk after 1399802 steps, saw 167040 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
[2026-05-24 23:13:50] [INFO ] Invariant cache hit.
[2026-05-24 23:13:50] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24655 after 249694
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 271/517 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 233/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/517 variables, 74/252 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 233/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (801 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (75 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1805398 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :0 out of 1
Probabilistic random walk after 1805398 steps, saw 216740 distinct states, run finished after 3001 ms. (steps per millisecond=601 ) properties seen :0
[2026-05-24 23:13:53] [INFO ] Invariant cache hit.
[2026-05-24 23:13:53] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/517 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 233/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 233/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:13:54] [INFO ] Invariant cache hit.
[2026-05-24 23:13:54] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-24 23:13:54] [INFO ] Invariant cache hit.
[2026-05-24 23:13:54] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:13:56] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2026-05-24 23:13:56] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2343 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-759608922394235500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8349212727271412572.kers'
[2026-05-24 23:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-759608922394235500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8349212727271412572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:13:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8349212727271412572.kers
Total runtime 1 ms.
[2026-05-24 23:13:56] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:13:56] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:13:56] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:13:56] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:13:56] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:13:56] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17248829932656443540.gal : 1 ms
[2026-05-24 23:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12750688683252430485.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/ReachabilityCardinality17248829932656443540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12750688683252430485.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/ReachabilityCardinality12750688683252430485.prop.
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 3 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,9,0.001737,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.002062,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 68 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:13:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:13:56] [INFO ] Applying decomposition
[2026-05-24 23:13:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12950459134453863910.txt' '-o' '/tmp/graph12950459134453863910.bin' '-w' '/tmp/graph12950459134453863910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12950459134453863910.bin' '-l' '-1' '-v' '-w' '/tmp/graph12950459134453863910.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:13:56] [INFO ] Decomposing Gal with order
[2026-05-24 23:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:13:56] [INFO ] Removed a total of 326 redundant transitions.
[2026-05-24 23:13:56] [INFO ] Flatten gal took : 16 ms
[2026-05-24 23:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 5 ms.
[2026-05-24 23:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18064906581183083561.gal : 3 ms
[2026-05-24 23:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11627219441913435046.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/ReachabilityCardinality18064906581183083561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11627219441913435046.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality11627219441913435046.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 202
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :202 after 202
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :202 after 202
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :202 after 202
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :202 after 202
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :202 after 301
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :301 after 12472
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12472 after 158558
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :158558 after 1.32143e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.32143e+06 after 3.21139e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14901532696183719662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10984853668952871767.kers'
[2026-05-24 23:14:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14901532696183719662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10984853668952871767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:14:46] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10984853668952871767.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20350 resets) in 2102 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (1846 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:14:49] [INFO ] Invariant cache hit.
[2026-05-24 23:14:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:14:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-24 23:14:49] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:14:49] [INFO ] [Real]Added 353 Read/Feed constraints in 25 ms returned sat
[2026-05-24 23:14:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:14:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:14:49] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:14:49] [INFO ] [Nat]Added 353 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:14:49] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 15 ms.
[2026-05-24 23:14:49] [INFO ] Added : 9 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:14:50] [INFO ] Invariant cache hit.
[2026-05-24 23:14:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 23:14:50] [INFO ] Invariant cache hit.
[2026-05-24 23:14:50] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:14:52] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
[2026-05-24 23:14:52] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2169 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:14:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:14:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:14:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2361844295597462055.gal : 7 ms
[2026-05-24 23:14:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18196209254474815245.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/ReachabilityCardinality2361844295597462055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18196209254474815245.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/ReachabilityCardinality18196209254474815245.prop.
RANDOM walk for 40000 steps (812 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 36
BEST_FIRST walk for 40003 steps (72 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
BEST_FIRST walk for 40003 steps (73 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 278
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :278 after 334
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :334 after 433
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :433 after 1377
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1377 after 4240
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4240 after 24655
Interrupted probabilistic random walk after 1231404 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 2
Probabilistic random walk after 1231404 steps, saw 145711 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
[2026-05-24 23:14:55] [INFO ] Invariant cache hit.
[2026-05-24 23:14:55] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24655 after 249694
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 271/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 233/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 271/517 variables, 74/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 233/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 22 (OVERLAPS) 36/553 variables, 36/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/553 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/553 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 811ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (822 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (72 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1670585 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :0 out of 1
Probabilistic random walk after 1670585 steps, saw 203112 distinct states, run finished after 3003 ms. (steps per millisecond=556 ) properties seen :0
[2026-05-24 23:14:59] [INFO ] Invariant cache hit.
[2026-05-24 23:14:59] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/517 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 233/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 233/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:14:59] [INFO ] Invariant cache hit.
[2026-05-24 23:14:59] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 23:14:59] [INFO ] Invariant cache hit.
[2026-05-24 23:15:00] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:15:02] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2026-05-24 23:15:02] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2221 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17627270708061584331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-208873858623387831.kers'
[2026-05-24 23:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17627270708061584331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-208873858623387831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:15:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-208873858623387831.kers
Total runtime 1 ms.
[2026-05-24 23:15:02] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:15:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:15:02] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:15:02] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:15:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:15:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10391008730773903748.gal : 0 ms
[2026-05-24 23:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8202573297517180552.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/ReachabilityCardinality10391008730773903748.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8202573297517180552.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/ReachabilityCardinality8202573297517180552.prop.
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 3 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,9,0.005634,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.006417,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 67 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:15:02] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:15:02] [INFO ] Applying decomposition
[2026-05-24 23:15:02] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18200245413353194090.txt' '-o' '/tmp/graph18200245413353194090.bin' '-w' '/tmp/graph18200245413353194090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18200245413353194090.bin' '-l' '-1' '-v' '-w' '/tmp/graph18200245413353194090.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:15:02] [INFO ] Decomposing Gal with order
[2026-05-24 23:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:15:02] [INFO ] Removed a total of 324 redundant transitions.
[2026-05-24 23:15:02] [INFO ] Flatten gal took : 17 ms
[2026-05-24 23:15:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 4 ms.
[2026-05-24 23:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality226904633495557891.gal : 3 ms
[2026-05-24 23:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9703829008870661612.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/ReachabilityCardinality226904633495557891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9703829008870661612.prop' '--nowitness'
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 ...306
Loading property file /tmp/ReachabilityCardinality9703829008870661612.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 2655
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2655 after 31692
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31692 after 394868
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :394868 after 7.55566e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.0919e+09 after 1.10078e+09
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\_mod\_flat,1.1997e+09,48.9768,1034388,32041,7045,1.65832e+06,37196,916,3.23342e+06,359,531600,0
Total reachable state count : 1199702837
Verifying 1 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,48.9892,1034388,1,0,1.65832e+06,37196,919,3.23342e+06,361,531600,0
FORMULA CANInsertWithFailure-PT-010-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5042589589394438809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4144121457438058987.kers'
[2026-05-24 23:15:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5042589589394438809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4144121457438058987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:15:51] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4144121457438058987.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (20300 resets) in 2091 ms. (478 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:[]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 261041 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10494590299410700599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6883964342606656234.kers'
[2026-05-24 23:15:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10494590299410700599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6883964342606656234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:15:53] [INFO ] Computed 12 invariants in 9 ms
Computed 12 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6883964342606656234.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (169 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:15:53] [INFO ] Invariant cache hit.
[2026-05-24 23:15:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:15:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:15:53] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:15:53] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:15:53] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:15:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:15:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:15:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:15:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-24 23:15:53] [INFO ] [Nat]Added 401 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:15:53] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:15:53] [INFO ] Added : 7 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 385 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 463
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 177 transition count 462
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 177 transition count 462
Applied a total of 17 rules in 14 ms. Remains 177 /183 variables (removed 6) and now considering 462/468 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 177/183 places, 462/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17182129350056597798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6881709984419909169.kers'
[2026-05-24 23:15:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17182129350056597798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6881709984419909169.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 177 cols 1044 entries
Finished phase 1 with 155 SingleSign rule and 10 generalized
[2026-05-24 23:15:54] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6881709984419909169.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17392 resets) in 2171 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (1670 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:15:57] [INFO ] Invariant cache hit.
[2026-05-24 23:15:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:15:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:15:57] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:15:57] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:15:57] [INFO ] [Real]Added 416 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:15:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:15:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:15:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:15:57] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:15:57] [INFO ] [Nat]Added 416 Read/Feed constraints in 37 ms returned sat
[2026-05-24 23:15:57] [INFO ] Computed and/alt/rep : 316/1000/316 causal constraints (skipped 136 transitions) in 21 ms.
[2026-05-24 23:15:57] [INFO ] Added : 11 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 379 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 177/177 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-24 23:15:57] [INFO ] Invariant cache hit.
[2026-05-24 23:15:58] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 23:15:58] [INFO ] Invariant cache hit.
[2026-05-24 23:15:58] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:15:59] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2026-05-24 23:15:59] [INFO ] Redundant transitions in 8 ms returned []
Running 452 sub problems to find dead transitions.
[2026-05-24 23:15:59] [INFO ] Invariant cache hit.
[2026-05-24 23:15:59] [INFO ] State equation strengthened by 416 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 462/638 variables, 176/269 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 416/685 constraints. Problems are: Problem set: 3 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/639 variables, and 685 constraints, problems are : Problem set: 3 solved, 449 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 81/93 constraints. Problems are: Problem set: 3 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/94 constraints. Problems are: Problem set: 3 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 449 unsolved
At refinement iteration 5 (OVERLAPS) 462/638 variables, 176/270 constraints. Problems are: Problem set: 3 solved, 449 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 416/686 constraints. Problems are: Problem set: 28 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 424/1110 constraints. Problems are: Problem set: 28 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/639 variables, and 1110 constraints, problems are : Problem set: 28 solved, 424 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 424/452 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 28 solved, 424 unsolved
Search for dead transitions found 28 dead transitions in 60092ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 434/462 transitions.
Graph (complete) has 760 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 159 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 159 transition count 400
Applied a total of 35 rules in 6 ms. Remains 159 /177 variables (removed 18) and now considering 400/434 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10564874609669095681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11195214018564476942.kers'
[2026-05-24 23:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10564874609669095681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11195214018564476942.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 159 cols 869 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-24 23:16:59] [INFO ] Computed 13 invariants in 4 ms
Computed 13 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11195214018564476942.kers
Total runtime 6 ms.
[2026-05-24 23:16:59] [INFO ] Implicit Places using invariants in 106 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/177 places, 400/462 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 155 transition count 398
Applied a total of 20 rules in 14 ms. Remains 155 /157 variables (removed 2) and now considering 398/400 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4299561294044856267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4001037252421768597.kers'
[2026-05-24 23:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4299561294044856267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4001037252421768597.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:16:59] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4001037252421768597.kers
Total runtime 2 ms.
[2026-05-24 23:17:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 23:17:00] [INFO ] Invariant cache hit.
[2026-05-24 23:17:00] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:17:01] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/177 places, 398/462 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63577 ms. Remains : 155/177 places, 398/462 transitions.
[2026-05-24 23:17:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20338 resets) in 2112 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (1844 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:17:04] [INFO ] Invariant cache hit.
[2026-05-24 23:17:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:17:04] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:17:04] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:17:04] [INFO ] [Real]Added 353 Read/Feed constraints in 25 ms returned sat
[2026-05-24 23:17:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:17:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:17:04] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-24 23:17:04] [INFO ] [Nat]Added 353 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:17:04] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 15 ms.
[2026-05-24 23:17:04] [INFO ] Added : 7 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:17:04] [INFO ] Invariant cache hit.
[2026-05-24 23:17:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 23:17:04] [INFO ] Invariant cache hit.
[2026-05-24 23:17:04] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:17:06] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2026-05-24 23:17:06] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1557 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:17:06] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:17:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:17:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6198096739315567939.gal : 2 ms
[2026-05-24 23:17:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10312434417474030504.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/ReachabilityCardinality6198096739315567939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10312434417474030504.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/ReachabilityCardinality10312434417474030504.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 283
RANDOM walk for 40000 steps (813 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (77 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (69 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :283 after 387
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :387 after 1249
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1249 after 2755
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2755 after 13914
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13914 after 53296
Interrupted probabilistic random walk after 1386049 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 2
Probabilistic random walk after 1386049 steps, saw 165542 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2026-05-24 23:17:09] [INFO ] Invariant cache hit.
[2026-05-24 23:17:09] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 270/517 variables, 74/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 232/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (811 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :53296 after 321213
Interrupted probabilistic random walk after 1794734 steps, run timeout after 3001 ms. (steps per millisecond=598 ) properties seen :0 out of 1
Probabilistic random walk after 1794734 steps, saw 215761 distinct states, run finished after 3001 ms. (steps per millisecond=598 ) properties seen :0
[2026-05-24 23:17:13] [INFO ] Invariant cache hit.
[2026-05-24 23:17:13] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 270/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 232/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:17:13] [INFO ] Invariant cache hit.
[2026-05-24 23:17:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 23:17:13] [INFO ] Invariant cache hit.
[2026-05-24 23:17:13] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:17:15] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2026-05-24 23:17:15] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1582 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 3 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5891574831939889438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7280946978039098814.kers'
[2026-05-24 23:17:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5891574831939889438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7280946978039098814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:17:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7280946978039098814.kers
Total runtime 0 ms.
[2026-05-24 23:17:15] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:17:15] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:17:15] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:17:15] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:17:15] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:17:15] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:17:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10162782879857584199.gal : 0 ms
[2026-05-24 23:17:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4418518409965186496.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/ReachabilityCardinality10162782879857584199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4418518409965186496.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/ReachabilityCardinality4418518409965186496.prop.
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 3 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,9,0.001932,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.002203,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 48 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:17:15] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:17:15] [INFO ] Applying decomposition
[2026-05-24 23:17:15] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2462262073770820136.txt' '-o' '/tmp/graph2462262073770820136.bin' '-w' '/tmp/graph2462262073770820136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2462262073770820136.bin' '-l' '-1' '-v' '-w' '/tmp/graph2462262073770820136.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:17:15] [INFO ] Decomposing Gal with order
[2026-05-24 23:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:17:15] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:17:15] [INFO ] Flatten gal took : 17 ms
[2026-05-24 23:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 4 ms.
[2026-05-24 23:17:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3279910818627330451.gal : 3 ms
[2026-05-24 23:17:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4435420767003487354.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/ReachabilityCardinality3279910818627330451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4435420767003487354.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality4435420767003487354.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 1871
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1871 after 28811
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28811 after 279910
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :279910 after 4.60855e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.47288e+08 after 3.47297e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4515039213708264623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3762384082380216406.kers'
[2026-05-24 23:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4515039213708264623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3762384082380216406.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:18:05] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3762384082380216406.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20349 resets) in 2106 ms. (474 steps per ms)
BEST_FIRST walk for 1000001 steps (1845 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:18:07] [INFO ] Invariant cache hit.
[2026-05-24 23:18:07] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:18:08] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 23:18:08] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:18:08] [INFO ] [Real]Added 353 Read/Feed constraints in 24 ms returned sat
[2026-05-24 23:18:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:18:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:18:08] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-24 23:18:08] [INFO ] [Nat]Added 353 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:18:08] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:18:08] [INFO ] Added : 7 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:18:08] [INFO ] Invariant cache hit.
[2026-05-24 23:18:08] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 23:18:08] [INFO ] Invariant cache hit.
[2026-05-24 23:18:08] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:18:10] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2026-05-24 23:18:10] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:18:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:18:10] [INFO ] Flatten gal took : 21 ms
[2026-05-24 23:18:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6901529168433301351.gal : 1 ms
[2026-05-24 23:18:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13211034883317098675.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/ReachabilityCardinality6901529168433301351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13211034883317098675.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
RANDOM walk for 40000 steps (807 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13211034883317098675.prop.
BEST_FIRST walk for 40004 steps (75 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (73 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 283
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :283 after 387
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :387 after 1249
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1249 after 2755
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2755 after 13914
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13914 after 53296
Interrupted probabilistic random walk after 1391290 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 2
Probabilistic random walk after 1391290 steps, saw 166295 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2026-05-24 23:18:13] [INFO ] Invariant cache hit.
[2026-05-24 23:18:13] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 2 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 270/517 variables, 74/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 232/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (807 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :53296 after 321213
Interrupted probabilistic random walk after 1788775 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :0 out of 1
Probabilistic random walk after 1788775 steps, saw 215251 distinct states, run finished after 3002 ms. (steps per millisecond=595 ) properties seen :0
[2026-05-24 23:18:17] [INFO ] Invariant cache hit.
[2026-05-24 23:18:17] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 270/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 232/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:18:17] [INFO ] Invariant cache hit.
[2026-05-24 23:18:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 23:18:17] [INFO ] Invariant cache hit.
[2026-05-24 23:18:17] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:18:19] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2026-05-24 23:18:19] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1624 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 1 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11027855350251718046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12346329171230488145.kers'
[2026-05-24 23:18:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11027855350251718046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12346329171230488145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:18:19] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12346329171230488145.kers
Total runtime 0 ms.
[2026-05-24 23:18:19] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:18:19] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:18:19] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:18:19] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:18:19] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:18:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:18:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4884045924653675185.gal : 0 ms
[2026-05-24 23:18:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12374928640146794134.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/ReachabilityCardinality4884045924653675185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12374928640146794134.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/ReachabilityCardinality12374928640146794134.prop.
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 3 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,9,0.001593,3996,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.00183,4164,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:18:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:18:19] [INFO ] Applying decomposition
[2026-05-24 23:18:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8502904970972409892.txt' '-o' '/tmp/graph8502904970972409892.bin' '-w' '/tmp/graph8502904970972409892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8502904970972409892.bin' '-l' '-1' '-v' '-w' '/tmp/graph8502904970972409892.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:18:19] [INFO ] Decomposing Gal with order
[2026-05-24 23:18:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:18:19] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:18:19] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 4 ms.
[2026-05-24 23:18:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5917424595245802340.gal : 3 ms
[2026-05-24 23:18:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14859022570298655749.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/ReachabilityCardinality5917424595245802340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14859022570298655749.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality14859022570298655749.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :328 after 4179
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4179 after 27382
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :27382 after 585926
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :585926 after 7.92634e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4195201842406167001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7136596084322011181.kers'
[2026-05-24 23:19:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4195201842406167001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7136596084322011181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:19:09] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7136596084322011181.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (20336 resets) in 2100 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (1858 resets) in 470 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-24 23:19:12] [INFO ] Invariant cache hit.
[2026-05-24 23:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:19:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 23:19:12] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:19:12] [INFO ] [Real]Added 353 Read/Feed constraints in 23 ms returned sat
[2026-05-24 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:19:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:19:12] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-24 23:19:12] [INFO ] [Nat]Added 353 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:19:12] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 18 ms.
[2026-05-24 23:19:12] [INFO ] Added : 7 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:19:12] [INFO ] Invariant cache hit.
[2026-05-24 23:19:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 23:19:12] [INFO ] Invariant cache hit.
[2026-05-24 23:19:12] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:19:14] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2026-05-24 23:19:14] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1570 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:19:14] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:19:14] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:19:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14701889994256966973.gal : 1 ms
[2026-05-24 23:19:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4225443138465220128.prop : 4 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/ReachabilityCardinality14701889994256966973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4225443138465220128.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
RANDOM walk for 40000 steps (814 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (76 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (66 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4225443138465220128.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 283
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :283 after 387
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :387 after 1249
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1249 after 2755
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2755 after 13914
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13914 after 53296
Interrupted probabilistic random walk after 1372244 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 2
Probabilistic random walk after 1372244 steps, saw 164282 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
[2026-05-24 23:19:17] [INFO ] Invariant cache hit.
[2026-05-24 23:19:17] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 270/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 232/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 813ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (806 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (73 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :53296 after 321213
Interrupted probabilistic random walk after 1348021 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 2
Probabilistic random walk after 1348021 steps, saw 160576 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
[2026-05-24 23:19:21] [INFO ] Invariant cache hit.
[2026-05-24 23:19:21] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 270/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 232/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/238 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/247 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 270/517 variables, 74/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 232/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:19:22] [INFO ] Invariant cache hit.
[2026-05-24 23:19:22] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 23:19:22] [INFO ] Invariant cache hit.
[2026-05-24 23:19:22] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:19:24] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
[2026-05-24 23:19:24] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1647 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8190576943613415195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3648645308419158220.kers'
[2026-05-24 23:19:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8190576943613415195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3648645308419158220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:19:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3648645308419158220.kers
Total runtime 0 ms.
[2026-05-24 23:19:24] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:19:24] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:19:24] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:19:24] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:19:24] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:19:24] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:19:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:19:24] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:19:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16750760219432695653.gal : 0 ms
[2026-05-24 23:19:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality380704079710720171.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/ReachabilityCardinality16750760219432695653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality380704079710720171.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/ReachabilityCardinality380704079710720171.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :6 after 9
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,20,0.001912,4148,2,10,10,87,6,0,14,87,0
Total reachable state count : 20
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.002062,4176,2,3,10,87,7,0,17,87,0
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.002161,4176,2,3,10,87,8,0,19,87,0
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:19:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:19:24] [INFO ] Applying decomposition
[2026-05-24 23:19:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9877351311220864851.txt' '-o' '/tmp/graph9877351311220864851.bin' '-w' '/tmp/graph9877351311220864851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9877351311220864851.bin' '-l' '-1' '-v' '-w' '/tmp/graph9877351311220864851.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:19:24] [INFO ] Decomposing Gal with order
[2026-05-24 23:19:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:19:24] [INFO ] Removed a total of 324 redundant transitions.
[2026-05-24 23:19:24] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 4 ms.
[2026-05-24 23:19:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10222859441847385628.gal : 2 ms
[2026-05-24 23:19:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11840578931436754350.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/ReachabilityCardinality10222859441847385628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11840578931436754350.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality11840578931436754350.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :60 after 468
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :468 after 2682
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2682 after 202663
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :202663 after 3.0547e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.0547e+06 after 7.31212e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03 in 260782 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16688457503566585224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14894866441472664149.kers'
[2026-05-24 23:20:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16688457503566585224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14894866441472664149.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:20:14] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14894866441472664149.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (168 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:20:14] [INFO ] Invariant cache hit.
[2026-05-24 23:20:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:20:14] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:20:14] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:20:14] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:20:14] [INFO ] [Real]Added 401 Read/Feed constraints in 29 ms returned sat
[2026-05-24 23:20:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:20:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 23:20:14] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:20:14] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-24 23:20:14] [INFO ] [Nat]Added 401 Read/Feed constraints in 38 ms returned sat
[2026-05-24 23:20:14] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:20:14] [INFO ] Added : 13 causal constraints over 3 iterations in 148 ms. Result :sat
Minimization took 462 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 179 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 179 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 178 transition count 463
Applied a total of 16 rules in 15 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12428686173533393354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3244683495319288042.kers'
[2026-05-24 23:20:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12428686173533393354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3244683495319288042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:20:15] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3244683495319288042.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17261 resets) in 2170 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (1658 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:20:17] [INFO ] Invariant cache hit.
[2026-05-24 23:20:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:20:18] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:20:18] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-24 23:20:18] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:20:18] [INFO ] [Real]Added 415 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:20:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:20:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:20:18] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:20:18] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:20:18] [INFO ] [Nat]Added 415 Read/Feed constraints in 40 ms returned sat
[2026-05-24 23:20:18] [INFO ] Computed and/alt/rep : 318/1005/318 causal constraints (skipped 135 transitions) in 19 ms.
[2026-05-24 23:20:18] [INFO ] Added : 10 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 419 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:20:18] [INFO ] Invariant cache hit.
[2026-05-24 23:20:19] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 23:20:19] [INFO ] Invariant cache hit.
[2026-05-24 23:20:19] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:20:20] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2026-05-24 23:20:20] [INFO ] Redundant transitions in 9 ms returned []
Running 453 sub problems to find dead transitions.
[2026-05-24 23:20:20] [INFO ] Invariant cache hit.
[2026-05-24 23:20:20] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 8 (OVERLAPS) 463/640 variables, 177/271 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 415/686 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/641 variables, and 686 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (OVERLAPS) 463/640 variables, 177/272 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 415/687 constraints. Problems are: Problem set: 28 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 425/1112 constraints. Problems are: Problem set: 28 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/641 variables, and 1112 constraints, problems are : Problem set: 28 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 425/453 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 28 solved, 425 unsolved
Search for dead transitions found 28 dead transitions in 60096ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/178 places, 435/463 transitions.
Graph (complete) has 760 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 160 transition count 401
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 160 transition count 401
Applied a total of 35 rules in 6 ms. Remains 160 /178 variables (removed 18) and now considering 401/435 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10812290029338647356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4955546883316246159.kers'
[2026-05-24 23:21:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10812290029338647356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4955546883316246159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 160 cols 871 entries
Finished phase 1 with 145 SingleSign rule and 2 generalized
[2026-05-24 23:21:21] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4955546883316246159.kers
Total runtime 2 ms.
[2026-05-24 23:21:21] [INFO ] Implicit Places using invariants in 93 ms returned [6, 58]
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 2 : 158/178 places, 401/463 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 156 transition count 399
Applied a total of 20 rules in 15 ms. Remains 156 /158 variables (removed 2) and now considering 399/401 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-707880075504930161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10568124336601889832.kers'
[2026-05-24 23:21:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-707880075504930161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10568124336601889832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:21:21] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10568124336601889832.kers
Total runtime 2 ms.
[2026-05-24 23:21:21] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 23:21:21] [INFO ] Invariant cache hit.
[2026-05-24 23:21:21] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:21:22] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/178 places, 399/463 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63565 ms. Remains : 156/178 places, 399/463 transitions.
[2026-05-24 23:21:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20229 resets) in 2144 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (1856 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:21:25] [INFO ] Invariant cache hit.
[2026-05-24 23:21:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:21:25] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 23:21:25] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:21:25] [INFO ] [Real]Added 352 Read/Feed constraints in 25 ms returned sat
[2026-05-24 23:21:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:21:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:21:25] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-24 23:21:25] [INFO ] [Nat]Added 352 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:21:25] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 16 ms.
[2026-05-24 23:21:25] [INFO ] Added : 9 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:21:25] [INFO ] Invariant cache hit.
[2026-05-24 23:21:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 23:21:25] [INFO ] Invariant cache hit.
[2026-05-24 23:21:25] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:21:26] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2026-05-24 23:21:26] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2026-05-24 23:21:26] [INFO ] Invariant cache hit.
[2026-05-24 23:21:26] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 399/554 variables, 155/167 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 352/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/554 variables, 155/168 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 352/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/555 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61318 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:22:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:22:27] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:22:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8366434941773872925.gal : 1 ms
[2026-05-24 23:22:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7208342369406780423.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/ReachabilityCardinality8366434941773872925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7208342369406780423.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/ReachabilityCardinality7208342369406780423.prop.
RANDOM walk for 40000 steps (809 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
BEST_FIRST walk for 40004 steps (71 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 274
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :274 after 313
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :313 after 400
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :400 after 1324
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1324 after 4138
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4138 after 23294
Interrupted probabilistic random walk after 1339199 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 2
Probabilistic random walk after 1339199 steps, saw 159124 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2026-05-24 23:22:30] [INFO ] Invariant cache hit.
[2026-05-24 23:22:30] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/241 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (814 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (74 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1768497 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :0 out of 1
Probabilistic random walk after 1768497 steps, saw 213002 distinct states, run finished after 3001 ms. (steps per millisecond=589 ) properties seen :0
[2026-05-24 23:22:33] [INFO ] Invariant cache hit.
[2026-05-24 23:22:33] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:22:34] [INFO ] Invariant cache hit.
[2026-05-24 23:22:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 23:22:34] [INFO ] Invariant cache hit.
[2026-05-24 23:22:34] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:22:35] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2026-05-24 23:22:35] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1281 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 3 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11963913197380015769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14369247900169438171.kers'
[2026-05-24 23:22:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11963913197380015769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14369247900169438171.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:22:35] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14369247900169438171.kers
Total runtime 0 ms.
[2026-05-24 23:22:35] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:22:35] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 23:22:35] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:22:35] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:22:35] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:22:35] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:22:35] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:22:35] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9448693523539911860.gal : 0 ms
[2026-05-24 23:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16799954630164114795.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/ReachabilityCardinality9448693523539911860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16799954630164114795.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/ReachabilityCardinality16799954630164114795.prop.
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 3 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,9,0.005209,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.005862,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 63 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:22:35] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:22:35] [INFO ] Applying decomposition
[2026-05-24 23:22:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4594730473664562318.txt' '-o' '/tmp/graph4594730473664562318.bin' '-w' '/tmp/graph4594730473664562318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4594730473664562318.bin' '-l' '-1' '-v' '-w' '/tmp/graph4594730473664562318.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:22:35] [INFO ] Decomposing Gal with order
[2026-05-24 23:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:22:35] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:22:35] [INFO ] Flatten gal took : 14 ms
[2026-05-24 23:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 4 ms.
[2026-05-24 23:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1368224150325703111.gal : 3 ms
[2026-05-24 23:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2034341918016817698.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/ReachabilityCardinality1368224150325703111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2034341918016817698.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality2034341918016817698.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 345
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :345 after 362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :362 after 84800
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :84800 after 532945
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :532945 after 3.29089e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.3695e+08 after 5.62886e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16679952724980054689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9816352611334892686.kers'
[2026-05-24 23:23:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16679952724980054689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9816352611334892686.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:23:25] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9816352611334892686.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20279 resets) in 2150 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (1860 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:23:28] [INFO ] Invariant cache hit.
[2026-05-24 23:23:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:23:28] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:23:28] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:23:28] [INFO ] [Real]Added 352 Read/Feed constraints in 23 ms returned sat
[2026-05-24 23:23:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:23:28] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:23:28] [INFO ] [Nat]Added 352 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:23:28] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 15 ms.
[2026-05-24 23:23:28] [INFO ] Added : 9 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:23:28] [INFO ] Invariant cache hit.
[2026-05-24 23:23:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 23:23:29] [INFO ] Invariant cache hit.
[2026-05-24 23:23:29] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:23:30] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2026-05-24 23:23:30] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:23:30] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:23:30] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:23:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9668996789710264695.gal : 1 ms
[2026-05-24 23:23:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1888857302861541634.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/ReachabilityCardinality9668996789710264695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1888857302861541634.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
RANDOM walk for 40000 steps (824 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1888857302861541634.prop.
BEST_FIRST walk for 40004 steps (68 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 274
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :274 after 313
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :313 after 400
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :400 after 1324
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1324 after 4138
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4138 after 23294
Interrupted probabilistic random walk after 1362274 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 2
Probabilistic random walk after 1362274 steps, saw 162560 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2026-05-24 23:23:33] [INFO ] Invariant cache hit.
[2026-05-24 23:23:33] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 746ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (803 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (67 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1779194 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :0 out of 1
Probabilistic random walk after 1779194 steps, saw 214266 distinct states, run finished after 3001 ms. (steps per millisecond=592 ) properties seen :0
[2026-05-24 23:23:37] [INFO ] Invariant cache hit.
[2026-05-24 23:23:37] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:23:37] [INFO ] Invariant cache hit.
[2026-05-24 23:23:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:23:37] [INFO ] Invariant cache hit.
[2026-05-24 23:23:37] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:23:38] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2026-05-24 23:23:38] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-470120689085016930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5897430384471543411.kers'
[2026-05-24 23:23:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-470120689085016930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5897430384471543411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:23:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5897430384471543411.kers
Total runtime 0 ms.
[2026-05-24 23:23:38] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:23:38] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 23:23:38] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:23:38] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:23:38] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:23:38] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:23:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:23:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:23:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16790469141669409893.gal : 0 ms
[2026-05-24 23:23:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13961370442524208146.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/ReachabilityCardinality16790469141669409893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13961370442524208146.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/ReachabilityCardinality13961370442524208146.prop.
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 3 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,9,0.001848,3992,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.002174,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 51 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:23:38] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:23:38] [INFO ] Applying decomposition
[2026-05-24 23:23:38] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12135004645501402793.txt' '-o' '/tmp/graph12135004645501402793.bin' '-w' '/tmp/graph12135004645501402793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12135004645501402793.bin' '-l' '-1' '-v' '-w' '/tmp/graph12135004645501402793.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:23:39] [INFO ] Decomposing Gal with order
[2026-05-24 23:23:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:23:39] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-24 23:23:39] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:23:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 4 ms.
[2026-05-24 23:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17098124621781845033.gal : 3 ms
[2026-05-24 23:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3193592094938924235.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/ReachabilityCardinality17098124621781845033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3193592094938924235.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality3193592094938924235.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 43
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :43 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 546
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :546 after 3023
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3023 after 41938
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :41938 after 329805
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :329805 after 7.63591e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17681277934755663852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-185769516751738890.kers'
[2026-05-24 23:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17681277934755663852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-185769516751738890.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:24:29] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-185769516751738890.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (20332 resets) in 2119 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (1866 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-24 23:24:31] [INFO ] Invariant cache hit.
[2026-05-24 23:24:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:24:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:24:31] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:24:31] [INFO ] [Real]Added 352 Read/Feed constraints in 23 ms returned sat
[2026-05-24 23:24:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:24:31] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:24:31] [INFO ] [Nat]Added 352 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:24:32] [INFO ] Computed and/alt/rep : 253/839/253 causal constraints (skipped 136 transitions) in 16 ms.
[2026-05-24 23:24:32] [INFO ] Added : 9 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:24:32] [INFO ] Invariant cache hit.
[2026-05-24 23:24:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 23:24:32] [INFO ] Invariant cache hit.
[2026-05-24 23:24:32] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:24:33] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2026-05-24 23:24:33] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1277 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:24:33] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:24:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:24:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11636733639019809120.gal : 2 ms
[2026-05-24 23:24:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14739382392901061167.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/ReachabilityCardinality11636733639019809120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14739382392901061167.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/ReachabilityCardinality14739382392901061167.prop.
RANDOM walk for 40000 steps (805 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 36
BEST_FIRST walk for 40004 steps (72 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
BEST_FIRST walk for 40004 steps (75 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 274
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :274 after 313
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :313 after 400
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :400 after 1324
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1324 after 4138
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4138 after 23294
Interrupted probabilistic random walk after 1394570 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 2
Probabilistic random walk after 1394570 steps, saw 166510 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2026-05-24 23:24:36] [INFO ] Invariant cache hit.
[2026-05-24 23:24:36] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (807 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (73 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1385244 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 2
Probabilistic random walk after 1385244 steps, saw 165511 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2026-05-24 23:24:40] [INFO ] Invariant cache hit.
[2026-05-24 23:24:40] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/507 variables, 72/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 231/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 48/555 variables, 42/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/35 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/186 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/223 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/232 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/507 variables, 72/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 231/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 48/555 variables, 42/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:24:41] [INFO ] Invariant cache hit.
[2026-05-24 23:24:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 23:24:41] [INFO ] Invariant cache hit.
[2026-05-24 23:24:41] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:24:42] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2026-05-24 23:24:42] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13218961696800069500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-946249339965800382.kers'
[2026-05-24 23:24:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13218961696800069500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-946249339965800382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:24:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-946249339965800382.kers
Total runtime 0 ms.
[2026-05-24 23:24:42] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:24:42] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:24:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:24:42] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:24:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:24:42] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:24:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:24:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7690356738033560935.gal : 0 ms
[2026-05-24 23:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14522914873048898589.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/ReachabilityCardinality7690356738033560935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14522914873048898589.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/ReachabilityCardinality14522914873048898589.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :6 after 9
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,20,0.001988,4140,2,10,10,87,6,0,14,87,0
Total reachable state count : 20
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.00214,4168,2,3,10,87,7,0,17,87,0
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.002239,4168,2,3,10,87,8,0,19,87,0
Over-approximation ignoring read arcs solved 0 properties in 63 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:24:42] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:24:42] [INFO ] Applying decomposition
[2026-05-24 23:24:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4709946664043892548.txt' '-o' '/tmp/graph4709946664043892548.bin' '-w' '/tmp/graph4709946664043892548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4709946664043892548.bin' '-l' '-1' '-v' '-w' '/tmp/graph4709946664043892548.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:24:42] [INFO ] Decomposing Gal with order
[2026-05-24 23:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:24:42] [INFO ] Removed a total of 323 redundant transitions.
[2026-05-24 23:24:42] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 5 ms.
[2026-05-24 23:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11265818567899418557.gal : 3 ms
[2026-05-24 23:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17840562238288226392.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/ReachabilityCardinality11265818567899418557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17840562238288226392.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality17840562238288226392.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 290
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :290 after 2627
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2627 after 28131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28131 after 5.31721e+06
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\_mod\_flat,1.21299e+09,25.7231,596204,33408,7698,951507,36285,903,1.98356e+06,346,509038,0
Total reachable state count : 1212991147
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,25.7302,596204,1,0,951507,36285,903,1.98356e+06,347,509038,0
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,25.739,596204,1,0,951507,36285,906,1.98356e+06,348,509038,0
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3808858182177526010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7475528748095831542.kers'
[2026-05-24 23:25:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3808858182177526010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7475528748095831542.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:25:08] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7475528748095831542.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (20270 resets) in 2098 ms. (476 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:[]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-04 in 296506 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17770015429202569435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15215092085490219479.kers'
[2026-05-24 23:25:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17770015429202569435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15215092085490219479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:25:10] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15215092085490219479.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (170 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:25:10] [INFO ] Invariant cache hit.
[2026-05-24 23:25:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:25:10] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:25:10] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:25:10] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:25:10] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:25:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:25:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:25:11] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:25:11] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:25:11] [INFO ] [Nat]Added 401 Read/Feed constraints in 39 ms returned sat
[2026-05-24 23:25:11] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 20 ms.
[2026-05-24 23:25:11] [INFO ] Added : 7 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 450 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 463
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 177 transition count 462
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 177 transition count 462
Applied a total of 17 rules in 12 ms. Remains 177 /183 variables (removed 6) and now considering 462/468 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 177/183 places, 462/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17461813016851859530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12648749580739176358.kers'
[2026-05-24 23:25:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17461813016851859530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12648749580739176358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 177 cols 1044 entries
Finished phase 1 with 155 SingleSign rule and 10 generalized
[2026-05-24 23:25:11] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12648749580739176358.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17327 resets) in 2176 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (1632 resets) in 499 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:25:14] [INFO ] Invariant cache hit.
[2026-05-24 23:25:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:25:14] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:25:14] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:25:14] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:25:14] [INFO ] [Real]Added 416 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:25:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:25:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:25:14] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:25:14] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:25:14] [INFO ] [Nat]Added 416 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:25:14] [INFO ] Computed and/alt/rep : 316/1000/316 causal constraints (skipped 136 transitions) in 19 ms.
[2026-05-24 23:25:14] [INFO ] Added : 9 causal constraints over 2 iterations in 102 ms. Result :sat
Minimization took 376 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 177/177 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-24 23:25:15] [INFO ] Invariant cache hit.
[2026-05-24 23:25:15] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 23:25:15] [INFO ] Invariant cache hit.
[2026-05-24 23:25:15] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:25:16] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2026-05-24 23:25:16] [INFO ] Redundant transitions in 8 ms returned []
Running 452 sub problems to find dead transitions.
[2026-05-24 23:25:16] [INFO ] Invariant cache hit.
[2026-05-24 23:25:16] [INFO ] State equation strengthened by 416 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 462/638 variables, 176/269 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 416/685 constraints. Problems are: Problem set: 8 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/639 variables, and 685 constraints, problems are : Problem set: 8 solved, 444 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 8 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 8 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 81/93 constraints. Problems are: Problem set: 8 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/94 constraints. Problems are: Problem set: 8 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 8 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 462/638 variables, 176/270 constraints. Problems are: Problem set: 8 solved, 444 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 416/686 constraints. Problems are: Problem set: 28 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 424/1110 constraints. Problems are: Problem set: 28 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/639 variables, and 1110 constraints, problems are : Problem set: 28 solved, 424 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 424/452 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 28 solved, 424 unsolved
Search for dead transitions found 28 dead transitions in 60084ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 434/462 transitions.
Graph (complete) has 759 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 159 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 159 transition count 400
Applied a total of 35 rules in 5 ms. Remains 159 /177 variables (removed 18) and now considering 400/434 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14127463880717254567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12540105963027506889.kers'
[2026-05-24 23:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14127463880717254567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12540105963027506889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 159 cols 869 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-24 23:26:16] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12540105963027506889.kers
Total runtime 2 ms.
[2026-05-24 23:26:16] [INFO ] Implicit Places using invariants in 98 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/177 places, 400/462 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 155 transition count 398
Applied a total of 20 rules in 14 ms. Remains 155 /157 variables (removed 2) and now considering 398/400 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15230601799193989368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12625407167803939481.kers'
[2026-05-24 23:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15230601799193989368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12625407167803939481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:26:16] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12625407167803939481.kers
Total runtime 2 ms.
[2026-05-24 23:26:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 23:26:16] [INFO ] Invariant cache hit.
[2026-05-24 23:26:17] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:26:18] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/177 places, 398/462 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63422 ms. Remains : 155/177 places, 398/462 transitions.
[2026-05-24 23:26:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20328 resets) in 2149 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (1802 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:26:21] [INFO ] Invariant cache hit.
[2026-05-24 23:26:21] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-24 23:26:21] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-24 23:26:21] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:26:21] [INFO ] [Real]Added 353 Read/Feed constraints in 25 ms returned sat
[2026-05-24 23:26:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:26:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-24 23:26:21] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-24 23:26:21] [INFO ] [Nat]Added 353 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:26:21] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 15 ms.
[2026-05-24 23:26:21] [INFO ] Added : 3 causal constraints over 1 iterations in 62 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:26:21] [INFO ] Invariant cache hit.
[2026-05-24 23:26:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 23:26:21] [INFO ] Invariant cache hit.
[2026-05-24 23:26:22] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:26:23] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2026-05-24 23:26:23] [INFO ] Redundant transitions in 2 ms returned []
Running 388 sub problems to find dead transitions.
[2026-05-24 23:26:23] [INFO ] Invariant cache hit.
[2026-05-24 23:26:23] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (OVERLAPS) 398/552 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 353/535 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/553 variables, and 536 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 398/552 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 353/538 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 388/926 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 388 unsolved
SMT process timed out in 60059ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61907 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:27:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:27:23] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:27:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3504183673678614.gal : 2 ms
[2026-05-24 23:27:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11212709875181160140.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/ReachabilityCardinality3504183673678614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11212709875181160140.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 ...326
Loading property file /tmp/ReachabilityCardinality11212709875181160140.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 29
RANDOM walk for 40000 steps (819 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 60
BEST_FIRST walk for 40004 steps (71 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (74 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 317
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :317 after 430
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :430 after 1381
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1381 after 4574
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4574 after 24002
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24002 after 121469
Interrupted probabilistic random walk after 1373062 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 2
Probabilistic random walk after 1373062 steps, saw 164422 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
[2026-05-24 23:27:26] [INFO ] Invariant cache hit.
[2026-05-24 23:27:26] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/387 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 16 (OVERLAPS) 166/553 variables, 71/424 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 95/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/387 variables, 7/347 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 7/354 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 166/553 variables, 71/425 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 95/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (819 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (70 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1779112 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :0 out of 1
Probabilistic random walk after 1779112 steps, saw 214253 distinct states, run finished after 3001 ms. (steps per millisecond=592 ) properties seen :0
[2026-05-24 23:27:30] [INFO ] Invariant cache hit.
[2026-05-24 23:27:30] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/387 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 166/553 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 95/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/387 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 7/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 166/553 variables, 71/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 95/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:27:31] [INFO ] Invariant cache hit.
[2026-05-24 23:27:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 23:27:31] [INFO ] Invariant cache hit.
[2026-05-24 23:27:31] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:27:32] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2026-05-24 23:27:32] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 344 transitions.
Graph (complete) has 106 edges and 43 vertex of which 11 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 11 transition count 13
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 4 transition count 6
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 4 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 3 transition count 5
Applied a total of 44 rules in 3 ms. Remains 3 /155 variables (removed 152) and now considering 5/398 (removed 393) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10603090997331563139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4414158028598961712.kers'
[2026-05-24 23:27:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10603090997331563139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4414158028598961712.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 3 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 23:27:32] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4414158028598961712.kers
Total runtime 1 ms.
[2026-05-24 23:27:32] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:27:32] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:27:32] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:27:32] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:27:32] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:27:32] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:27:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6510695803440165727.gal : 0 ms
[2026-05-24 23:27:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4753949978765667257.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/ReachabilityCardinality6510695803440165727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4753949978765667257.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/ReachabilityCardinality4753949978765667257.prop.
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 3 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,6,0.00173,3992,2,6,6,29,6,0,19,17,0
Total reachable state count : 6
Verifying 1 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,1,0.002015,4160,2,4,6,29,7,0,22,17,0
Over-approximation ignoring read arcs solved 0 properties in 55 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:27:32] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:27:32] [INFO ] Applying decomposition
[2026-05-24 23:27:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13913331142234982892.txt' '-o' '/tmp/graph13913331142234982892.bin' '-w' '/tmp/graph13913331142234982892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13913331142234982892.bin' '-l' '-1' '-v' '-w' '/tmp/graph13913331142234982892.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:27:32] [INFO ] Decomposing Gal with order
[2026-05-24 23:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:27:33] [INFO ] Removed a total of 326 redundant transitions.
[2026-05-24 23:27:33] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 4 ms.
[2026-05-24 23:27:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12782642378474517144.gal : 2 ms
[2026-05-24 23:27:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality709208495424223778.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/ReachabilityCardinality12782642378474517144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality709208495424223778.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality709208495424223778.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 139
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :139 after 170
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :170 after 459
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :459 after 3032
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3032 after 20697
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20697 after 26956
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :26956 after 358740
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :358740 after 1.78318e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5949100875528991292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11483615800237800444.kers'
[2026-05-24 23:28:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5949100875528991292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11483615800237800444.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:28:23] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11483615800237800444.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20378 resets) in 2161 ms. (462 steps per ms)
BEST_FIRST walk for 1000001 steps (1824 resets) in 472 ms. (2114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:28:25] [INFO ] Invariant cache hit.
[2026-05-24 23:28:25] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:28:25] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:28:25] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:28:25] [INFO ] [Real]Added 353 Read/Feed constraints in 36 ms returned sat
[2026-05-24 23:28:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:28:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:28:25] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:28:26] [INFO ] [Nat]Added 353 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:28:26] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 17 ms.
[2026-05-24 23:28:26] [INFO ] Added : 3 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:28:26] [INFO ] Invariant cache hit.
[2026-05-24 23:28:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 23:28:26] [INFO ] Invariant cache hit.
[2026-05-24 23:28:26] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:28:28] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2026-05-24 23:28:28] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1853 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:28:28] [INFO ] Flatten gal took : 29 ms
[2026-05-24 23:28:28] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (807 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2026-05-24 23:28:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18139220831870325419.gal : 2 ms
[2026-05-24 23:28:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5362968130497248052.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/ReachabilityCardinality18139220831870325419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5362968130497248052.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
BEST_FIRST walk for 40004 steps (70 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (70 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5362968130497248052.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 317
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :317 after 430
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :430 after 1381
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1381 after 4574
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4574 after 24002
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24002 after 121469
Interrupted probabilistic random walk after 1332398 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 2
Probabilistic random walk after 1332398 steps, saw 157941 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2026-05-24 23:28:31] [INFO ] Invariant cache hit.
[2026-05-24 23:28:31] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/387 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 166/553 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 95/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/387 variables, 7/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 166/553 variables, 71/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 95/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 868ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (806 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (73 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (71 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1332881 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 2
Probabilistic random walk after 1332881 steps, saw 158082 distinct states, run finished after 3002 ms. (steps per millisecond=443 ) properties seen :0
[2026-05-24 23:28:35] [INFO ] Invariant cache hit.
[2026-05-24 23:28:35] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/387 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 166/553 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 95/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 293/346 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 34/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/387 variables, 7/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 166/553 variables, 71/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 95/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:28:36] [INFO ] Invariant cache hit.
[2026-05-24 23:28:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 23:28:36] [INFO ] Invariant cache hit.
[2026-05-24 23:28:36] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:28:38] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2026-05-24 23:28:38] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1859 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 344 transitions.
Graph (complete) has 106 edges and 43 vertex of which 11 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 11 transition count 13
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 4 transition count 6
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 4 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 3 transition count 5
Applied a total of 44 rules in 3 ms. Remains 3 /155 variables (removed 152) and now considering 5/398 (removed 393) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13410091402615467725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7383731477443943404.kers'
[2026-05-24 23:28:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13410091402615467725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7383731477443943404.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 3 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 23:28:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7383731477443943404.kers
Total runtime 1 ms.
[2026-05-24 23:28:38] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:28:38] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 23:28:38] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 23:28:38] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:28:38] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:28:38] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:28:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:28:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:28:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2916035778655180701.gal : 0 ms
[2026-05-24 23:28:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality980125964745003690.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/ReachabilityCardinality2916035778655180701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality980125964745003690.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/ReachabilityCardinality980125964745003690.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,90,0.002937,4160,2,12,11,106,6,0,19,91,0
Total reachable state count : 90
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.003094,4184,2,4,11,106,7,0,22,91,0
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,1,0.003196,4184,2,4,11,106,8,0,24,91,0
Over-approximation ignoring read arcs solved 0 properties in 68 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:28:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:28:38] [INFO ] Applying decomposition
[2026-05-24 23:28:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3602616088103510392.txt' '-o' '/tmp/graph3602616088103510392.bin' '-w' '/tmp/graph3602616088103510392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3602616088103510392.bin' '-l' '-1' '-v' '-w' '/tmp/graph3602616088103510392.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:28:38] [INFO ] Decomposing Gal with order
[2026-05-24 23:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:28:38] [INFO ] Removed a total of 327 redundant transitions.
[2026-05-24 23:28:38] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 3 ms.
[2026-05-24 23:28:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13723393933100226559.gal : 2 ms
[2026-05-24 23:28:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12311549940039212931.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/ReachabilityCardinality13723393933100226559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12311549940039212931.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality12311549940039212931.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 61
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :61 after 298
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :298 after 2807
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2807 after 30251
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :30251 after 4.65036e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.02035e+09 after 1.02301e+09
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\_mod\_flat,1.18889e+09,45.7404,945512,30367,6472,1.48603e+06,24813,935,2.8532e+06,358,412697,0
Total reachable state count : 1188892298
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,45.7632,945512,1,0,1.48603e+06,24813,935,2.8532e+06,359,412697,0
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,45.7917,945512,1,0,1.48603e+06,24813,938,2.8532e+06,360,412697,0
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8031266384048555907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17189937635611154830.kers'
[2026-05-24 23:29:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8031266384048555907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17189937635611154830.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:29:24] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17189937635611154830.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (20362 resets) in 2130 ms. (469 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:[]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-06 in 255533 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-477754333857288098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10207992910672159805.kers'
[2026-05-24 23:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-477754333857288098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10207992910672159805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:29:26] [INFO ] Computed 12 invariants in 6 ms
Computed 12 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10207992910672159805.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (167 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:29:26] [INFO ] Invariant cache hit.
[2026-05-24 23:29:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:29:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:29:26] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:29:26] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:29:26] [INFO ] [Real]Added 401 Read/Feed constraints in 32 ms returned sat
[2026-05-24 23:29:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:29:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:29:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:29:26] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:29:26] [INFO ] [Nat]Added 401 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:29:26] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 18 ms.
[2026-05-24 23:29:26] [INFO ] Added : 7 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 495 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 179 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 179 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 178 transition count 463
Applied a total of 16 rules in 14 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1225052064785121371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13571199872455300875.kers'
[2026-05-24 23:29:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1225052064785121371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13571199872455300875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:29:27] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13571199872455300875.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17306 resets) in 2177 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (1654 resets) in 486 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:29:29] [INFO ] Invariant cache hit.
[2026-05-24 23:29:30] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:29:30] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:29:30] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:29:30] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:29:30] [INFO ] [Real]Added 415 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:29:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:29:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:29:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:29:30] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:29:30] [INFO ] [Nat]Added 415 Read/Feed constraints in 40 ms returned sat
[2026-05-24 23:29:30] [INFO ] Computed and/alt/rep : 320/1013/320 causal constraints (skipped 133 transitions) in 18 ms.
[2026-05-24 23:29:30] [INFO ] Added : 13 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 527 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:29:30] [INFO ] Invariant cache hit.
[2026-05-24 23:29:31] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-24 23:29:31] [INFO ] Invariant cache hit.
[2026-05-24 23:29:31] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:29:32] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2026-05-24 23:29:32] [INFO ] Redundant transitions in 9 ms returned []
Running 453 sub problems to find dead transitions.
[2026-05-24 23:29:32] [INFO ] Invariant cache hit.
[2026-05-24 23:29:32] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 8 (OVERLAPS) 463/640 variables, 177/271 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 415/686 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/641 variables, and 686 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 463/640 variables, 177/271 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 415/686 constraints. Problems are: Problem set: 28 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 425/1111 constraints. Problems are: Problem set: 28 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/641 variables, and 1111 constraints, problems are : Problem set: 28 solved, 425 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 425/453 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 28 solved, 425 unsolved
Search for dead transitions found 28 dead transitions in 60082ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/178 places, 435/463 transitions.
Graph (complete) has 760 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 160 transition count 401
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 160 transition count 401
Applied a total of 35 rules in 6 ms. Remains 160 /178 variables (removed 18) and now considering 401/435 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4778766479477668379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-62844106589416293.kers'
[2026-05-24 23:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4778766479477668379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-62844106589416293.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 160 cols 871 entries
Finished phase 1 with 145 SingleSign rule and 2 generalized
[2026-05-24 23:30:32] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-62844106589416293.kers
Total runtime 2 ms.
[2026-05-24 23:30:32] [INFO ] Implicit Places using invariants in 95 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 158/178 places, 401/463 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 156 transition count 399
Applied a total of 20 rules in 15 ms. Remains 156 /158 variables (removed 2) and now considering 399/401 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6214157921189028699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7448810191873845601.kers'
[2026-05-24 23:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6214157921189028699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7448810191873845601.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:30:32] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7448810191873845601.kers
Total runtime 1 ms.
[2026-05-24 23:30:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:30:32] [INFO ] Invariant cache hit.
[2026-05-24 23:30:32] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:30:34] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 156/178 places, 399/463 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63190 ms. Remains : 156/178 places, 399/463 transitions.
[2026-05-24 23:30:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20235 resets) in 2154 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (1833 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:30:36] [INFO ] Invariant cache hit.
[2026-05-24 23:30:36] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:30:36] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-24 23:30:36] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:30:36] [INFO ] [Real]Added 352 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:30:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:30:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:30:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:30:37] [INFO ] [Nat]Added 352 Read/Feed constraints in 39 ms returned sat
[2026-05-24 23:30:37] [INFO ] Computed and/alt/rep : 255/847/255 causal constraints (skipped 134 transitions) in 16 ms.
[2026-05-24 23:30:37] [INFO ] Added : 10 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:30:37] [INFO ] Invariant cache hit.
[2026-05-24 23:30:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 23:30:37] [INFO ] Invariant cache hit.
[2026-05-24 23:30:37] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:30:38] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2026-05-24 23:30:38] [INFO ] Redundant transitions in 7 ms returned []
Running 389 sub problems to find dead transitions.
[2026-05-24 23:30:38] [INFO ] Invariant cache hit.
[2026-05-24 23:30:38] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 399/554 variables, 155/167 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 352/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 399/554 variables, 155/168 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 352/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61571 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:31:38] [INFO ] Flatten gal took : 23 ms
[2026-05-24 23:31:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:31:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3326651396418974367.gal : 2 ms
[2026-05-24 23:31:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4706052530417322337.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/ReachabilityCardinality3326651396418974367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4706052530417322337.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/ReachabilityCardinality4706052530417322337.prop.
RANDOM walk for 40000 steps (805 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 31
BEST_FIRST walk for 40004 steps (75 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 315
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :315 after 433
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :433 after 2653
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2653 after 12475
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12475 after 27305
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :27305 after 123319
Interrupted probabilistic random walk after 1258886 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 2
Probabilistic random walk after 1258886 steps, saw 150902 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
[2026-05-24 23:31:42] [INFO ] Invariant cache hit.
[2026-05-24 23:31:42] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 317/506 variables, 74/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 277/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 49/555 variables, 49/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 317/506 variables, 74/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 277/471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/555 variables, 49/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (816 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (70 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1776659 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :0 out of 1
Probabilistic random walk after 1776659 steps, saw 216379 distinct states, run finished after 3001 ms. (steps per millisecond=592 ) properties seen :0
[2026-05-24 23:31:45] [INFO ] Invariant cache hit.
[2026-05-24 23:31:45] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 317/506 variables, 74/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 277/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/555 variables, 49/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 317/506 variables, 74/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 277/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/555 variables, 49/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:31:46] [INFO ] Invariant cache hit.
[2026-05-24 23:31:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 23:31:46] [INFO ] Invariant cache hit.
[2026-05-24 23:31:46] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:31:47] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2026-05-24 23:31:47] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1542 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 156 vertex of which 115 / 156 are part of one of the 3 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 344 transitions.
Graph (complete) has 108 edges and 44 vertex of which 12 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 12 transition count 14
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 5 transition count 7
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 5 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 3 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 3 transition count 4
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 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 3 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5465397564699273093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15069047044277163305.kers'
[2026-05-24 23:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5465397564699273093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15069047044277163305.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:31:47] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15069047044277163305.kers
Total runtime 1 ms.
[2026-05-24 23:31:47] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:31:47] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 23:31:47] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:31:47] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:31:47] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:31:47] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:31:47] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:31:47] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8697450433567884360.gal : 1 ms
[2026-05-24 23:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3247998174714904036.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/ReachabilityCardinality8697450433567884360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3247998174714904036.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/ReachabilityCardinality3247998174714904036.prop.
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 3 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,9,0.002646,3996,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.003471,4160,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:31:47] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:31:47] [INFO ] Applying decomposition
[2026-05-24 23:31:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8767880540897086480.txt' '-o' '/tmp/graph8767880540897086480.bin' '-w' '/tmp/graph8767880540897086480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8767880540897086480.bin' '-l' '-1' '-v' '-w' '/tmp/graph8767880540897086480.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:31:47] [INFO ] Decomposing Gal with order
[2026-05-24 23:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:31:47] [INFO ] Removed a total of 323 redundant transitions.
[2026-05-24 23:31:47] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 286 labels/synchronizations in 3 ms.
[2026-05-24 23:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3018629092603419413.gal : 2 ms
[2026-05-24 23:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1233599678548787481.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/ReachabilityCardinality3018629092603419413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1233599678548787481.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality1233599678548787481.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 128
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :128 after 135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :135 after 136
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :136 after 139
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :139 after 226
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :226 after 6087
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6087 after 95839
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :95839 after 2.95836e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[7]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4035615733206880354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8542113895462903011.kers'
[2026-05-24 23:32:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4035615733206880354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8542113895462903011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 156 cols 879 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-24 23:32:37] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8542113895462903011.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (20247 resets) in 2122 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (1842 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-24 23:32:40] [INFO ] Invariant cache hit.
[2026-05-24 23:32:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:32:40] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:32:40] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:32:40] [INFO ] [Real]Added 352 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:32:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:32:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:32:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-24 23:32:40] [INFO ] [Nat]Added 352 Read/Feed constraints in 37 ms returned sat
[2026-05-24 23:32:40] [INFO ] Computed and/alt/rep : 255/847/255 causal constraints (skipped 134 transitions) in 18 ms.
[2026-05-24 23:32:40] [INFO ] Added : 10 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:32:41] [INFO ] Invariant cache hit.
[2026-05-24 23:32:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 23:32:41] [INFO ] Invariant cache hit.
[2026-05-24 23:32:41] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:32:42] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2026-05-24 23:32:42] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1513 ms. Remains : 156/156 places, 399/399 transitions.
[2026-05-24 23:32:42] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:32:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:32:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6205525804035647253.gal : 2 ms
[2026-05-24 23:32:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12488304281864498750.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/ReachabilityCardinality6205525804035647253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12488304281864498750.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/ReachabilityCardinality12488304281864498750.prop.
RANDOM walk for 40000 steps (810 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 38
BEST_FIRST walk for 40003 steps (78 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 58
BEST_FIRST walk for 40003 steps (75 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 315
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :315 after 433
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :433 after 2653
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2653 after 12475
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12475 after 27305
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :27305 after 123319
Interrupted probabilistic random walk after 1349970 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 2
Probabilistic random walk after 1349970 steps, saw 162722 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
[2026-05-24 23:32:45] [INFO ] Invariant cache hit.
[2026-05-24 23:32:45] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 317/506 variables, 74/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 277/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/555 variables, 49/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 317/506 variables, 74/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 277/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 49/555 variables, 49/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
RANDOM walk for 40000 steps (824 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (71 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1307429 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 2
Probabilistic random walk after 1307429 steps, saw 156078 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2026-05-24 23:32:49] [INFO ] Invariant cache hit.
[2026-05-24 23:32:49] [INFO ] State equation strengthened by 352 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 317/506 variables, 74/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 277/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/555 variables, 49/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/143 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/180 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/189 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 317/506 variables, 74/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 277/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 49/555 variables, 49/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/555 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2026-05-24 23:32:50] [INFO ] Invariant cache hit.
[2026-05-24 23:32:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 23:32:50] [INFO ] Invariant cache hit.
[2026-05-24 23:32:50] [INFO ] State equation strengthened by 352 read => feed constraints.
[2026-05-24 23:32:52] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2026-05-24 23:32:52] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1521 ms. Remains : 156/156 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 156 vertex of which 115 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 344 transitions.
Graph (complete) has 108 edges and 44 vertex of which 12 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 12 transition count 14
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 5 transition count 7
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 5 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 3 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 3 transition count 4
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 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 2 ms. Remains 2 /156 variables (removed 154) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4676560214900391811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4395073594369834884.kers'
[2026-05-24 23:32:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4676560214900391811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4395073594369834884.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:32:52] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4395073594369834884.kers
Total runtime 2 ms.
[2026-05-24 23:32:52] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:32:52] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 23:32:52] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 23:32:52] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:32:52] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:32:52] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:32:52] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:32:52] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:32:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8750553271681983742.gal : 0 ms
[2026-05-24 23:32:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14148874835779894670.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/ReachabilityCardinality8750553271681983742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14148874835779894670.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/ReachabilityCardinality14148874835779894670.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :6 after 9
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,20,0.004657,4140,2,10,10,87,6,0,14,87,0
Total reachable state count : 20
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.004857,4172,2,3,10,87,7,0,17,87,0
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.004988,4172,2,3,10,87,8,0,19,87,0
Over-approximation ignoring read arcs solved 0 properties in 70 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:32:52] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:32:52] [INFO ] Applying decomposition
[2026-05-24 23:32:52] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16217103075934228372.txt' '-o' '/tmp/graph16217103075934228372.bin' '-w' '/tmp/graph16217103075934228372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16217103075934228372.bin' '-l' '-1' '-v' '-w' '/tmp/graph16217103075934228372.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:32:52] [INFO ] Decomposing Gal with order
[2026-05-24 23:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:32:52] [INFO ] Removed a total of 322 redundant transitions.
[2026-05-24 23:32:52] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 4 ms.
[2026-05-24 23:32:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality465311845061332000.gal : 2 ms
[2026-05-24 23:32:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7772294942287564622.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/ReachabilityCardinality465311845061332000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7772294942287564622.prop' '--nowitness'
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 ...306
Loading property file /tmp/ReachabilityCardinality7772294942287564622.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 67
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :67 after 68
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :68 after 72
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :72 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 101
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :101 after 1150
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1150 after 33214
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :33214 after 739240
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :739240 after 8.45078e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 256146 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5966216992211335897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7183341700044801301.kers'
[2026-05-24 23:33:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5966216992211335897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7183341700044801301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:33:42] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7183341700044801301.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (163 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:33:42] [INFO ] Invariant cache hit.
[2026-05-24 23:33:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:33:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:33:42] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-24 23:33:42] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:33:42] [INFO ] [Real]Added 401 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:33:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:33:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:33:42] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:33:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-24 23:33:42] [INFO ] [Nat]Added 401 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:33:42] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 22 ms.
[2026-05-24 23:33:42] [INFO ] Added : 8 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 485 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 463
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 177 transition count 462
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 177 transition count 462
Applied a total of 17 rules in 19 ms. Remains 177 /183 variables (removed 6) and now considering 462/468 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 177/183 places, 462/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16440235244468177690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10505235913498963988.kers'
[2026-05-24 23:33:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16440235244468177690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10505235913498963988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 177 cols 1044 entries
Finished phase 1 with 155 SingleSign rule and 10 generalized
[2026-05-24 23:33:43] [INFO ] Computed 12 invariants in 6 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10505235913498963988.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17375 resets) in 2200 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (1622 resets) in 510 ms. (1956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:33:46] [INFO ] Invariant cache hit.
[2026-05-24 23:33:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:33:46] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:33:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:33:46] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:33:46] [INFO ] [Real]Added 416 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:33:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:33:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 23:33:46] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:33:46] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:33:46] [INFO ] [Nat]Added 416 Read/Feed constraints in 35 ms returned sat
[2026-05-24 23:33:46] [INFO ] Computed and/alt/rep : 316/1000/316 causal constraints (skipped 136 transitions) in 21 ms.
[2026-05-24 23:33:46] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 177/177 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-24 23:33:47] [INFO ] Invariant cache hit.
[2026-05-24 23:33:47] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 23:33:47] [INFO ] Invariant cache hit.
[2026-05-24 23:33:47] [INFO ] State equation strengthened by 416 read => feed constraints.
[2026-05-24 23:33:49] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
[2026-05-24 23:33:49] [INFO ] Redundant transitions in 7 ms returned []
Running 452 sub problems to find dead transitions.
[2026-05-24 23:33:49] [INFO ] Invariant cache hit.
[2026-05-24 23:33:49] [INFO ] State equation strengthened by 416 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 462/638 variables, 176/270 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Problem TDEAD289 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 416/686 constraints. Problems are: Problem set: 1 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/639 variables, and 686 constraints, problems are : Problem set: 1 solved, 451 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 82/94 constraints. Problems are: Problem set: 1 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 462/638 variables, 176/270 constraints. Problems are: Problem set: 1 solved, 451 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 416/686 constraints. Problems are: Problem set: 28 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 424/1110 constraints. Problems are: Problem set: 28 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/639 variables, and 1110 constraints, problems are : Problem set: 28 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 424/452 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 28 solved, 424 unsolved
Search for dead transitions found 28 dead transitions in 60078ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 434/462 transitions.
Graph (complete) has 760 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 159 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 159 transition count 400
Applied a total of 35 rules in 6 ms. Remains 159 /177 variables (removed 18) and now considering 400/434 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11067257255431751243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17327860113065712832.kers'
[2026-05-24 23:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11067257255431751243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17327860113065712832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 159 cols 869 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-24 23:34:49] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17327860113065712832.kers
Total runtime 4 ms.
[2026-05-24 23:34:49] [INFO ] Implicit Places using invariants in 128 ms returned [6, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/177 places, 400/462 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 155 transition count 398
Applied a total of 20 rules in 15 ms. Remains 155 /157 variables (removed 2) and now considering 398/400 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15577516357432379465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4931627480423936120.kers'
[2026-05-24 23:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15577516357432379465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4931627480423936120.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:34:49] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4931627480423936120.kers
Total runtime 2 ms.
[2026-05-24 23:34:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 23:34:49] [INFO ] Invariant cache hit.
[2026-05-24 23:34:49] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:34:50] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/177 places, 398/462 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63909 ms. Remains : 155/177 places, 398/462 transitions.
[2026-05-24 23:34:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (20309 resets) in 2157 ms. (463 steps per ms)
BEST_FIRST walk for 1000001 steps (1845 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:34:53] [INFO ] Invariant cache hit.
[2026-05-24 23:34:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:34:53] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:34:53] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:34:53] [INFO ] [Real]Added 353 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:34:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:34:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-24 23:34:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-24 23:34:53] [INFO ] [Nat]Added 353 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:34:53] [INFO ] Computed and/alt/rep : 251/834/251 causal constraints (skipped 137 transitions) in 16 ms.
[2026-05-24 23:34:53] [INFO ] Added : 4 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:34:54] [INFO ] Invariant cache hit.
[2026-05-24 23:34:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 23:34:54] [INFO ] Invariant cache hit.
[2026-05-24 23:34:54] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:34:55] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2026-05-24 23:34:55] [INFO ] Redundant transitions in 8 ms returned []
Running 388 sub problems to find dead transitions.
[2026-05-24 23:34:55] [INFO ] Invariant cache hit.
[2026-05-24 23:34:55] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/552 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 353/519 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/552 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 353/520 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 388/908 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (OVERLAPS) 1/553 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 909 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61639 ms. Remains : 155/155 places, 398/398 transitions.
[2026-05-24 23:35:55] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:35:55] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:35:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18004232960919429165.gal : 2 ms
[2026-05-24 23:35:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17700513551356841255.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/ReachabilityCardinality18004232960919429165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17700513551356841255.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/ReachabilityCardinality17700513551356841255.prop.
RANDOM walk for 40000 steps (821 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 45
BEST_FIRST walk for 40004 steps (71 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 61
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :61 after 322
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :322 after 389
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :389 after 1320
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1320 after 2893
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2893 after 20725
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :20725 after 70114
Interrupted probabilistic random walk after 1360634 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 2
Probabilistic random walk after 1360634 steps, saw 162297 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2026-05-24 23:35:59] [INFO ] Invariant cache hit.
[2026-05-24 23:35:59] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 271/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 233/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/517 variables, 74/252 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 233/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/553 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
RANDOM walk for 40000 steps (810 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1788396 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :0 out of 1
Probabilistic random walk after 1788396 steps, saw 215235 distinct states, run finished after 3001 ms. (steps per millisecond=595 ) properties seen :0
[2026-05-24 23:36:02] [INFO ] Invariant cache hit.
[2026-05-24 23:36:02] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/517 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 233/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/553 variables, 36/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/237 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/246 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 271/517 variables, 74/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 233/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/553 variables, 36/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 23:36:03] [INFO ] Invariant cache hit.
[2026-05-24 23:36:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 23:36:03] [INFO ] Invariant cache hit.
[2026-05-24 23:36:03] [INFO ] State equation strengthened by 353 read => feed constraints.
[2026-05-24 23:36:04] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2026-05-24 23:36:04] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1545 ms. Remains : 155/155 places, 398/398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 105 edges and 43 vertex of which 10 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 10 transition count 11
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 3 transition count 4
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 2 ms. Remains 2 /155 variables (removed 153) and now considering 3/398 (removed 395) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18215168806815476776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10271891378545413178.kers'
[2026-05-24 23:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18215168806815476776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10271891378545413178.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 5 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 23:36:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10271891378545413178.kers
Total runtime 0 ms.
[2026-05-24 23:36:04] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:36:04] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:36:04] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:36:04] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:36:04] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:36:04] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:36:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15672794118255515554.gal : 0 ms
[2026-05-24 23:36:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12912316292534066547.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/ReachabilityCardinality15672794118255515554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12912316292534066547.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/ReachabilityCardinality12912316292534066547.prop.
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 3 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,9,0.005936,3996,2,7,7,42,6,0,14,34,0
Total reachable state count : 9
Verifying 1 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,2,0.006506,4164,2,3,7,42,7,0,17,34,0
Over-approximation ignoring read arcs solved 0 properties in 54 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:36:04] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:36:04] [INFO ] Applying decomposition
[2026-05-24 23:36:04] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8988359823030499860.txt' '-o' '/tmp/graph8988359823030499860.bin' '-w' '/tmp/graph8988359823030499860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8988359823030499860.bin' '-l' '-1' '-v' '-w' '/tmp/graph8988359823030499860.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:36:04] [INFO ] Decomposing Gal with order
[2026-05-24 23:36:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:36:04] [INFO ] Removed a total of 329 redundant transitions.
[2026-05-24 23:36:04] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:36:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 4 ms.
[2026-05-24 23:36:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6906530792960689954.gal : 2 ms
[2026-05-24 23:36:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10091506902947263478.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/ReachabilityCardinality6906530792960689954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10091506902947263478.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality10091506902947263478.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :29 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 77
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :77 after 337
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :337 after 26510
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :26510 after 284184
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :284184 after 316128
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\_mod\_flat,1.20067e+09,31.9407,620576,29100,7387,958785,38942,902,2.19746e+06,361,541749,0
Total reachable state count : 1200668492
Verifying 1 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,31.9796,620576,1,0,958785,38942,905,2.19746e+06,363,541749,0
FORMULA CANInsertWithFailure-PT-010-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17541678904908874427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3198365936437751206.kers'
[2026-05-24 23:36:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17541678904908874427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3198365936437751206.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 155 cols 877 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 23:36:36] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3198365936437751206.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (20347 resets) in 2111 ms. (473 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:[]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 176542 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13953146125164391207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2561836667801592579.kers'
[2026-05-24 23:36:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13953146125164391207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2561836667801592579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:36:39] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2561836667801592579.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (169 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10000 steps (15 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:36:39] [INFO ] Invariant cache hit.
[2026-05-24 23:36:39] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:36:39] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:36:39] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:36:39] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:36:39] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:36:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:36:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:36:39] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:36:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:36:39] [INFO ] [Nat]Added 401 Read/Feed constraints in 37 ms returned sat
[2026-05-24 23:36:39] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:36:39] [INFO ] Added : 14 causal constraints over 3 iterations in 145 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 178 transition count 463
Applied a total of 14 rules in 15 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16595769346895835732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12740002858127514868.kers'
[2026-05-24 23:36:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16595769346895835732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12740002858127514868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:36:39] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12740002858127514868.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17422 resets) in 2167 ms. (461 steps per ms)
BEST_FIRST walk for 1000001 steps (1677 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:36:42] [INFO ] Invariant cache hit.
[2026-05-24 23:36:42] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:36:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:36:42] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 23:36:42] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:36:42] [INFO ] [Real]Added 415 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:36:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:36:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:36:42] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:36:42] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 23:36:42] [INFO ] [Nat]Added 415 Read/Feed constraints in 43 ms returned sat
[2026-05-24 23:36:43] [INFO ] Computed and/alt/rep : 318/1010/318 causal constraints (skipped 135 transitions) in 20 ms.
[2026-05-24 23:36:43] [INFO ] Added : 13 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:36:43] [INFO ] Invariant cache hit.
[2026-05-24 23:36:43] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 23:36:43] [INFO ] Invariant cache hit.
[2026-05-24 23:36:43] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:36:45] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2026-05-24 23:36:45] [INFO ] Redundant transitions in 5 ms returned []
Running 453 sub problems to find dead transitions.
[2026-05-24 23:36:45] [INFO ] Invariant cache hit.
[2026-05-24 23:36:45] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 463/640 variables, 177/274 constraints. Problems are: Problem set: 0 solved, 453 unsolved
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 30062ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31811 ms. Remains : 178/178 places, 463/463 transitions.
[2026-05-24 23:37:15] [INFO ] Flatten gal took : 9 ms
[2026-05-24 23:37:15] [INFO ] Flatten gal took : 20 ms
[2026-05-24 23:37:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5361943855395870160.gal : 1 ms
[2026-05-24 23:37:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15292972556324393910.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/ReachabilityCardinality5361943855395870160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15292972556324393910.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
RANDOM walk for 40000 steps (698 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15292972556324393910.prop.
BEST_FIRST walk for 40004 steps (65 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (67 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 100
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :100 after 374
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :374 after 425
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :425 after 1001
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1001 after 1915
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1915 after 2907
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2907 after 15284
Interrupted probabilistic random walk after 1164296 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 2
Probabilistic random walk after 1164296 steps, saw 146918 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
[2026-05-24 23:37:18] [INFO ] Invariant cache hit.
[2026-05-24 23:37:18] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15284 after 209880
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 625 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3196ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
RANDOM walk for 40000 steps (695 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (66 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (64 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :209880 after 352604
Interrupted probabilistic random walk after 1132485 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 2
Probabilistic random walk after 1132485 steps, saw 142384 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2026-05-24 23:37:24] [INFO ] Invariant cache hit.
[2026-05-24 23:37:24] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 625 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2722 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:37:28] [INFO ] Invariant cache hit.
[2026-05-24 23:37:28] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-24 23:37:28] [INFO ] Invariant cache hit.
[2026-05-24 23:37:28] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:37:29] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2026-05-24 23:37:29] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1709 ms. Remains : 178/178 places, 463/463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 385 edges and 178 vertex of which 134 / 178 are part of one of the 2 SCC in 0 ms
Free SCC test removed 132 places
Drop transitions (Empty/Sink Transition effects.) removed 313 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 405 transitions.
Graph (complete) has 119 edges and 46 vertex of which 15 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 15 transition count 21
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 6 transition count 12
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 6 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 5 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 4 transition count 7
Applied a total of 54 rules in 2 ms. Remains 4 /178 variables (removed 174) and now considering 7/463 (removed 456) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11311900640221161989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10393291433389833004.kers'
[2026-05-24 23:37:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11311900640221161989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10393291433389833004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 4 cols 14 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 23:37:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10393291433389833004.kers
Total runtime 0 ms.
[2026-05-24 23:37:29] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 23:37:29] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:37:29] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:37:29] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:37:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:37:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:37:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7569492061779850170.gal : 1 ms
[2026-05-24 23:37:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13069892440081660959.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/ReachabilityCardinality7569492061779850170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13069892440081660959.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/ReachabilityCardinality13069892440081660959.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,194,0.003786,4184,2,38,9,478,6,0,25,530,0
Total reachable state count : 194
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,3,0.004064,4268,2,7,9,478,7,0,28,530,0
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,30,0.004175,4268,2,13,9,478,8,0,30,530,0
Over-approximation ignoring read arcs solved 0 properties in 69 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:37:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:37:29] [INFO ] Applying decomposition
[2026-05-24 23:37:29] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17827830273637036937.txt' '-o' '/tmp/graph17827830273637036937.bin' '-w' '/tmp/graph17827830273637036937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17827830273637036937.bin' '-l' '-1' '-v' '-w' '/tmp/graph17827830273637036937.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:37:30] [INFO ] Decomposing Gal with order
[2026-05-24 23:37:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:37:30] [INFO ] Removed a total of 350 redundant transitions.
[2026-05-24 23:37:30] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 4 ms.
[2026-05-24 23:37:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9691549781364650505.gal : 2 ms
[2026-05-24 23:37:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1918512071455794563.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/ReachabilityCardinality9691549781364650505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1918512071455794563.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality1918512071455794563.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 146
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :146 after 146
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :146 after 146
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :146 after 146
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :146 after 165
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :165 after 194
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :194 after 5369
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5369 after 126859
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :126859 after 1.65498e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.65498e+06 after 7.47069e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 101109 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5658967221378732394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15860539113142071417.kers'
[2026-05-24 23:38:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5658967221378732394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15860539113142071417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:38:20] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15860539113142071417.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (169 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:38:20] [INFO ] Invariant cache hit.
[2026-05-24 23:38:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:38:20] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:38:20] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 23:38:20] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:38:20] [INFO ] [Real]Added 401 Read/Feed constraints in 27 ms returned sat
[2026-05-24 23:38:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:38:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:38:20] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:38:20] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:38:20] [INFO ] [Nat]Added 401 Read/Feed constraints in 34 ms returned sat
[2026-05-24 23:38:20] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 17 ms.
[2026-05-24 23:38:20] [INFO ] Added : 10 causal constraints over 3 iterations in 113 ms. Result :sat
Minimization took 395 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 179 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 179 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 178 transition count 463
Applied a total of 16 rules in 13 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-870893199517123505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7964220126471171521.kers'
[2026-05-24 23:38:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-870893199517123505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7964220126471171521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:38:21] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7964220126471171521.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17289 resets) in 2194 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (1671 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:38:23] [INFO ] Invariant cache hit.
[2026-05-24 23:38:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:38:23] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:38:23] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 23:38:23] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:38:23] [INFO ] [Real]Added 415 Read/Feed constraints in 30 ms returned sat
[2026-05-24 23:38:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:38:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:38:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:38:23] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 23:38:24] [INFO ] [Nat]Added 415 Read/Feed constraints in 39 ms returned sat
[2026-05-24 23:38:24] [INFO ] Computed and/alt/rep : 318/1005/318 causal constraints (skipped 135 transitions) in 20 ms.
[2026-05-24 23:38:24] [INFO ] Added : 11 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 346 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:38:24] [INFO ] Invariant cache hit.
[2026-05-24 23:38:24] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 23:38:24] [INFO ] Invariant cache hit.
[2026-05-24 23:38:24] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:38:26] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2026-05-24 23:38:26] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1679 ms. Remains : 178/178 places, 463/463 transitions.
[2026-05-24 23:38:26] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:38:26] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:38:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14140091272996233266.gal : 2 ms
[2026-05-24 23:38:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18337588494645241028.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/ReachabilityCardinality14140091272996233266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18337588494645241028.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/ReachabilityCardinality18337588494645241028.prop.
RANDOM walk for 40000 steps (688 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 44
BEST_FIRST walk for 40003 steps (64 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 59
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :59 after 320
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :320 after 445
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :445 after 1557
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1557 after 3603
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3603 after 16868
Interrupted probabilistic random walk after 1194736 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 2
Probabilistic random walk after 1194736 steps, saw 151949 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
[2026-05-24 23:38:29] [INFO ] Invariant cache hit.
[2026-05-24 23:38:29] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :16868 after 235595
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1904ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
RANDOM walk for 40000 steps (703 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (62 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (63 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1173549 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :0 out of 2
Probabilistic random walk after 1173549 steps, saw 149070 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
[2026-05-24 23:38:34] [INFO ] Invariant cache hit.
[2026-05-24 23:38:34] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1964ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:38:36] [INFO ] Invariant cache hit.
[2026-05-24 23:38:36] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-24 23:38:36] [INFO ] Invariant cache hit.
[2026-05-24 23:38:36] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:38:38] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2026-05-24 23:38:38] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 178/178 places, 463/463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 384 edges and 178 vertex of which 135 / 178 are part of one of the 2 SCC in 0 ms
Free SCC test removed 133 places
Drop transitions (Empty/Sink Transition effects.) removed 313 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 407 transitions.
Graph (complete) has 116 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 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 29 rules applied. Total rules applied 31 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 14 transition count 18
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 6 transition count 10
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 4 transition count 5
Applied a total of 55 rules in 3 ms. Remains 4 /178 variables (removed 174) and now considering 5/463 (removed 458) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5249689871955768163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1192937513538914424.kers'
[2026-05-24 23:38:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5249689871955768163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1192937513538914424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 23:38:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1192937513538914424.kers
Total runtime 0 ms.
[2026-05-24 23:38:38] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:38:38] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:38:38] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:38:38] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:38:38] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:38:38] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:38:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:38:38] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:38:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9622615547868138830.gal : 0 ms
[2026-05-24 23:38:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17412606498788145147.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/ReachabilityCardinality9622615547868138830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17412606498788145147.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/ReachabilityCardinality17412606498788145147.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,109,0.002395,4176,2,16,10,125,6,0,22,101,0
Total reachable state count : 109
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.002595,4196,2,5,10,125,7,0,25,101,0
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,1,0.002751,4196,2,5,10,125,8,0,27,101,0
Over-approximation ignoring read arcs solved 0 properties in 59 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:38:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:38:38] [INFO ] Applying decomposition
[2026-05-24 23:38:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3350015375995829842.txt' '-o' '/tmp/graph3350015375995829842.bin' '-w' '/tmp/graph3350015375995829842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3350015375995829842.bin' '-l' '-1' '-v' '-w' '/tmp/graph3350015375995829842.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:38:38] [INFO ] Decomposing Gal with order
[2026-05-24 23:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:38:38] [INFO ] Removed a total of 346 redundant transitions.
[2026-05-24 23:38:38] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 4 ms.
[2026-05-24 23:38:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2334034716683053030.gal : 2 ms
[2026-05-24 23:38:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3510997800666377072.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/ReachabilityCardinality2334034716683053030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3510997800666377072.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality3510997800666377072.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 39
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :39 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 39
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :39 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 709
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :709 after 1065
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1065 after 17166
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :17166 after 997748
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :997748 after 1.20948e+08
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 68150 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4916347588610144810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9768184651068014931.kers'
[2026-05-24 23:39:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4916347588610144810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9768184651068014931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 183 cols 1056 entries
Finished phase 1 with 161 SingleSign rule and 10 generalized
[2026-05-24 23:39:28] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9768184651068014931.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (171 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:39:28] [INFO ] Invariant cache hit.
[2026-05-24 23:39:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:39:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:39:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-24 23:39:28] [INFO ] State equation strengthened by 401 read => feed constraints.
[2026-05-24 23:39:28] [INFO ] [Real]Added 401 Read/Feed constraints in 28 ms returned sat
[2026-05-24 23:39:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:39:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:39:28] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:39:28] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-24 23:39:28] [INFO ] [Nat]Added 401 Read/Feed constraints in 31 ms returned sat
[2026-05-24 23:39:28] [INFO ] Computed and/alt/rep : 321/953/321 causal constraints (skipped 137 transitions) in 19 ms.
[2026-05-24 23:39:28] [INFO ] Added : 8 causal constraints over 2 iterations in 101 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 468/468 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 179 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 179 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 178 transition count 463
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 178 transition count 463
Applied a total of 16 rules in 13 ms. Remains 178 /183 variables (removed 5) and now considering 463/468 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 178/183 places, 463/468 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5600790705155557879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6128871020434041846.kers'
[2026-05-24 23:39:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5600790705155557879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6128871020434041846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 178 cols 1046 entries
Finished phase 1 with 156 SingleSign rule and 10 generalized
[2026-05-24 23:39:29] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6128871020434041846.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (17271 resets) in 2186 ms. (457 steps per ms)
BEST_FIRST walk for 1000001 steps (1654 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2026-05-24 23:39:31] [INFO ] Invariant cache hit.
[2026-05-24 23:39:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 23:39:31] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:39:31] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 23:39:31] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:39:31] [INFO ] [Real]Added 415 Read/Feed constraints in 33 ms returned sat
[2026-05-24 23:39:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:39:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 23:39:31] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 23:39:32] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 23:39:32] [INFO ] [Nat]Added 415 Read/Feed constraints in 42 ms returned sat
[2026-05-24 23:39:32] [INFO ] Computed and/alt/rep : 318/1005/318 causal constraints (skipped 135 transitions) in 18 ms.
[2026-05-24 23:39:32] [INFO ] Added : 29 causal constraints over 7 iterations in 292 ms. Result :sat
Minimization took 360 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:39:32] [INFO ] Invariant cache hit.
[2026-05-24 23:39:33] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 23:39:33] [INFO ] Invariant cache hit.
[2026-05-24 23:39:33] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:39:34] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2026-05-24 23:39:34] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1683 ms. Remains : 178/178 places, 463/463 transitions.
[2026-05-24 23:39:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:39:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:39:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5439463028257886810.gal : 2 ms
[2026-05-24 23:39:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4414781001668599983.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/ReachabilityCardinality5439463028257886810.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4414781001668599983.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/ReachabilityCardinality4414781001668599983.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 14
RANDOM walk for 40000 steps (696 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 98
BEST_FIRST walk for 40004 steps (66 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (67 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :98 after 339
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :339 after 425
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :425 after 1001
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1001 after 1915
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1915 after 2907
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2907 after 15370
Interrupted probabilistic random walk after 1210604 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 2
Probabilistic random walk after 1210604 steps, saw 153587 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2026-05-24 23:39:37] [INFO ] Invariant cache hit.
[2026-05-24 23:39:37] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15370 after 225590
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :225590 after 354140
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 626 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2964ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 178/178 places, 463/463 transitions.
RANDOM walk for 40000 steps (701 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1072498 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 2
Probabilistic random walk after 1072498 steps, saw 134971 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
[2026-05-24 23:39:43] [INFO ] Invariant cache hit.
[2026-05-24 23:39:43] [INFO ] State equation strengthened by 415 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 463/639 variables, 176/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 415/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/641 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 463/639 variables, 176/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 415/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/641 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 626 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3036ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 11 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 178/178 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-24 23:39:46] [INFO ] Invariant cache hit.
[2026-05-24 23:39:46] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 23:39:46] [INFO ] Invariant cache hit.
[2026-05-24 23:39:47] [INFO ] State equation strengthened by 415 read => feed constraints.
[2026-05-24 23:39:48] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2026-05-24 23:39:48] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1712 ms. Remains : 178/178 places, 463/463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 384 edges and 178 vertex of which 135 / 178 are part of one of the 2 SCC in 0 ms
Free SCC test removed 133 places
Drop transitions (Empty/Sink Transition effects.) removed 313 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 407 transitions.
Graph (complete) has 116 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 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 29 rules applied. Total rules applied 31 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 14 transition count 18
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 6 transition count 10
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 4 transition count 5
Applied a total of 55 rules in 3 ms. Remains 4 /178 variables (removed 174) and now considering 5/463 (removed 458) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6404921042576760399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4769894329798276997.kers'
[2026-05-24 23:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6404921042576760399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4769894329798276997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 23:39:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4769894329798276997.kers
Total runtime 0 ms.
[2026-05-24 23:39:48] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-24 23:39:48] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:39:48] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-24 23:39:48] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 23:39:48] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:39:48] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 23:39:48] [INFO ] Flatten gal took : 1 ms
[2026-05-24 23:39:48] [INFO ] Flatten gal took : 0 ms
[2026-05-24 23:39:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6707504198230866880.gal : 0 ms
[2026-05-24 23:39:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15366899813613616366.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/ReachabilityCardinality6707504198230866880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15366899813613616366.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/ReachabilityCardinality15366899813613616366.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,109,0.006153,4180,2,16,10,125,6,0,22,101,0
Total reachable state count : 109
Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,0.006579,4196,2,5,10,125,7,0,25,101,0
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,1,0.006901,4196,2,5,10,125,8,0,27,101,0
Over-approximation ignoring read arcs solved 0 properties in 74 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 23:39:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:39:48] [INFO ] Applying decomposition
[2026-05-24 23:39:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3194780458227248906.txt' '-o' '/tmp/graph3194780458227248906.bin' '-w' '/tmp/graph3194780458227248906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3194780458227248906.bin' '-l' '-1' '-v' '-w' '/tmp/graph3194780458227248906.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:39:48] [INFO ] Decomposing Gal with order
[2026-05-24 23:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:39:48] [INFO ] Removed a total of 351 redundant transitions.
[2026-05-24 23:39:48] [INFO ] Flatten gal took : 13 ms
[2026-05-24 23:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 4 ms.
[2026-05-24 23:39:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13201236978266163192.gal : 2 ms
[2026-05-24 23:39:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13887775601369465738.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/ReachabilityCardinality13201236978266163192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13887775601369465738.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality13887775601369465738.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 204
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :204 after 205
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :205 after 207
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :207 after 209
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :209 after 213
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :213 after 236
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :236 after 398
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :398 after 12299
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :12299 after 300881
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :300881 after 3.37097e+06
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-12 in 70386 ms.
[2026-05-24 23:40:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:40:38] [INFO ] Applying decomposition
[2026-05-24 23:40:38] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6543092582782540944.txt' '-o' '/tmp/graph6543092582782540944.bin' '-w' '/tmp/graph6543092582782540944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6543092582782540944.bin' '-l' '-1' '-v' '-w' '/tmp/graph6543092582782540944.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:40:38] [INFO ] Decomposing Gal with order
[2026-05-24 23:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:40:38] [INFO ] Removed a total of 338 redundant transitions.
[2026-05-24 23:40:38] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 3 ms.
[2026-05-24 23:40:38] [INFO ] Time to serialize gal into /tmp/UpperBounds14814045933334696251.gal : 2 ms
[2026-05-24 23:40:38] [INFO ] Time to serialize properties into /tmp/UpperBounds18310040990950867089.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/UpperBounds14814045933334696251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18310040990950867089.prop' '--nowitness'
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 ...285
Loading property file /tmp/UpperBounds18310040990950867089.prop.
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\_mod\_flat,2.4079e+09,361.777,5363644,115749,7985,9.92042e+06,100866,937,1.46251e+07,439,1.36607e+06,0
Total reachable state count : 2407896031
Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-00 :0 <= i9.u14.Node7GiveAnswer8 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-00,0,369.542,5363644,1,0,9.92042e+06,100866,1064,1.46251e+07,468,1.36607e+06,3295
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-03 :0 <= i7.u10.Node7requestsent5 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-03,0,369.716,5363644,1,0,9.92042e+06,100866,1094,1.46251e+07,477,1.36607e+06,4368
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-07 :0 <= i11.u17.Node9GiveAnswer2 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-07,0,371.424,5363644,1,0,9.92042e+06,100866,1125,1.46251e+07,490,1.36607e+06,5300
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-10 :0 <= i11.u19.Node6GiveAnswer9 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-10,0,371.888,5363644,1,0,9.92042e+06,100866,1154,1.46251e+07,496,1.36607e+06,6019
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-11 :0 <= i5.u8.Node4GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-11,0,371.904,5363644,1,0,9.92042e+06,100866,1180,1.46251e+07,506,1.36607e+06,6322
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-12 :0 <= i9.u14.Node7GiveAnswer6 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-12,0,372.206,5363644,1,0,9.92042e+06,100866,1206,1.46251e+07,506,1.36607e+06,6697
Total runtime 2799683 ms.
BK_STOP 1779666411805
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ 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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r034-tall-177946842100709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 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 ;