About the Execution of ITS-Tools for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4964.592 | 3600000.00 | 4918154.00 | 36139.40 | ? ? ? ? ? ? 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-177946842100725.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-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100725
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 11K Mar 6 10:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 10:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Mar 6 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K Mar 6 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 6 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:54 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 5.6M 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-030-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779671438979
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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 01:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:10:40] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2026-05-25 01:10:40] [INFO ] Transformed 2164 places.
[2026-05-25 01:10:40] [INFO ] Transformed 5580 transitions.
[2026-05-25 01:10:40] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14199412994217659059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3179012754108373757.kers'
[2026-05-25 01:10:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14199412994217659059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3179012754108373757.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 01:10:40] [INFO ] Computed 33 invariants in 59 ms
Computed 33 P flows in 60 ms.
Exported basis to /tmp/petrispot-output-3179012754108373757.kers
Total runtime 63 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 30, 30, 30, 30, 1, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 10000 steps (13 resets) in 112 ms. (88 steps per ms)
FORMULA CANInsertWithFailure-PT-030-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 172 ms. (867 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2026-05-25 01:10:41] [INFO ] Invariant cache hit.
[2026-05-25 01:10:41] [INFO ] [Real]Absence check using 31 positive place invariants in 35 ms returned sat
[2026-05-25 01:10:41] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:10:42] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2026-05-25 01:10:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 01:10:42] [INFO ] [Real]Added 1770 Read/Feed constraints in 158 ms returned sat
[2026-05-25 01:10:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:10:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-05-25 01:10:43] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:10:44] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2026-05-25 01:10:45] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:10:45] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1096 ms returned unknown
[2026-05-25 01:10:45] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:10:45] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:10:46] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2026-05-25 01:10:47] [INFO ] [Real]Added 1770 Read/Feed constraints in 157 ms returned sat
[2026-05-25 01:10:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:10:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:10:47] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:10:48] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2026-05-25 01:10:49] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:10:49] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1083 ms returned unknown
[2026-05-25 01:10:49] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:10:49] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:10:51] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2026-05-25 01:10:51] [INFO ] [Real]Added 1770 Read/Feed constraints in 154 ms returned sat
[2026-05-25 01:10:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:10:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:10:51] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:10:52] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2026-05-25 01:10:53] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:10:53] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1089 ms returned unknown
[2026-05-25 01:10:54] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:10:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:10:55] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2026-05-25 01:10:55] [INFO ] [Real]Added 1770 Read/Feed constraints in 142 ms returned sat
[2026-05-25 01:10:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:10:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:10:55] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:10:57] [INFO ] [Nat]Absence check using state equation in 1249 ms returned sat
[2026-05-25 01:10:57] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:10:58] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1088 ms returned unknown
[2026-05-25 01:10:58] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:10:58] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:10:59] [INFO ] [Real]Absence check using state equation in 1084 ms returned sat
[2026-05-25 01:10:59] [INFO ] [Real]Added 1770 Read/Feed constraints in 162 ms returned sat
[2026-05-25 01:10:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 40 ms returned sat
[2026-05-25 01:11:00] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:01] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2026-05-25 01:11:01] [INFO ] [Nat]Added 1770 Read/Feed constraints in 464 ms returned sat
[2026-05-25 01:11:02] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 240 ms.
[2026-05-25 01:11:03] [INFO ] Added : 11 causal constraints over 3 iterations in 1142 ms. Result :sat
Minimization took 1909 ms.
[2026-05-25 01:11:05] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:11:05] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:06] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2026-05-25 01:11:06] [INFO ] [Real]Added 1770 Read/Feed constraints in 163 ms returned sat
[2026-05-25 01:11:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:08] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2026-05-25 01:11:08] [INFO ] [Nat]Added 1770 Read/Feed constraints in 492 ms returned sat
[2026-05-25 01:11:08] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 231 ms.
[2026-05-25 01:11:09] [INFO ] Added : 11 causal constraints over 3 iterations in 1100 ms. Result :sat
Minimization took 1967 ms.
[2026-05-25 01:11:11] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:11] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:13] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2026-05-25 01:11:13] [INFO ] [Real]Added 1770 Read/Feed constraints in 178 ms returned sat
[2026-05-25 01:11:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2026-05-25 01:11:13] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:11:14] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2026-05-25 01:11:15] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:15] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1091 ms returned unknown
[2026-05-25 01:11:16] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:16] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:17] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2026-05-25 01:11:17] [INFO ] [Real]Added 1770 Read/Feed constraints in 149 ms returned sat
[2026-05-25 01:11:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:11:17] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:18] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2026-05-25 01:11:19] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:19] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1083 ms returned unknown
[2026-05-25 01:11:20] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:20] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:21] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2026-05-25 01:11:21] [INFO ] [Real]Added 1770 Read/Feed constraints in 154 ms returned sat
[2026-05-25 01:11:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:21] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:22] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2026-05-25 01:11:23] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:24] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1081 ms returned unknown
[2026-05-25 01:11:24] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:24] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:25] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2026-05-25 01:11:25] [INFO ] [Real]Added 1770 Read/Feed constraints in 160 ms returned sat
[2026-05-25 01:11:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-05-25 01:11:25] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:11:27] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2026-05-25 01:11:27] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:28] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1081 ms returned sat
[2026-05-25 01:11:28] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 223 ms.
[2026-05-25 01:11:30] [INFO ] Added : 29 causal constraints over 6 iterations in 1763 ms. Result :sat
Minimization took 702 ms.
[2026-05-25 01:11:30] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:30] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:32] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2026-05-25 01:11:32] [INFO ] [Real]Added 1770 Read/Feed constraints in 141 ms returned sat
[2026-05-25 01:11:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:11:32] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:33] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2026-05-25 01:11:34] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:34] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1084 ms returned unknown
[2026-05-25 01:11:35] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2026-05-25 01:11:35] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:36] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2026-05-25 01:11:36] [INFO ] [Real]Added 1770 Read/Feed constraints in 155 ms returned sat
[2026-05-25 01:11:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:11:36] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:37] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2026-05-25 01:11:38] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:39] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1084 ms returned unknown
[2026-05-25 01:11:39] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-25 01:11:39] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:40] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2026-05-25 01:11:40] [INFO ] [Real]Added 1770 Read/Feed constraints in 164 ms returned sat
[2026-05-25 01:11:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-05-25 01:11:40] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:42] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2026-05-25 01:11:42] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:43] [INFO ] [Nat]Added 1770 Read/Feed constraints in 963 ms returned sat
[2026-05-25 01:11:43] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 213 ms.
[2026-05-25 01:11:45] [INFO ] Added : 37 causal constraints over 8 iterations in 2121 ms. Result :sat
Minimization took 441 ms.
[2026-05-25 01:11:46] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:46] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:47] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2026-05-25 01:11:47] [INFO ] [Real]Added 1770 Read/Feed constraints in 170 ms returned sat
[2026-05-25 01:11:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:47] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:11:48] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2026-05-25 01:11:49] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:49] [INFO ] [Nat]Added 1770 Read/Feed constraints in 659 ms returned sat
[2026-05-25 01:11:49] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 218 ms.
[2026-05-25 01:11:51] [INFO ] Added : 37 causal constraints over 8 iterations in 2126 ms. Result :sat
Minimization took 725 ms.
[2026-05-25 01:11:52] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:52] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:53] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2026-05-25 01:11:54] [INFO ] [Real]Added 1770 Read/Feed constraints in 144 ms returned sat
[2026-05-25 01:11:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:11:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2026-05-25 01:11:54] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:11:55] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2026-05-25 01:11:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:11:56] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1083 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 1953 transition count 5370
Performed 862 Post agglomeration using F-continuation condition.Transition count delta: 862
Deduced a syphon composed of 862 places in 2 ms
Reduce places removed 862 places and 0 transitions.
Iterating global reduction 2 with 1724 rules applied. Total rules applied 2145 place count 1091 transition count 4508
Drop transitions (Redundant composition of simpler transitions.) removed 804 transitions
Redundant transition composition rules discarded 804 transitions
Iterating global reduction 2 with 804 rules applied. Total rules applied 2949 place count 1091 transition count 3704
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2950 place count 1091 transition count 3703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2951 place count 1090 transition count 3703
Partial Free-agglomeration rule applied 924 times.
Drop transitions (Partial Free agglomeration) removed 924 transitions
Iterating global reduction 3 with 924 rules applied. Total rules applied 3875 place count 1090 transition count 3703
Applied a total of 3875 rules in 1192 ms. Remains 1090 /2164 variables (removed 1074) and now considering 3703/5580 (removed 1877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1202 ms. Remains : 1090/2164 places, 3703/5580 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13705041210958887543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7097272518920546046.kers'
[2026-05-25 01:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13705041210958887543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7097272518920546046.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:11:57] [INFO ] Computed 32 invariants in 25 ms
Computed 32 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-7097272518920546046.kers
Total runtime 28 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7125 resets) in 7134 ms. (140 steps per ms)
BEST_FIRST walk for 15000014 steps (3067 resets) in 14623 ms. (1025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2026-05-25 01:12:19] [INFO ] Invariant cache hit.
[2026-05-25 01:12:19] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:12:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:20] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2026-05-25 01:12:20] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:12:20] [INFO ] [Real]Added 3583 Read/Feed constraints in 289 ms returned sat
[2026-05-25 01:12:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:12:21] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:12:21] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Nat]Added 3583 Read/Feed constraints in 418 ms returned sat
[2026-05-25 01:12:22] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 157 ms.
[2026-05-25 01:12:22] [INFO ] Added : 8 causal constraints over 2 iterations in 695 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:12:27] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:28] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:12:28] [INFO ] [Real]Added 3583 Read/Feed constraints in 295 ms returned sat
[2026-05-25 01:12:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:29] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2026-05-25 01:12:29] [INFO ] [Nat]Added 3583 Read/Feed constraints in 377 ms returned sat
[2026-05-25 01:12:29] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 01:12:30] [INFO ] Added : 6 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:12:34] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:12:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:12:35] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:12:35] [INFO ] [Real]Added 3583 Read/Feed constraints in 336 ms returned sat
[2026-05-25 01:12:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:12:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 01:12:36] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:12:37] [INFO ] [Nat]Added 3583 Read/Feed constraints in 295 ms returned sat
[2026-05-25 01:12:37] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 154 ms.
[2026-05-25 01:12:37] [INFO ] Added : 6 causal constraints over 2 iterations in 685 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:12:42] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:12:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:43] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2026-05-25 01:12:43] [INFO ] [Real]Added 3583 Read/Feed constraints in 320 ms returned sat
[2026-05-25 01:12:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:12:44] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2026-05-25 01:12:45] [INFO ] [Nat]Added 3583 Read/Feed constraints in 778 ms returned sat
[2026-05-25 01:12:45] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 157 ms.
[2026-05-25 01:12:45] [INFO ] Added : 6 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 4514 ms.
[2026-05-25 01:12:50] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:12:51] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2026-05-25 01:12:51] [INFO ] [Real]Added 3583 Read/Feed constraints in 367 ms returned sat
[2026-05-25 01:12:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:52] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2026-05-25 01:12:52] [INFO ] [Nat]Added 3583 Read/Feed constraints in 371 ms returned sat
[2026-05-25 01:12:52] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:12:53] [INFO ] Added : 11 causal constraints over 3 iterations in 833 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:12:58] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:12:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:12:58] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2026-05-25 01:12:59] [INFO ] [Real]Added 3583 Read/Feed constraints in 372 ms returned sat
[2026-05-25 01:12:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:12:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:00] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2026-05-25 01:13:00] [INFO ] [Nat]Added 3583 Read/Feed constraints in 338 ms returned sat
[2026-05-25 01:13:00] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:13:01] [INFO ] Added : 8 causal constraints over 2 iterations in 689 ms. Result :sat
Minimization took 4524 ms.
[2026-05-25 01:13:05] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:06] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:13:06] [INFO ] [Real]Added 3583 Read/Feed constraints in 293 ms returned sat
[2026-05-25 01:13:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:07] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2026-05-25 01:13:07] [INFO ] [Nat]Added 3583 Read/Feed constraints in 390 ms returned sat
[2026-05-25 01:13:08] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 152 ms.
[2026-05-25 01:13:08] [INFO ] Added : 6 causal constraints over 2 iterations in 677 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:13:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:13] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2026-05-25 01:13:14] [INFO ] [Real]Added 3583 Read/Feed constraints in 337 ms returned sat
[2026-05-25 01:13:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:15] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2026-05-25 01:13:15] [INFO ] [Nat]Added 3583 Read/Feed constraints in 560 ms returned sat
[2026-05-25 01:13:15] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 159 ms.
[2026-05-25 01:13:16] [INFO ] Added : 5 causal constraints over 1 iterations in 585 ms. Result :sat
Minimization took 4531 ms.
[2026-05-25 01:13:20] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:13:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:13:21] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2026-05-25 01:13:22] [INFO ] [Real]Added 3583 Read/Feed constraints in 330 ms returned sat
[2026-05-25 01:13:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:13:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:22] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2026-05-25 01:13:23] [INFO ] [Nat]Added 3583 Read/Feed constraints in 446 ms returned sat
[2026-05-25 01:13:23] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 155 ms.
[2026-05-25 01:13:24] [INFO ] Added : 9 causal constraints over 2 iterations in 673 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:13:28] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:29] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-25 01:13:29] [INFO ] [Real]Added 3583 Read/Feed constraints in 311 ms returned sat
[2026-05-25 01:13:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:13:29] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:30] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2026-05-25 01:13:30] [INFO ] [Nat]Added 3583 Read/Feed constraints in 307 ms returned sat
[2026-05-25 01:13:30] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 144 ms.
[2026-05-25 01:13:31] [INFO ] Added : 4 causal constraints over 2 iterations in 663 ms. Result :sat
Minimization took 4511 ms.
[2026-05-25 01:13:36] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:13:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:36] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2026-05-25 01:13:37] [INFO ] [Real]Added 3583 Read/Feed constraints in 301 ms returned sat
[2026-05-25 01:13:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:13:37] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:13:38] [INFO ] [Nat]Added 3583 Read/Feed constraints in 377 ms returned sat
[2026-05-25 01:13:38] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 146 ms.
[2026-05-25 01:13:38] [INFO ] Added : 6 causal constraints over 2 iterations in 678 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:13:43] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:44] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2026-05-25 01:13:44] [INFO ] [Real]Added 3583 Read/Feed constraints in 331 ms returned sat
[2026-05-25 01:13:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:13:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:13:45] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2026-05-25 01:13:45] [INFO ] [Nat]Added 3583 Read/Feed constraints in 381 ms returned sat
[2026-05-25 01:13:45] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:13:46] [INFO ] Added : 10 causal constraints over 2 iterations in 676 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:13:51] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2026-05-25 01:13:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:51] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:13:52] [INFO ] [Real]Added 3583 Read/Feed constraints in 379 ms returned sat
[2026-05-25 01:13:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:13:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:52] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2026-05-25 01:13:53] [INFO ] [Nat]Added 3583 Read/Feed constraints in 362 ms returned sat
[2026-05-25 01:13:53] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 155 ms.
[2026-05-25 01:13:54] [INFO ] Added : 8 causal constraints over 3 iterations in 831 ms. Result :sat
Minimization took 4515 ms.
[2026-05-25 01:13:58] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:13:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:13:59] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2026-05-25 01:13:59] [INFO ] [Real]Added 3583 Read/Feed constraints in 382 ms returned sat
[2026-05-25 01:13:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:14:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:14:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:14:00] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2026-05-25 01:14:01] [INFO ] [Nat]Added 3583 Read/Feed constraints in 379 ms returned sat
[2026-05-25 01:14:01] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 147 ms.
[2026-05-25 01:14:01] [INFO ] Added : 9 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4524 ms.
[2026-05-25 01:14:06] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:14:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:14:07] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2026-05-25 01:14:07] [INFO ] [Real]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:14:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:14:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:14:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:14:08] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2026-05-25 01:14:08] [INFO ] [Nat]Added 3583 Read/Feed constraints in 361 ms returned sat
[2026-05-25 01:14:08] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 144 ms.
[2026-05-25 01:14:09] [INFO ] Added : 4 causal constraints over 1 iterations in 535 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 75 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 65 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:14:13] [INFO ] Invariant cache hit.
[2026-05-25 01:14:14] [INFO ] Implicit Places using invariants in 875 ms returned []
[2026-05-25 01:14:14] [INFO ] Invariant cache hit.
[2026-05-25 01:14:15] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:14:45] [INFO ] Performed 534/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:15:04] [INFO ] Implicit Places using invariants and state equation in 49929 ms returned []
Implicit Place search using SMT with State Equation took 50808 ms to find 0 implicit places.
[2026-05-25 01:15:04] [INFO ] Redundant transitions in 217 ms returned []
Running 3673 sub problems to find dead transitions.
[2026-05-25 01:15:04] [INFO ] Invariant cache hit.
[2026-05-25 01:15:04] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3673 unsolved
SMT process timed out in 31793ms, After SMT, problems are : Problem set: 0 solved, 3673 unsolved
Search for dead transitions found 0 dead transitions in 31825ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82965 ms. Remains : 1090/1090 places, 3703/3703 transitions.
[2026-05-25 01:15:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7113 resets) in 7365 ms. (135 steps per ms)
BEST_FIRST walk for 15000014 steps (3052 resets) in 14477 ms. (1036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2026-05-25 01:15:58] [INFO ] Invariant cache hit.
[2026-05-25 01:15:58] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:15:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:15:59] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2026-05-25 01:15:59] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:15:59] [INFO ] [Real]Added 3583 Read/Feed constraints in 291 ms returned sat
[2026-05-25 01:15:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:15:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:15:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:16:00] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-25 01:16:00] [INFO ] [Nat]Added 3583 Read/Feed constraints in 402 ms returned sat
[2026-05-25 01:16:01] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 146 ms.
[2026-05-25 01:16:01] [INFO ] Added : 8 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:16:06] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:06] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:16:07] [INFO ] [Real]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:16:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:16:07] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2026-05-25 01:16:08] [INFO ] [Nat]Added 3583 Read/Feed constraints in 368 ms returned sat
[2026-05-25 01:16:08] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 144 ms.
[2026-05-25 01:16:09] [INFO ] Added : 6 causal constraints over 2 iterations in 682 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:16:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:14] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2026-05-25 01:16:14] [INFO ] [Real]Added 3583 Read/Feed constraints in 333 ms returned sat
[2026-05-25 01:16:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:16:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:15] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-25 01:16:15] [INFO ] [Nat]Added 3583 Read/Feed constraints in 291 ms returned sat
[2026-05-25 01:16:16] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 145 ms.
[2026-05-25 01:16:16] [INFO ] Added : 6 causal constraints over 2 iterations in 663 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:16:21] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:16:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:21] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2026-05-25 01:16:22] [INFO ] [Real]Added 3583 Read/Feed constraints in 311 ms returned sat
[2026-05-25 01:16:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:16:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:22] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2026-05-25 01:16:23] [INFO ] [Nat]Added 3583 Read/Feed constraints in 782 ms returned sat
[2026-05-25 01:16:23] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:16:24] [INFO ] Added : 6 causal constraints over 2 iterations in 694 ms. Result :sat
Minimization took 4503 ms.
[2026-05-25 01:16:29] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:16:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:29] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2026-05-25 01:16:30] [INFO ] [Real]Added 3583 Read/Feed constraints in 362 ms returned sat
[2026-05-25 01:16:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:16:30] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2026-05-25 01:16:31] [INFO ] [Nat]Added 3583 Read/Feed constraints in 362 ms returned sat
[2026-05-25 01:16:31] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 01:16:32] [INFO ] Added : 11 causal constraints over 3 iterations in 821 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:16:36] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:16:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:37] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:16:37] [INFO ] [Real]Added 3583 Read/Feed constraints in 359 ms returned sat
[2026-05-25 01:16:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:38] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2026-05-25 01:16:38] [INFO ] [Nat]Added 3583 Read/Feed constraints in 318 ms returned sat
[2026-05-25 01:16:39] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 01:16:39] [INFO ] Added : 8 causal constraints over 2 iterations in 675 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:16:44] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:44] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:16:45] [INFO ] [Real]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:16:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:46] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:16:46] [INFO ] [Nat]Added 3583 Read/Feed constraints in 388 ms returned sat
[2026-05-25 01:16:46] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 151 ms.
[2026-05-25 01:16:47] [INFO ] Added : 6 causal constraints over 2 iterations in 674 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:16:51] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:16:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:16:52] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:16:52] [INFO ] [Real]Added 3583 Read/Feed constraints in 339 ms returned sat
[2026-05-25 01:16:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:16:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:16:53] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:16:53] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2026-05-25 01:16:54] [INFO ] [Nat]Added 3583 Read/Feed constraints in 555 ms returned sat
[2026-05-25 01:16:54] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:16:54] [INFO ] Added : 5 causal constraints over 1 iterations in 577 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:16:59] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:16:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:00] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2026-05-25 01:17:00] [INFO ] [Real]Added 3583 Read/Feed constraints in 327 ms returned sat
[2026-05-25 01:17:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:01] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2026-05-25 01:17:01] [INFO ] [Nat]Added 3583 Read/Feed constraints in 451 ms returned sat
[2026-05-25 01:17:01] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:17:02] [INFO ] Added : 9 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:17:07] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:17:07] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2026-05-25 01:17:08] [INFO ] [Real]Added 3583 Read/Feed constraints in 316 ms returned sat
[2026-05-25 01:17:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:08] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2026-05-25 01:17:09] [INFO ] [Nat]Added 3583 Read/Feed constraints in 316 ms returned sat
[2026-05-25 01:17:09] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 168 ms.
[2026-05-25 01:17:09] [INFO ] Added : 4 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:17:14] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:14] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:17:15] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2026-05-25 01:17:15] [INFO ] [Real]Added 3583 Read/Feed constraints in 311 ms returned sat
[2026-05-25 01:17:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:16] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2026-05-25 01:17:16] [INFO ] [Nat]Added 3583 Read/Feed constraints in 378 ms returned sat
[2026-05-25 01:17:16] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 156 ms.
[2026-05-25 01:17:17] [INFO ] Added : 6 causal constraints over 2 iterations in 695 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:17:22] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:17:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:22] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2026-05-25 01:17:23] [INFO ] [Real]Added 3583 Read/Feed constraints in 326 ms returned sat
[2026-05-25 01:17:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:23] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:17:24] [INFO ] [Nat]Added 3583 Read/Feed constraints in 385 ms returned sat
[2026-05-25 01:17:24] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 01:17:25] [INFO ] Added : 10 causal constraints over 2 iterations in 684 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:17:29] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:17:30] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2026-05-25 01:17:30] [INFO ] [Real]Added 3583 Read/Feed constraints in 382 ms returned sat
[2026-05-25 01:17:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:31] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2026-05-25 01:17:31] [INFO ] [Nat]Added 3583 Read/Feed constraints in 374 ms returned sat
[2026-05-25 01:17:32] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 154 ms.
[2026-05-25 01:17:32] [INFO ] Added : 8 causal constraints over 3 iterations in 815 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:17:37] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:17:38] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:17:38] [INFO ] [Real]Added 3583 Read/Feed constraints in 376 ms returned sat
[2026-05-25 01:17:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:17:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:17:39] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2026-05-25 01:17:39] [INFO ] [Nat]Added 3583 Read/Feed constraints in 382 ms returned sat
[2026-05-25 01:17:39] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:17:40] [INFO ] Added : 9 causal constraints over 2 iterations in 685 ms. Result :sat
Minimization took 4503 ms.
[2026-05-25 01:17:45] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:17:45] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:45] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2026-05-25 01:17:46] [INFO ] [Real]Added 3583 Read/Feed constraints in 298 ms returned sat
[2026-05-25 01:17:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:17:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:17:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:17:46] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2026-05-25 01:17:47] [INFO ] [Nat]Added 3583 Read/Feed constraints in 371 ms returned sat
[2026-05-25 01:17:47] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 151 ms.
[2026-05-25 01:17:47] [INFO ] Added : 4 causal constraints over 1 iterations in 544 ms. Result :sat
Minimization took 4599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 85 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 71 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:17:52] [INFO ] Invariant cache hit.
[2026-05-25 01:17:53] [INFO ] Implicit Places using invariants in 851 ms returned []
[2026-05-25 01:17:53] [INFO ] Invariant cache hit.
[2026-05-25 01:17:54] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:18:24] [INFO ] Performed 535/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:18:43] [INFO ] Implicit Places using invariants and state equation in 49822 ms returned []
Implicit Place search using SMT with State Equation took 50675 ms to find 0 implicit places.
[2026-05-25 01:18:43] [INFO ] Redundant transitions in 237 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50995 ms. Remains : 1090/1090 places, 3703/3703 transitions.
RANDOM walk for 40000 steps (282 resets) in 1683 ms. (23 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
[2026-05-25 01:18:44] [INFO ] Flatten gal took : 360 ms
[2026-05-25 01:18:44] [INFO ] Flatten gal took : 182 ms
[2026-05-25 01:18:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16087882602191945376.gal : 94 ms
[2026-05-25 01:18:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12567304542910878034.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/ReachabilityCardinality16087882602191945376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12567304542910878034.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/ReachabilityCardinality12567304542910878034.prop.
Interrupted probabilistic random walk after 171031 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 30
Probabilistic random walk after 171031 steps, saw 32366 distinct states, run finished after 3005 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-25 01:18:47] [INFO ] Invariant cache hit.
[2026-05-25 01:18:47] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 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
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 0/33 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 3703/4791 variables, 1088/1121 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (INCLUDED_ONLY) 0/4791 variables, 3583/4704 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1171 after 1354
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :1354 after 1559
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1559 after 1719
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :1719 after 1736
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :1736 after 1783
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :1783 after 1877
At refinement iteration 10 (INCLUDED_ONLY) 0/4791 variables, 0/4704 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/4793 variables, 2/4706 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4793/4793 variables, and 4706 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :1877 after 2127
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 20/22 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 8/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 58/1086 variables, 29/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :2127 after 2433
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 2/1088 variables, 2/61 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 2/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 0/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SMT process timed out in 10066ms, After SMT, problems are : Problem set: 15 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 73 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1090/1090 places, 3703/3703 transitions.
RANDOM walk for 40000 steps (283 resets) in 651 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 179477 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 15
Probabilistic random walk after 179477 steps, saw 33314 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-25 01:19:00] [INFO ] Invariant cache hit.
[2026-05-25 01:19:00] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/1086 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/1088 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3703/4791 variables, 1088/1120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :2433 after 3058
At refinement iteration 8 (INCLUDED_ONLY) 0/4791 variables, 3583/4703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4791 variables, 0/4703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/4793 variables, 2/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4793 variables, 0/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/4793 variables, 0/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4793/4793 variables, and 4705 constraints, problems are : Problem set: 0 solved, 15 unsolved in 13827 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 3703/4791 variables, 1088/1122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4791 variables, 3583/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Detected timeout of ITS tools.
[2026-05-25 01:19:34] [INFO ] Flatten gal took : 105 ms
[2026-05-25 01:19:34] [INFO ] Applying decomposition
[2026-05-25 01:19:34] [INFO ] Flatten gal took : 72 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/graph6888702177833746281.txt' '-o' '/tmp/graph6888702177833746281.bin' '-w' '/tmp/graph6888702177833746281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6888702177833746281.bin' '-l' '-1' '-v' '-w' '/tmp/graph6888702177833746281.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:19:35] [INFO ] Decomposing Gal with order
[2026-05-25 01:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:19:35] [INFO ] Removed a total of 2811 redundant transitions.
[2026-05-25 01:19:35] [INFO ] Flatten gal took : 424 ms
[2026-05-25 01:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2901 labels/synchronizations in 175 ms.
[2026-05-25 01:19:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8751994228787885776.gal : 36 ms
[2026-05-25 01:19:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8958193899255501926.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/ReachabilityCardinality8751994228787885776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8958193899255501926.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/ReachabilityCardinality8958193899255501926.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 496
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :496 after 496
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :496 after 496
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :496 after 496
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :496 after 496
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :496 after 515
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :515 after 518
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :518 after 526
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :526 after 631
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :631 after 64011
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :64011 after 2.08647e+06
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :2.08647e+06 after 3.54334e+06
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 15/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :3.54334e+06 after 8.47146e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4791/4793 variables, and 4720 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58892ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 94 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 75 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:19:59] [INFO ] Invariant cache hit.
[2026-05-25 01:20:00] [INFO ] Implicit Places using invariants in 868 ms returned []
[2026-05-25 01:20:00] [INFO ] Invariant cache hit.
[2026-05-25 01:20:01] [INFO ] State equation strengthened by 3583 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :8.47146e+07 after 1.07983e+08
Detected timeout of ITS tools.
[2026-05-25 01:20:31] [INFO ] Performed 543/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:20:50] [INFO ] Implicit Places using invariants and state equation in 49589 ms returned []
Implicit Place search using SMT with State Equation took 50460 ms to find 0 implicit places.
[2026-05-25 01:20:50] [INFO ] Redundant transitions in 182 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50726 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29]
[2026-05-25 01:20:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29]
RANDOM walk for 1000000 steps (7123 resets) in 7067 ms. (141 steps per ms)
BEST_FIRST walk for 15000014 steps (3044 resets) in 14496 ms. (1034 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29]
[2026-05-25 01:21:11] [INFO ] Invariant cache hit.
[2026-05-25 01:21:12] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:21:12] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:12] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2026-05-25 01:21:12] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:21:12] [INFO ] [Real]Added 3583 Read/Feed constraints in 279 ms returned sat
[2026-05-25 01:21:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:21:13] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:13] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2026-05-25 01:21:14] [INFO ] [Nat]Added 3583 Read/Feed constraints in 408 ms returned sat
[2026-05-25 01:21:14] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 156 ms.
[2026-05-25 01:21:14] [INFO ] Added : 8 causal constraints over 2 iterations in 703 ms. Result :sat
Minimization took 4503 ms.
[2026-05-25 01:21:19] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:20] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2026-05-25 01:21:20] [INFO ] [Real]Added 3583 Read/Feed constraints in 302 ms returned sat
[2026-05-25 01:21:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:21] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-25 01:21:21] [INFO ] [Nat]Added 3583 Read/Feed constraints in 390 ms returned sat
[2026-05-25 01:21:21] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 154 ms.
[2026-05-25 01:21:22] [INFO ] Added : 6 causal constraints over 2 iterations in 707 ms. Result :sat
Minimization took 4504 ms.
[2026-05-25 01:21:27] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:21:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:27] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2026-05-25 01:21:28] [INFO ] [Real]Added 3583 Read/Feed constraints in 348 ms returned sat
[2026-05-25 01:21:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:21:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:29] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2026-05-25 01:21:29] [INFO ] [Nat]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:21:29] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 152 ms.
[2026-05-25 01:21:30] [INFO ] Added : 6 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:21:34] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:21:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:35] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2026-05-25 01:21:35] [INFO ] [Real]Added 3583 Read/Feed constraints in 321 ms returned sat
[2026-05-25 01:21:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:35] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:21:36] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2026-05-25 01:21:37] [INFO ] [Nat]Added 3583 Read/Feed constraints in 775 ms returned sat
[2026-05-25 01:21:37] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:21:38] [INFO ] Added : 6 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 4506 ms.
[2026-05-25 01:21:42] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:43] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:21:43] [INFO ] [Real]Added 3583 Read/Feed constraints in 357 ms returned sat
[2026-05-25 01:21:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:44] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2026-05-25 01:21:44] [INFO ] [Nat]Added 3583 Read/Feed constraints in 361 ms returned sat
[2026-05-25 01:21:45] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:21:45] [INFO ] Added : 11 causal constraints over 3 iterations in 821 ms. Result :sat
Minimization took 4545 ms.
[2026-05-25 01:21:50] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:51] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2026-05-25 01:21:51] [INFO ] [Real]Added 3583 Read/Feed constraints in 362 ms returned sat
[2026-05-25 01:21:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:21:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:52] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2026-05-25 01:21:52] [INFO ] [Nat]Added 3583 Read/Feed constraints in 316 ms returned sat
[2026-05-25 01:21:52] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 147 ms.
[2026-05-25 01:21:53] [INFO ] Added : 8 causal constraints over 2 iterations in 674 ms. Result :sat
Minimization took 4507 ms.
[2026-05-25 01:21:57] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:21:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:58] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:21:58] [INFO ] [Real]Added 3583 Read/Feed constraints in 297 ms returned sat
[2026-05-25 01:21:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:21:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:21:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:21:59] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2026-05-25 01:22:00] [INFO ] [Nat]Added 3583 Read/Feed constraints in 391 ms returned sat
[2026-05-25 01:22:00] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:22:00] [INFO ] Added : 6 causal constraints over 2 iterations in 682 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:22:05] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:06] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:22:06] [INFO ] [Real]Added 3583 Read/Feed constraints in 356 ms returned sat
[2026-05-25 01:22:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:22:07] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-25 01:22:07] [INFO ] [Nat]Added 3583 Read/Feed constraints in 548 ms returned sat
[2026-05-25 01:22:08] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:22:08] [INFO ] Added : 5 causal constraints over 1 iterations in 580 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:22:13] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:13] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2026-05-25 01:22:14] [INFO ] [Real]Added 3583 Read/Feed constraints in 331 ms returned sat
[2026-05-25 01:22:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:14] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2026-05-25 01:22:15] [INFO ] [Nat]Added 3583 Read/Feed constraints in 449 ms returned sat
[2026-05-25 01:22:15] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:22:16] [INFO ] Added : 9 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:22:20] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:21] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2026-05-25 01:22:21] [INFO ] [Real]Added 3583 Read/Feed constraints in 319 ms returned sat
[2026-05-25 01:22:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:21] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:22] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2026-05-25 01:22:22] [INFO ] [Nat]Added 3583 Read/Feed constraints in 313 ms returned sat
[2026-05-25 01:22:23] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:22:23] [INFO ] Added : 4 causal constraints over 2 iterations in 679 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:22:28] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:28] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:22:29] [INFO ] [Real]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:22:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:22:29] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:22:29] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2026-05-25 01:22:30] [INFO ] [Nat]Added 3583 Read/Feed constraints in 381 ms returned sat
[2026-05-25 01:22:30] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 151 ms.
[2026-05-25 01:22:31] [INFO ] Added : 6 causal constraints over 2 iterations in 685 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:22:35] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:35] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:36] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2026-05-25 01:22:36] [INFO ] [Real]Added 3583 Read/Feed constraints in 322 ms returned sat
[2026-05-25 01:22:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:37] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2026-05-25 01:22:37] [INFO ] [Nat]Added 3583 Read/Feed constraints in 378 ms returned sat
[2026-05-25 01:22:38] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:22:38] [INFO ] Added : 10 causal constraints over 2 iterations in 693 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:22:43] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:43] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:22:44] [INFO ] [Real]Added 3583 Read/Feed constraints in 377 ms returned sat
[2026-05-25 01:22:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:22:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:45] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2026-05-25 01:22:45] [INFO ] [Nat]Added 3583 Read/Feed constraints in 364 ms returned sat
[2026-05-25 01:22:45] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:22:46] [INFO ] Added : 8 causal constraints over 3 iterations in 830 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:22:51] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:51] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2026-05-25 01:22:52] [INFO ] [Real]Added 3583 Read/Feed constraints in 370 ms returned sat
[2026-05-25 01:22:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:22:52] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2026-05-25 01:22:53] [INFO ] [Nat]Added 3583 Read/Feed constraints in 375 ms returned sat
[2026-05-25 01:22:53] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:22:54] [INFO ] Added : 9 causal constraints over 2 iterations in 684 ms. Result :sat
Minimization took 4513 ms.
[2026-05-25 01:22:58] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:22:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:22:59] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2026-05-25 01:22:59] [INFO ] [Real]Added 3583 Read/Feed constraints in 297 ms returned sat
[2026-05-25 01:22:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:22:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:22:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:23:00] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:23:00] [INFO ] [Nat]Added 3583 Read/Feed constraints in 370 ms returned sat
[2026-05-25 01:23:01] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:23:01] [INFO ] Added : 4 causal constraints over 1 iterations in 539 ms. Result :sat
Minimization took 4576 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 78 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 67 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:23:06] [INFO ] Invariant cache hit.
[2026-05-25 01:23:06] [INFO ] Implicit Places using invariants in 856 ms returned []
[2026-05-25 01:23:06] [INFO ] Invariant cache hit.
[2026-05-25 01:23:07] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:23:37] [INFO ] Performed 547/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:23:56] [INFO ] Implicit Places using invariants and state equation in 49139 ms returned []
Implicit Place search using SMT with State Equation took 49996 ms to find 0 implicit places.
[2026-05-25 01:23:56] [INFO ] Redundant transitions in 130 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50203 ms. Remains : 1090/1090 places, 3703/3703 transitions.
[2026-05-25 01:23:56] [INFO ] Flatten gal took : 134 ms
RANDOM walk for 40000 steps (282 resets) in 689 ms. (57 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
[2026-05-25 01:23:56] [INFO ] Flatten gal took : 116 ms
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
[2026-05-25 01:23:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16407572298441837695.gal : 46 ms
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
[2026-05-25 01:23:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9027916330102578936.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/ReachabilityCardinality16407572298441837695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9027916330102578936.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 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
Loading property file /tmp/ReachabilityCardinality9027916330102578936.prop.
Interrupted probabilistic random walk after 174978 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 30
Probabilistic random walk after 174978 steps, saw 32803 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-25 01:23:59] [INFO ] Invariant cache hit.
[2026-05-25 01:23:59] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 963
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1171 after 1354
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :1354 after 1559
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1559 after 1719
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :1719 after 1736
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :1736 after 1783
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :1783 after 1877
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :1877 after 2127
SMT process timed out in 5628ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 66 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1090/1090 places, 3703/3703 transitions.
RANDOM walk for 40000 steps (283 resets) in 633 ms. (63 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :2127 after 2433
Interrupted probabilistic random walk after 172938 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 30
Probabilistic random walk after 172938 steps, saw 32561 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2026-05-25 01:24:08] [INFO ] Invariant cache hit.
[2026-05-25 01:24:08] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :2433 after 3058
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 30 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
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 10/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 0/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3703/4791 variables, 1088/1151 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 3583/4734 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4791 variables, 0/4734 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 2/4793 variables, 2/4736 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4793 variables, 0/4736 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/4793 variables, 0/4736 constraints. Problems are: Problem set: 15 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4793/4793 variables, and 4736 constraints, problems are : Problem set: 15 solved, 15 unsolved in 35619 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 1/32 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 0/32 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/1088 variables, 2/34 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 29/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 0/63 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3703/4791 variables, 1088/1151 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Detected timeout of ITS tools.
[2026-05-25 01:24:46] [INFO ] Flatten gal took : 49 ms
[2026-05-25 01:24:46] [INFO ] Applying decomposition
[2026-05-25 01:24:46] [INFO ] Flatten gal took : 53 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/graph16067585939749563904.txt' '-o' '/tmp/graph16067585939749563904.bin' '-w' '/tmp/graph16067585939749563904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16067585939749563904.bin' '-l' '-1' '-v' '-w' '/tmp/graph16067585939749563904.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:24:46] [INFO ] Decomposing Gal with order
[2026-05-25 01:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:24:47] [INFO ] Removed a total of 2813 redundant transitions.
[2026-05-25 01:24:47] [INFO ] Flatten gal took : 196 ms
[2026-05-25 01:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 3049 labels/synchronizations in 94 ms.
[2026-05-25 01:24:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5846098684346570481.gal : 24 ms
[2026-05-25 01:24:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4833340862405557577.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/ReachabilityCardinality5846098684346570481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4833340862405557577.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/ReachabilityCardinality4833340862405557577.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 63
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :63 after 63
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :63 after 2794
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :2794 after 3833
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :3833 after 213353
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 3583/4734 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :213353 after 6.46915e+06
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :6.46915e+06 after 7.96426e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/4791 variables, 15/4749 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,15 properties remain. new max is 32768
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4791/4793 variables, and 4749 constraints, problems are : Problem set: 15 solved, 15 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 15/30 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 80678ms problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
SDD size :7.96426e+06 after 1.88653e+08
Applied a total of 0 rules in 65 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1090/1090 places, 3703/3703 transitions.
RANDOM walk for 40000 steps (282 resets) in 535 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 180034 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 15
Probabilistic random walk after 180034 steps, saw 33372 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-25 01:25:32] [INFO ] Invariant cache hit.
[2026-05-25 01:25:32] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/1086 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/1088 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3703/4791 variables, 1088/1120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4791 variables, 3583/4703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4791 variables, 0/4703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Detected timeout of ITS tools.
At refinement iteration 10 (OVERLAPS) 2/4793 variables, 2/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4793 variables, 0/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/4793 variables, 0/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4793/4793 variables, and 4705 constraints, problems are : Problem set: 0 solved, 15 unsolved in 13336 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 3703/4791 variables, 1088/1122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4791 variables, 3583/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 15/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4791 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 2/4793 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4793/4793 variables, and 4722 constraints, problems are : Problem set: 0 solved, 15 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88384ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 69 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:27:01] [INFO ] Invariant cache hit.
[2026-05-25 01:27:02] [INFO ] Implicit Places using invariants in 830 ms returned []
[2026-05-25 01:27:02] [INFO ] Invariant cache hit.
[2026-05-25 01:27:02] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:27:33] [INFO ] Performed 593/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:27:48] [INFO ] Implicit Places using invariants and state equation in 46773 ms returned []
Implicit Place search using SMT with State Equation took 47608 ms to find 0 implicit places.
[2026-05-25 01:27:48] [INFO ] Redundant transitions in 122 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47804 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28]
[2026-05-25 01:27:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28]
RANDOM walk for 1000000 steps (7111 resets) in 6833 ms. (146 steps per ms)
BEST_FIRST walk for 15000014 steps (3049 resets) in 14239 ms. (1053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28]
[2026-05-25 01:28:10] [INFO ] Invariant cache hit.
[2026-05-25 01:28:10] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:28:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:28:10] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2026-05-25 01:28:10] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:28:11] [INFO ] [Real]Added 3583 Read/Feed constraints in 286 ms returned sat
[2026-05-25 01:28:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:11] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:28:12] [INFO ] [Nat]Added 3583 Read/Feed constraints in 396 ms returned sat
[2026-05-25 01:28:12] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 144 ms.
[2026-05-25 01:28:13] [INFO ] Added : 8 causal constraints over 2 iterations in 696 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:28:17] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:28:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:28:18] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-25 01:28:18] [INFO ] [Real]Added 3583 Read/Feed constraints in 296 ms returned sat
[2026-05-25 01:28:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:28:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:19] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2026-05-25 01:28:19] [INFO ] [Nat]Added 3583 Read/Feed constraints in 378 ms returned sat
[2026-05-25 01:28:20] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:28:20] [INFO ] Added : 6 causal constraints over 2 iterations in 686 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:28:25] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:25] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:28:26] [INFO ] [Real]Added 3583 Read/Feed constraints in 336 ms returned sat
[2026-05-25 01:28:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:28:26] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2026-05-25 01:28:27] [INFO ] [Nat]Added 3583 Read/Feed constraints in 295 ms returned sat
[2026-05-25 01:28:27] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 145 ms.
[2026-05-25 01:28:28] [INFO ] Added : 6 causal constraints over 2 iterations in 672 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:28:32] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:33] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2026-05-25 01:28:33] [INFO ] [Real]Added 3583 Read/Feed constraints in 322 ms returned sat
[2026-05-25 01:28:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:28:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:28:34] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2026-05-25 01:28:35] [INFO ] [Nat]Added 3583 Read/Feed constraints in 783 ms returned sat
[2026-05-25 01:28:35] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 144 ms.
[2026-05-25 01:28:35] [INFO ] Added : 6 causal constraints over 2 iterations in 680 ms. Result :sat
Minimization took 4512 ms.
[2026-05-25 01:28:40] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:41] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2026-05-25 01:28:41] [INFO ] [Real]Added 3583 Read/Feed constraints in 357 ms returned sat
[2026-05-25 01:28:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:42] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2026-05-25 01:28:42] [INFO ] [Nat]Added 3583 Read/Feed constraints in 361 ms returned sat
[2026-05-25 01:28:42] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 01:28:43] [INFO ] Added : 11 causal constraints over 3 iterations in 846 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:28:48] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:48] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2026-05-25 01:28:49] [INFO ] [Real]Added 3583 Read/Feed constraints in 360 ms returned sat
[2026-05-25 01:28:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:50] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:28:50] [INFO ] [Nat]Added 3583 Read/Feed constraints in 324 ms returned sat
[2026-05-25 01:28:50] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 159 ms.
[2026-05-25 01:28:51] [INFO ] Added : 8 causal constraints over 2 iterations in 705 ms. Result :sat
Minimization took 4528 ms.
[2026-05-25 01:28:55] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:28:56] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2026-05-25 01:28:56] [INFO ] [Real]Added 3583 Read/Feed constraints in 290 ms returned sat
[2026-05-25 01:28:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:28:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:28:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:28:57] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2026-05-25 01:28:58] [INFO ] [Nat]Added 3583 Read/Feed constraints in 391 ms returned sat
[2026-05-25 01:28:58] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 152 ms.
[2026-05-25 01:28:58] [INFO ] Added : 6 causal constraints over 2 iterations in 673 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:29:03] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:03] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:03] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2026-05-25 01:29:04] [INFO ] [Real]Added 3583 Read/Feed constraints in 336 ms returned sat
[2026-05-25 01:29:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:04] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:29:05] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2026-05-25 01:29:05] [INFO ] [Nat]Added 3583 Read/Feed constraints in 555 ms returned sat
[2026-05-25 01:29:05] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 146 ms.
[2026-05-25 01:29:06] [INFO ] Added : 5 causal constraints over 1 iterations in 584 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 01:29:11] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:11] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:11] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:29:12] [INFO ] [Real]Added 3583 Read/Feed constraints in 320 ms returned sat
[2026-05-25 01:29:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:12] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2026-05-25 01:29:13] [INFO ] [Nat]Added 3583 Read/Feed constraints in 432 ms returned sat
[2026-05-25 01:29:13] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 143 ms.
[2026-05-25 01:29:13] [INFO ] Added : 9 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:29:18] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:19] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:29:19] [INFO ] [Real]Added 3583 Read/Feed constraints in 307 ms returned sat
[2026-05-25 01:29:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:20] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2026-05-25 01:29:20] [INFO ] [Nat]Added 3583 Read/Feed constraints in 306 ms returned sat
[2026-05-25 01:29:20] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 145 ms.
[2026-05-25 01:29:21] [INFO ] Added : 4 causal constraints over 2 iterations in 674 ms. Result :sat
Minimization took 4527 ms.
[2026-05-25 01:29:26] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:26] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2026-05-25 01:29:26] [INFO ] [Real]Added 3583 Read/Feed constraints in 302 ms returned sat
[2026-05-25 01:29:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:29:27] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2026-05-25 01:29:28] [INFO ] [Nat]Added 3583 Read/Feed constraints in 372 ms returned sat
[2026-05-25 01:29:28] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 145 ms.
[2026-05-25 01:29:28] [INFO ] Added : 6 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:29:33] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:34] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2026-05-25 01:29:34] [INFO ] [Real]Added 3583 Read/Feed constraints in 337 ms returned sat
[2026-05-25 01:29:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:35] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2026-05-25 01:29:35] [INFO ] [Nat]Added 3583 Read/Feed constraints in 395 ms returned sat
[2026-05-25 01:29:35] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 155 ms.
[2026-05-25 01:29:36] [INFO ] Added : 10 causal constraints over 2 iterations in 692 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:29:41] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:41] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2026-05-25 01:29:42] [INFO ] [Real]Added 3583 Read/Feed constraints in 385 ms returned sat
[2026-05-25 01:29:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:29:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:43] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2026-05-25 01:29:43] [INFO ] [Nat]Added 3583 Read/Feed constraints in 370 ms returned sat
[2026-05-25 01:29:43] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 155 ms.
[2026-05-25 01:29:44] [INFO ] Added : 8 causal constraints over 3 iterations in 834 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 01:29:48] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:29:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:49] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2026-05-25 01:29:50] [INFO ] [Real]Added 3583 Read/Feed constraints in 391 ms returned sat
[2026-05-25 01:29:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:29:50] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2026-05-25 01:29:51] [INFO ] [Nat]Added 3583 Read/Feed constraints in 385 ms returned sat
[2026-05-25 01:29:51] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 151 ms.
[2026-05-25 01:29:51] [INFO ] Added : 9 causal constraints over 2 iterations in 693 ms. Result :sat
Minimization took 4514 ms.
[2026-05-25 01:29:56] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:29:56] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:57] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:29:57] [INFO ] [Real]Added 3583 Read/Feed constraints in 306 ms returned sat
[2026-05-25 01:29:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:29:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:29:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:29:58] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2026-05-25 01:29:58] [INFO ] [Nat]Added 3583 Read/Feed constraints in 382 ms returned sat
[2026-05-25 01:29:58] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 155 ms.
[2026-05-25 01:29:59] [INFO ] Added : 4 causal constraints over 1 iterations in 550 ms. Result :sat
Minimization took 4573 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 72 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:30:04] [INFO ] Invariant cache hit.
[2026-05-25 01:30:04] [INFO ] Implicit Places using invariants in 853 ms returned []
[2026-05-25 01:30:04] [INFO ] Invariant cache hit.
[2026-05-25 01:30:05] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:30:35] [INFO ] Performed 561/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:30:53] [INFO ] Implicit Places using invariants and state equation in 48328 ms returned []
Implicit Place search using SMT with State Equation took 49183 ms to find 0 implicit places.
[2026-05-25 01:30:53] [INFO ] Redundant transitions in 130 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49387 ms. Remains : 1090/1090 places, 3703/3703 transitions.
[2026-05-25 01:30:53] [INFO ] Flatten gal took : 99 ms
[2026-05-25 01:30:53] [INFO ] Flatten gal took : 93 ms
RANDOM walk for 40000 steps (283 resets) in 623 ms. (64 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
[2026-05-25 01:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14517708024746988727.gal : 34 ms
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
[2026-05-25 01:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5092549909767679576.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/ReachabilityCardinality14517708024746988727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5092549909767679576.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
Loading property file /tmp/ReachabilityCardinality5092549909767679576.prop.
Interrupted probabilistic random walk after 175540 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 30
Probabilistic random walk after 175540 steps, saw 32870 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-25 01:30:56] [INFO ] Invariant cache hit.
[2026-05-25 01:30:56] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1171 after 1354
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :1354 after 1559
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1559 after 1719
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :1719 after 1736
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :1736 after 1783
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :1783 after 1877
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :1877 after 2127
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/4793 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/3583 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :2127 after 2433
SMT process timed out in 10450ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 67 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1090/1090 places, 3703/3703 transitions.
RANDOM walk for 40000 steps (280 resets) in 611 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 175948 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 30
Probabilistic random walk after 175948 steps, saw 32916 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-25 01:31:10] [INFO ] Invariant cache hit.
[2026-05-25 01:31:10] [INFO ] State equation strengthened by 3583 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :2433 after 3058
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 3703/4791 variables, 1088/1123 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4791 variables, 3583/4706 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 0/4706 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Detected timeout of ITS tools.
[2026-05-25 01:31:43] [INFO ] Flatten gal took : 63 ms
[2026-05-25 01:31:43] [INFO ] Applying decomposition
[2026-05-25 01:31:43] [INFO ] Flatten gal took : 48 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/graph4097878416285245584.txt' '-o' '/tmp/graph4097878416285245584.bin' '-w' '/tmp/graph4097878416285245584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4097878416285245584.bin' '-l' '-1' '-v' '-w' '/tmp/graph4097878416285245584.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:31:44] [INFO ] Decomposing Gal with order
[2026-05-25 01:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:31:44] [INFO ] Removed a total of 2813 redundant transitions.
[2026-05-25 01:31:44] [INFO ] Flatten gal took : 158 ms
[2026-05-25 01:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 3049 labels/synchronizations in 91 ms.
[2026-05-25 01:31:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9746223449173040152.gal : 25 ms
[2026-05-25 01:31:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7295878433255458844.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/ReachabilityCardinality9746223449173040152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7295878433255458844.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/ReachabilityCardinality7295878433255458844.prop.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 610
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :610 after 610
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :610 after 1646
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :1646 after 2215
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :2215 after 107445
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :107445 after 4.44541e+06
SDD proceeding with computation,30 properties remain. new max is 16384
SDD size :4.44541e+06 after 5.85955e+06
At refinement iteration 12 (OVERLAPS) 2/4793 variables, 2/4708 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4793/4793 variables, and 4708 constraints, problems are : Problem set: 0 solved, 30 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 3703/4791 variables, 1088/1143 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 32768
SDD size :5.85955e+06 after 1.4275e+08
Detected timeout of ITS tools.
At refinement iteration 11 (INCLUDED_ONLY) 0/4791 variables, 3583/4726 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4791/4793 variables, and 4756 constraints, problems are : Problem set: 0 solved, 30 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1090 constraints, ReadFeed: 3583/3583 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90072ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 3703/3703 (removed 0) transitions.
[2026-05-25 01:32:40] [INFO ] Invariant cache hit.
[2026-05-25 01:32:41] [INFO ] Implicit Places using invariants in 846 ms returned []
[2026-05-25 01:32:41] [INFO ] Invariant cache hit.
[2026-05-25 01:32:42] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:33:12] [INFO ] Performed 559/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:33:30] [INFO ] Implicit Places using invariants and state equation in 48417 ms returned []
Implicit Place search using SMT with State Equation took 49267 ms to find 0 implicit places.
[2026-05-25 01:33:30] [INFO ] Redundant transitions in 125 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49465 ms. Remains : 1090/1090 places, 3703/3703 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
[2026-05-25 01:33:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (69 resets) in 67 ms. (147 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:33:30] [INFO ] Invariant cache hit.
[2026-05-25 01:33:30] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:33:30] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:33:31] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2026-05-25 01:33:31] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:33:31] [INFO ] [Real]Added 3583 Read/Feed constraints in 287 ms returned sat
[2026-05-25 01:33:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:33:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2026-05-25 01:33:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:33:32] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:33:32] [INFO ] [Nat]Added 3583 Read/Feed constraints in 397 ms returned sat
[2026-05-25 01:33:32] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:33:33] [INFO ] Added : 8 causal constraints over 2 iterations in 691 ms. Result :sat
Minimization took 595 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 1082 transition count 3695
Applied a total of 22 rules in 182 ms. Remains 1082 /1090 variables (removed 8) and now considering 3695/3703 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 1082/1090 places, 3695/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17906881670839098046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5139038683974085052.kers'
[2026-05-25 01:33:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17906881670839098046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5139038683974085052.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3695 rows 1082 cols 7658 entries
Finished phase 1 with 1020 SingleSign rule and 30 generalized
[2026-05-25 01:33:34] [INFO ] Computed 32 invariants in 30 ms
Computed 32 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-5139038683974085052.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7148 resets) in 6690 ms. (149 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 944 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:33:41] [INFO ] Invariant cache hit.
[2026-05-25 01:33:41] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:33:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:33:42] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2026-05-25 01:33:42] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:33:42] [INFO ] [Real]Added 3605 Read/Feed constraints in 330 ms returned sat
[2026-05-25 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:33:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:33:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:33:43] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2026-05-25 01:33:44] [INFO ] [Nat]Added 3605 Read/Feed constraints in 404 ms returned sat
[2026-05-25 01:33:44] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 143 ms.
[2026-05-25 01:33:44] [INFO ] Added : 7 causal constraints over 2 iterations in 684 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:33:49] [INFO ] Invariant cache hit.
[2026-05-25 01:33:50] [INFO ] Implicit Places using invariants in 866 ms returned []
[2026-05-25 01:33:50] [INFO ] Invariant cache hit.
[2026-05-25 01:33:51] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:34:21] [INFO ] Performed 265/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:34:51] [INFO ] Performed 537/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:35:21] [INFO ] Performed 981/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:35:31] [INFO ] Implicit Places using invariants and state equation in 101046 ms returned []
Implicit Place search using SMT with State Equation took 101913 ms to find 0 implicit places.
[2026-05-25 01:35:31] [INFO ] Redundant transitions in 129 ms returned []
Running 3665 sub problems to find dead transitions.
[2026-05-25 01:35:31] [INFO ] Invariant cache hit.
[2026-05-25 01:35:31] [INFO ] State equation strengthened by 3605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 31460ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 31469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133595 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2026-05-25 01:36:03] [INFO ] Flatten gal took : 46 ms
[2026-05-25 01:36:03] [INFO ] Flatten gal took : 46 ms
[2026-05-25 01:36:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2679038945855135419.gal : 12 ms
[2026-05-25 01:36:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16094392538097091549.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/ReachabilityCardinality2679038945855135419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16094392538097091549.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 (282 resets) in 554 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16094392538097091549.prop.
Interrupted probabilistic random walk after 186401 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186401 steps, saw 34211 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-25 01:36:06] [INFO ] Invariant cache hit.
[2026-05-25 01:36:06] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3209 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2504
SMT process timed out in 8760ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 460 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187277 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187277 steps, saw 34316 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-25 01:36:18] [INFO ] Invariant cache hit.
[2026-05-25 01:36:18] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3060
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4254 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4775 variables, 1080/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 3605/4750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 01:36:53] [INFO ] Flatten gal took : 44 ms
[2026-05-25 01:36:53] [INFO ] Applying decomposition
[2026-05-25 01:36:53] [INFO ] Flatten gal took : 46 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/graph11501138558115217668.txt' '-o' '/tmp/graph11501138558115217668.bin' '-w' '/tmp/graph11501138558115217668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11501138558115217668.bin' '-l' '-1' '-v' '-w' '/tmp/graph11501138558115217668.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:36:53] [INFO ] Decomposing Gal with order
[2026-05-25 01:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:36:53] [INFO ] Removed a total of 2828 redundant transitions.
[2026-05-25 01:36:53] [INFO ] Flatten gal took : 142 ms
[2026-05-25 01:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 3510 labels/synchronizations in 96 ms.
[2026-05-25 01:36:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5421762486265442787.gal : 23 ms
[2026-05-25 01:36:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13045016478464914165.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/ReachabilityCardinality5421762486265442787.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13045016478464914165.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
At refinement iteration 12 (INCLUDED_ONLY) 0/4775 variables, 2/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality13045016478464914165.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1887
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1887 after 1887
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1887 after 6609
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :333486 after 528113
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4777 variables, 2/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4777/4777 variables, and 4754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40207 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44475ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 63 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:37:03] [INFO ] Invariant cache hit.
[2026-05-25 01:37:03] [INFO ] Implicit Places using invariants in 852 ms returned []
[2026-05-25 01:37:03] [INFO ] Invariant cache hit.
[2026-05-25 01:37:04] [INFO ] State equation strengthened by 3605 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :528113 after 3.31044e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.31044e+07 after 5.84798e+07
[2026-05-25 01:37:34] [INFO ] Performed 263/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-25 01:38:05] [INFO ] Performed 534/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:38:35] [INFO ] Performed 988/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:38:44] [INFO ] Implicit Places using invariants and state equation in 100235 ms returned []
Implicit Place search using SMT with State Equation took 101088 ms to find 0 implicit places.
[2026-05-25 01:38:44] [INFO ] Redundant transitions in 128 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101288 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00 in 314026 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01
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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5188680960605140768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3776624751146150425.kers'
[2026-05-25 01:38:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5188680960605140768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3776624751146150425.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:38:44] [INFO ] Computed 32 invariants in 32 ms
Computed 32 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-3776624751146150425.kers
Total runtime 36 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 74 ms. (133 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:38:44] [INFO ] Invariant cache hit.
[2026-05-25 01:38:44] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:38:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:38:45] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2026-05-25 01:38:45] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:38:45] [INFO ] [Real]Added 3583 Read/Feed constraints in 287 ms returned sat
[2026-05-25 01:38:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:38:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:38:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:38:46] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2026-05-25 01:38:46] [INFO ] [Nat]Added 3583 Read/Feed constraints in 353 ms returned sat
[2026-05-25 01:38:46] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 142 ms.
[2026-05-25 01:38:47] [INFO ] Added : 6 causal constraints over 2 iterations in 674 ms. Result :sat
Minimization took 593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 1082 transition count 3695
Applied a total of 22 rules in 166 ms. Remains 1082 /1090 variables (removed 8) and now considering 3695/3703 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1082/1090 places, 3695/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18432647306788701899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7920655059293149243.kers'
[2026-05-25 01:38:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18432647306788701899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7920655059293149243.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3695 rows 1082 cols 7658 entries
Finished phase 1 with 1020 SingleSign rule and 30 generalized
[2026-05-25 01:38:48] [INFO ] Computed 32 invariants in 31 ms
Computed 32 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-7920655059293149243.kers
Total runtime 39 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7148 resets) in 6827 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 922 ms. (1083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:38:55] [INFO ] Invariant cache hit.
[2026-05-25 01:38:55] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:38:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:38:56] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2026-05-25 01:38:56] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:38:56] [INFO ] [Real]Added 3605 Read/Feed constraints in 289 ms returned sat
[2026-05-25 01:38:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:38:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:38:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:38:57] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2026-05-25 01:38:58] [INFO ] [Nat]Added 3605 Read/Feed constraints in 345 ms returned sat
[2026-05-25 01:38:58] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:38:58] [INFO ] Added : 6 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 62 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:39:03] [INFO ] Invariant cache hit.
[2026-05-25 01:39:04] [INFO ] Implicit Places using invariants in 833 ms returned []
[2026-05-25 01:39:04] [INFO ] Invariant cache hit.
[2026-05-25 01:39:04] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:39:35] [INFO ] Performed 315/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:40:05] [INFO ] Performed 631/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:40:35] [INFO ] Performed 995/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:40:42] [INFO ] Implicit Places using invariants and state equation in 98231 ms returned []
Implicit Place search using SMT with State Equation took 99065 ms to find 0 implicit places.
[2026-05-25 01:40:42] [INFO ] Redundant transitions in 129 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99266 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2026-05-25 01:40:42] [INFO ] Flatten gal took : 79 ms
RANDOM walk for 40000 steps (283 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
[2026-05-25 01:40:42] [INFO ] Flatten gal took : 47 ms
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2026-05-25 01:40:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16399398882323853999.gal : 20 ms
[2026-05-25 01:40:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11916423298659511914.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/ReachabilityCardinality16399398882323853999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11916423298659511914.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
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11916423298659511914.prop.
Interrupted probabilistic random walk after 189381 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189381 steps, saw 34581 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2026-05-25 01:40:45] [INFO ] Invariant cache hit.
[2026-05-25 01:40:45] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2505
SMT process timed out in 8752ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 596 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187473 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187473 steps, saw 34338 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-25 01:40:57] [INFO ] Invariant cache hit.
[2026-05-25 01:40:57] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2505 after 3061
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4775 variables, 1080/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 3605/4750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4775 variables, 2/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4777 variables, 2/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4777/4777 variables, and 4754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25911 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30227ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 62 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:41:28] [INFO ] Invariant cache hit.
[2026-05-25 01:41:29] [INFO ] Implicit Places using invariants in 826 ms returned []
[2026-05-25 01:41:29] [INFO ] Invariant cache hit.
[2026-05-25 01:41:29] [INFO ] State equation strengthened by 3605 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 01:41:32] [INFO ] Flatten gal took : 39 ms
[2026-05-25 01:41:32] [INFO ] Applying decomposition
[2026-05-25 01:41:33] [INFO ] Flatten gal took : 40 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/graph8057455066016930268.txt' '-o' '/tmp/graph8057455066016930268.bin' '-w' '/tmp/graph8057455066016930268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8057455066016930268.bin' '-l' '-1' '-v' '-w' '/tmp/graph8057455066016930268.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:41:33] [INFO ] Decomposing Gal with order
[2026-05-25 01:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:41:33] [INFO ] Removed a total of 2828 redundant transitions.
[2026-05-25 01:41:33] [INFO ] Flatten gal took : 134 ms
[2026-05-25 01:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 3396 labels/synchronizations in 83 ms.
[2026-05-25 01:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5686562577023313446.gal : 21 ms
[2026-05-25 01:41:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality648467685399082296.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/ReachabilityCardinality5686562577023313446.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality648467685399082296.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/ReachabilityCardinality648467685399082296.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2090
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2090 after 2095
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2095 after 2096
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2096 after 2096
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2096 after 2098
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2098 after 2101
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2101 after 2107
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2107 after 2113
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2113 after 2127
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2127 after 2142
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2142 after 2411
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :382108 after 605859
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.61441e+07 after 5.72709e+07
[2026-05-25 01:42:00] [INFO ] Performed 306/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.72709e+07 after 6.82913e+07
Detected timeout of ITS tools.
[2026-05-25 01:42:30] [INFO ] Performed 610/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:43:00] [INFO ] Performed 973/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:43:09] [INFO ] Implicit Places using invariants and state equation in 100237 ms returned []
Implicit Place search using SMT with State Equation took 101066 ms to find 0 implicit places.
[2026-05-25 01:43:09] [INFO ] Redundant transitions in 130 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101266 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01 in 265251 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11631209632618973529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13519302148906959841.kers'
[2026-05-25 01:43:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11631209632618973529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13519302148906959841.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:43:09] [INFO ] Computed 32 invariants in 30 ms
Computed 32 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-13519302148906959841.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 73 ms. (135 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:43:09] [INFO ] Invariant cache hit.
[2026-05-25 01:43:09] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:43:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:43:10] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2026-05-25 01:43:10] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:43:10] [INFO ] [Real]Added 3583 Read/Feed constraints in 336 ms returned sat
[2026-05-25 01:43:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:43:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:43:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:43:11] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2026-05-25 01:43:11] [INFO ] [Nat]Added 3583 Read/Feed constraints in 287 ms returned sat
[2026-05-25 01:43:11] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 145 ms.
[2026-05-25 01:43:12] [INFO ] Added : 6 causal constraints over 2 iterations in 654 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3696
Applied a total of 21 rules in 160 ms. Remains 1083 /1090 variables (removed 7) and now considering 3696/3703 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 1083/1090 places, 3696/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16269086075748282547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11897991789613515817.kers'
[2026-05-25 01:43:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16269086075748282547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11897991789613515817.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3696 rows 1083 cols 7660 entries
Finished phase 1 with 1021 SingleSign rule and 30 generalized
[2026-05-25 01:43:13] [INFO ] Computed 32 invariants in 32 ms
Computed 32 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-11897991789613515817.kers
Total runtime 39 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7149 resets) in 6560 ms. (152 steps per ms)
BEST_FIRST walk for 1000000 steps (202 resets) in 959 ms. (1041 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:43:20] [INFO ] Invariant cache hit.
[2026-05-25 01:43:20] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:43:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:43:21] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2026-05-25 01:43:21] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:43:21] [INFO ] [Real]Added 3604 Read/Feed constraints in 363 ms returned sat
[2026-05-25 01:43:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:43:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:43:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:43:22] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2026-05-25 01:43:23] [INFO ] [Nat]Added 3604 Read/Feed constraints in 410 ms returned sat
[2026-05-25 01:43:23] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 153 ms.
[2026-05-25 01:43:23] [INFO ] Added : 7 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 60 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:43:28] [INFO ] Invariant cache hit.
[2026-05-25 01:43:29] [INFO ] Implicit Places using invariants in 820 ms returned []
[2026-05-25 01:43:29] [INFO ] Invariant cache hit.
[2026-05-25 01:43:30] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:44:00] [INFO ] Performed 384/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:44:30] [INFO ] Performed 912/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:44:40] [INFO ] Implicit Places using invariants and state equation in 70740 ms returned []
Implicit Place search using SMT with State Equation took 71562 ms to find 0 implicit places.
[2026-05-25 01:44:40] [INFO ] Redundant transitions in 125 ms returned []
Running 3666 sub problems to find dead transitions.
[2026-05-25 01:44:40] [INFO ] Invariant cache hit.
[2026-05-25 01:44:40] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 31395ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 31402ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103164 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2026-05-25 01:45:11] [INFO ] Flatten gal took : 77 ms
RANDOM walk for 40000 steps (282 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
[2026-05-25 01:45:11] [INFO ] Flatten gal took : 45 ms
[2026-05-25 01:45:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12239135763327133187.gal : 12 ms
[2026-05-25 01:45:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3431213134788303867.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/ReachabilityCardinality12239135763327133187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3431213134788303867.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3431213134788303867.prop.
Interrupted probabilistic random walk after 185215 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185215 steps, saw 34057 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 01:45:14] [INFO ] Invariant cache hit.
[2026-05-25 01:45:14] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
After SMT solving in domain Real declared 4777/4779 variables, and 4721 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4333 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1081/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2505
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4059 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8404ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (282 resets) in 407 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184452 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184452 steps, saw 33947 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 01:45:26] [INFO ] Invariant cache hit.
[2026-05-25 01:45:26] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2505 after 3061
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4723 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6427 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5814 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12254ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 61 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:45:38] [INFO ] Invariant cache hit.
[2026-05-25 01:45:39] [INFO ] Implicit Places using invariants in 835 ms returned []
[2026-05-25 01:45:39] [INFO ] Invariant cache hit.
[2026-05-25 01:45:40] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 01:46:01] [INFO ] Flatten gal took : 40 ms
[2026-05-25 01:46:01] [INFO ] Applying decomposition
[2026-05-25 01:46:01] [INFO ] Flatten gal took : 40 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/graph18204575093555919591.txt' '-o' '/tmp/graph18204575093555919591.bin' '-w' '/tmp/graph18204575093555919591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18204575093555919591.bin' '-l' '-1' '-v' '-w' '/tmp/graph18204575093555919591.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:46:02] [INFO ] Decomposing Gal with order
[2026-05-25 01:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:46:02] [INFO ] Removed a total of 2827 redundant transitions.
[2026-05-25 01:46:02] [INFO ] Flatten gal took : 132 ms
[2026-05-25 01:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 82 ms.
[2026-05-25 01:46:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12027648783680683592.gal : 20 ms
[2026-05-25 01:46:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16961829126585209554.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/ReachabilityCardinality12027648783680683592.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16961829126585209554.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/ReachabilityCardinality16961829126585209554.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 91
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :91 after 3684
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3684 after 11126
[2026-05-25 01:46:10] [INFO ] Performed 366/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11126 after 5.81945e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.81945e+07 after 6.0505e+07
[2026-05-25 01:46:40] [INFO ] Performed 875/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
Detected timeout of ITS tools.
[2026-05-25 01:46:53] [INFO ] Implicit Places using invariants and state equation in 73904 ms returned []
Implicit Place search using SMT with State Equation took 74742 ms to find 0 implicit places.
[2026-05-25 01:46:53] [INFO ] Redundant transitions in 135 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74948 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02 in 224320 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4265382435048388864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13528435891037968295.kers'
[2026-05-25 01:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4265382435048388864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13528435891037968295.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:46:53] [INFO ] Computed 32 invariants in 27 ms
Computed 32 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-13528435891037968295.kers
Total runtime 31 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 72 ms. (136 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:46:53] [INFO ] Invariant cache hit.
[2026-05-25 01:46:54] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:46:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 01:46:54] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2026-05-25 01:46:54] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:46:55] [INFO ] [Real]Added 3583 Read/Feed constraints in 316 ms returned sat
[2026-05-25 01:46:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:46:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 01:46:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:46:55] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2026-05-25 01:46:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 01:46:56] [INFO ] [Nat]Added 3583 Read/Feed constraints in 711 ms returned sat
[2026-05-25 01:46:56] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 146 ms.
[2026-05-25 01:46:57] [INFO ] Added : 3 causal constraints over 1 iterations in 548 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 1082 transition count 3695
Applied a total of 22 rules in 190 ms. Remains 1082 /1090 variables (removed 8) and now considering 3695/3703 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1082/1090 places, 3695/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15526176160322195864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18344291831101810397.kers'
[2026-05-25 01:46:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15526176160322195864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18344291831101810397.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3695 rows 1082 cols 7658 entries
Finished phase 1 with 1020 SingleSign rule and 30 generalized
[2026-05-25 01:46:58] [INFO ] Computed 32 invariants in 34 ms
Computed 32 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-18344291831101810397.kers
Total runtime 40 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7164 resets) in 6749 ms. (148 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 981 ms. (1018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:47:05] [INFO ] Invariant cache hit.
[2026-05-25 01:47:05] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:47:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 01:47:06] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2026-05-25 01:47:06] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:47:06] [INFO ] [Real]Added 3605 Read/Feed constraints in 326 ms returned sat
[2026-05-25 01:47:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:47:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:47:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:47:07] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2026-05-25 01:47:08] [INFO ] [Nat]Added 3605 Read/Feed constraints in 496 ms returned sat
[2026-05-25 01:47:08] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:47:09] [INFO ] Added : 11 causal constraints over 3 iterations in 823 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 76 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:47:13] [INFO ] Invariant cache hit.
[2026-05-25 01:47:14] [INFO ] Implicit Places using invariants in 841 ms returned []
[2026-05-25 01:47:14] [INFO ] Invariant cache hit.
[2026-05-25 01:47:15] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 01:47:45] [INFO ] Performed 324/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:48:15] [INFO ] Performed 750/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:48:37] [INFO ] Implicit Places using invariants and state equation in 82575 ms returned []
Implicit Place search using SMT with State Equation took 83418 ms to find 0 implicit places.
[2026-05-25 01:48:37] [INFO ] Redundant transitions in 130 ms returned []
Running 3665 sub problems to find dead transitions.
[2026-05-25 01:48:37] [INFO ] Invariant cache hit.
[2026-05-25 01:48:37] [INFO ] State equation strengthened by 3605 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 31394ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 31401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115029 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2026-05-25 01:49:08] [INFO ] Flatten gal took : 48 ms
[2026-05-25 01:49:08] [INFO ] Flatten gal took : 43 ms
[2026-05-25 01:49:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3835650798205332701.gal : 11 ms
[2026-05-25 01:49:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12945343592810335483.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/ReachabilityCardinality3835650798205332701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12945343592810335483.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 (282 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12945343592810335483.prop.
Interrupted probabilistic random walk after 182596 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 182596 steps, saw 33720 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-25 01:49:11] [INFO ] Invariant cache hit.
[2026-05-25 01:49:11] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3267 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2504
SMT process timed out in 8837ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 181441 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181441 steps, saw 33588 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-25 01:49:23] [INFO ] Invariant cache hit.
[2026-05-25 01:49:23] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3060
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4122 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4775 variables, 1080/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 3605/4750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4775 variables, 2/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4777 variables, 2/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 01:49:58] [INFO ] Flatten gal took : 40 ms
[2026-05-25 01:49:58] [INFO ] Applying decomposition
[2026-05-25 01:49:58] [INFO ] Flatten gal took : 41 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/graph12350921014858847111.txt' '-o' '/tmp/graph12350921014858847111.bin' '-w' '/tmp/graph12350921014858847111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12350921014858847111.bin' '-l' '-1' '-v' '-w' '/tmp/graph12350921014858847111.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:49:59] [INFO ] Decomposing Gal with order
[2026-05-25 01:49:59] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 15 (INCLUDED_ONLY) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2026-05-25 01:49:59] [INFO ] Removed a total of 2825 redundant transitions.
[2026-05-25 01:49:59] [INFO ] Flatten gal took : 138 ms
[2026-05-25 01:49:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 3277 labels/synchronizations in 84 ms.
[2026-05-25 01:49:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16377532877633251898.gal : 21 ms
[2026-05-25 01:49:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14439294517659519238.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/ReachabilityCardinality16377532877633251898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14439294517659519238.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
At refinement iteration 16 (OVERLAPS) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
Loading property file /tmp/ReachabilityCardinality14439294517659519238.prop.
After SMT solving in domain Int declared 4777/4777 variables, and 4754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31989 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36124ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 75 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 61 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 01:50:00] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2218
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2218 after 2218
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2218 after 2218
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2218 after 2226
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2226 after 2229
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2229 after 2231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2231 after 2235
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2235 after 2241
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2241 after 2253
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2253 after 2268
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2268 after 2648
[2026-05-25 01:50:01] [INFO ] Implicit Places using invariants in 852 ms returned []
[2026-05-25 01:50:01] [INFO ] Invariant cache hit.
[2026-05-25 01:50:01] [INFO ] State equation strengthened by 3605 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2648 after 390173
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :390173 after 4.68626e+07
[2026-05-25 01:50:32] [INFO ] Performed 317/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.68626e+07 after 5.13811e+07
Detected timeout of ITS tools.
[2026-05-25 01:51:02] [INFO ] Performed 734/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:51:24] [INFO ] Implicit Places using invariants and state equation in 83786 ms returned []
Implicit Place search using SMT with State Equation took 84639 ms to find 0 implicit places.
[2026-05-25 01:51:24] [INFO ] Redundant transitions in 128 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84838 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03 in 271199 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12959969151533988171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-294353356866180302.kers'
[2026-05-25 01:51:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12959969151533988171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-294353356866180302.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:51:25] [INFO ] Computed 32 invariants in 34 ms
Computed 32 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-294353356866180302.kers
Total runtime 41 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 76 ms. (129 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:51:25] [INFO ] Invariant cache hit.
[2026-05-25 01:51:25] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:51:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:51:25] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2026-05-25 01:51:25] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:51:26] [INFO ] [Real]Added 3583 Read/Feed constraints in 367 ms returned sat
[2026-05-25 01:51:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:51:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:51:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:51:27] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2026-05-25 01:51:27] [INFO ] [Nat]Added 3583 Read/Feed constraints in 373 ms returned sat
[2026-05-25 01:51:27] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 152 ms.
[2026-05-25 01:51:28] [INFO ] Added : 11 causal constraints over 3 iterations in 844 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3696
Applied a total of 21 rules in 162 ms. Remains 1083 /1090 variables (removed 7) and now considering 3696/3703 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1083/1090 places, 3696/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14517816584888387224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15674587492760872044.kers'
[2026-05-25 01:51:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14517816584888387224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15674587492760872044.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3696 rows 1083 cols 7660 entries
Finished phase 1 with 1021 SingleSign rule and 30 generalized
[2026-05-25 01:51:29] [INFO ] Computed 32 invariants in 32 ms
Computed 32 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-15674587492760872044.kers
Total runtime 40 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7146 resets) in 6854 ms. (145 steps per ms)
BEST_FIRST walk for 1000000 steps (205 resets) in 965 ms. (1035 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:51:37] [INFO ] Invariant cache hit.
[2026-05-25 01:51:37] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:51:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:51:37] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2026-05-25 01:51:37] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:51:38] [INFO ] [Real]Added 3604 Read/Feed constraints in 328 ms returned sat
[2026-05-25 01:51:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:51:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:51:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:51:38] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2026-05-25 01:51:39] [INFO ] [Nat]Added 3604 Read/Feed constraints in 368 ms returned sat
[2026-05-25 01:51:39] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 01:51:40] [INFO ] Added : 7 causal constraints over 2 iterations in 696 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:51:44] [INFO ] Invariant cache hit.
[2026-05-25 01:51:45] [INFO ] Implicit Places using invariants in 848 ms returned []
[2026-05-25 01:51:45] [INFO ] Invariant cache hit.
[2026-05-25 01:51:46] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:52:16] [INFO ] Performed 395/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:52:46] [INFO ] Performed 765/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:53:16] [INFO ] Performed 1024/1083 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:53:24] [INFO ] Implicit Places using invariants and state equation in 98421 ms returned []
Implicit Place search using SMT with State Equation took 99273 ms to find 0 implicit places.
[2026-05-25 01:53:24] [INFO ] Redundant transitions in 124 ms returned []
Running 3666 sub problems to find dead transitions.
[2026-05-25 01:53:24] [INFO ] Invariant cache hit.
[2026-05-25 01:53:24] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 31407ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 31413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130894 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2026-05-25 01:53:55] [INFO ] Flatten gal took : 43 ms
[2026-05-25 01:53:55] [INFO ] Flatten gal took : 43 ms
[2026-05-25 01:53:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3611623352636332263.gal : 10 ms
[2026-05-25 01:53:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16471366743905693596.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/ReachabilityCardinality3611623352636332263.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16471366743905693596.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 (283 resets) in 449 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16471366743905693596.prop.
Interrupted probabilistic random walk after 185660 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185660 steps, saw 34114 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 01:53:58] [INFO ] Invariant cache hit.
[2026-05-25 01:53:58] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4638 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2426
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4372 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9022ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (284 resets) in 467 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184463 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184463 steps, saw 33948 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 01:54:11] [INFO ] Invariant cache hit.
[2026-05-25 01:54:11] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2426 after 3049
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8721 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13773ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 73 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:54:25] [INFO ] Invariant cache hit.
[2026-05-25 01:54:25] [INFO ] Implicit Places using invariants in 836 ms returned []
[2026-05-25 01:54:25] [INFO ] Invariant cache hit.
[2026-05-25 01:54:26] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 01:54:45] [INFO ] Flatten gal took : 39 ms
[2026-05-25 01:54:45] [INFO ] Applying decomposition
[2026-05-25 01:54:45] [INFO ] Flatten gal took : 41 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/graph4627575321175711512.txt' '-o' '/tmp/graph4627575321175711512.bin' '-w' '/tmp/graph4627575321175711512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4627575321175711512.bin' '-l' '-1' '-v' '-w' '/tmp/graph4627575321175711512.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:54:45] [INFO ] Decomposing Gal with order
[2026-05-25 01:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:54:46] [INFO ] Removed a total of 2827 redundant transitions.
[2026-05-25 01:54:46] [INFO ] Flatten gal took : 135 ms
[2026-05-25 01:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 3454 labels/synchronizations in 89 ms.
[2026-05-25 01:54:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3429413357464665208.gal : 21 ms
[2026-05-25 01:54:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5251369179630798865.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/ReachabilityCardinality3429413357464665208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5251369179630798865.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/ReachabilityCardinality5251369179630798865.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1702
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1702 after 1702
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1702 after 2125
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2125 after 466474
[2026-05-25 01:54:56] [INFO ] Performed 391/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :466474 after 3.2929e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.2929e+07 after 3.6584e+07
[2026-05-25 01:55:26] [INFO ] Performed 756/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
Detected timeout of ITS tools.
[2026-05-25 01:55:56] [INFO ] Performed 1013/1083 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:56:05] [INFO ] Implicit Places using invariants and state equation in 99878 ms returned []
Implicit Place search using SMT with State Equation took 100714 ms to find 0 implicit places.
[2026-05-25 01:56:05] [INFO ] Redundant transitions in 127 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100912 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04 in 280901 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-05
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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11368906504830681335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4447634214831231734.kers'
[2026-05-25 01:56:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11368906504830681335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4447634214831231734.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:56:05] [INFO ] Computed 32 invariants in 32 ms
Computed 32 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-4447634214831231734.kers
Total runtime 39 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 73 ms. (135 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:56:06] [INFO ] Invariant cache hit.
[2026-05-25 01:56:06] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:56:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:56:06] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:56:06] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:56:07] [INFO ] [Real]Added 3583 Read/Feed constraints in 369 ms returned sat
[2026-05-25 01:56:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:56:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:56:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:56:07] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2026-05-25 01:56:08] [INFO ] [Nat]Added 3583 Read/Feed constraints in 331 ms returned sat
[2026-05-25 01:56:08] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 01:56:09] [INFO ] Added : 8 causal constraints over 2 iterations in 680 ms. Result :sat
Minimization took 595 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3696
Applied a total of 21 rules in 161 ms. Remains 1083 /1090 variables (removed 7) and now considering 3696/3703 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1083/1090 places, 3696/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17677876497744937234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8796709315021725409.kers'
[2026-05-25 01:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17677876497744937234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8796709315021725409.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3696 rows 1083 cols 7660 entries
Finished phase 1 with 1021 SingleSign rule and 30 generalized
[2026-05-25 01:56:09] [INFO ] Computed 32 invariants in 28 ms
Computed 32 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-8796709315021725409.kers
Total runtime 34 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7154 resets) in 6808 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 971 ms. (1028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:56:17] [INFO ] Invariant cache hit.
[2026-05-25 01:56:17] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 01:56:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:56:18] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2026-05-25 01:56:18] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:56:18] [INFO ] [Real]Added 3604 Read/Feed constraints in 409 ms returned sat
[2026-05-25 01:56:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:56:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:56:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 01:56:19] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2026-05-25 01:56:20] [INFO ] [Nat]Added 3604 Read/Feed constraints in 351 ms returned sat
[2026-05-25 01:56:20] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 147 ms.
[2026-05-25 01:56:20] [INFO ] Added : 7 causal constraints over 2 iterations in 770 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:56:25] [INFO ] Invariant cache hit.
[2026-05-25 01:56:26] [INFO ] Implicit Places using invariants in 851 ms returned []
[2026-05-25 01:56:26] [INFO ] Invariant cache hit.
[2026-05-25 01:56:27] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 01:56:57] [INFO ] Performed 396/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:57:27] [INFO ] Performed 685/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:57:56] [INFO ] Implicit Places using invariants and state equation in 90154 ms returned []
Implicit Place search using SMT with State Equation took 91008 ms to find 0 implicit places.
[2026-05-25 01:57:56] [INFO ] Redundant transitions in 127 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91205 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2026-05-25 01:57:56] [INFO ] Flatten gal took : 88 ms
RANDOM walk for 40000 steps (282 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
[2026-05-25 01:57:56] [INFO ] Flatten gal took : 44 ms
[2026-05-25 01:57:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5266493601031541155.gal : 11 ms
[2026-05-25 01:57:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5416008422112945708.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/ReachabilityCardinality5266493601031541155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5416008422112945708.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5416008422112945708.prop.
Interrupted probabilistic random walk after 185153 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185153 steps, saw 34047 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 01:57:59] [INFO ] Invariant cache hit.
[2026-05-25 01:57:59] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1873
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2123
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4721 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2505
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4492 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9525ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (283 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186393 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186393 steps, saw 34210 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-25 01:58:12] [INFO ] Invariant cache hit.
[2026-05-25 01:58:12] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2505 after 3061
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4721 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9387 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14433ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 63 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 01:58:27] [INFO ] Invariant cache hit.
[2026-05-25 01:58:28] [INFO ] Implicit Places using invariants in 840 ms returned []
[2026-05-25 01:58:28] [INFO ] Invariant cache hit.
[2026-05-25 01:58:28] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 01:58:46] [INFO ] Flatten gal took : 40 ms
[2026-05-25 01:58:46] [INFO ] Applying decomposition
[2026-05-25 01:58:46] [INFO ] Flatten gal took : 43 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/graph13621150036570467910.txt' '-o' '/tmp/graph13621150036570467910.bin' '-w' '/tmp/graph13621150036570467910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13621150036570467910.bin' '-l' '-1' '-v' '-w' '/tmp/graph13621150036570467910.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:58:47] [INFO ] Decomposing Gal with order
[2026-05-25 01:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:58:47] [INFO ] Removed a total of 2827 redundant transitions.
[2026-05-25 01:58:47] [INFO ] Flatten gal took : 137 ms
[2026-05-25 01:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 3452 labels/synchronizations in 84 ms.
[2026-05-25 01:58:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3350357958363811669.gal : 20 ms
[2026-05-25 01:58:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2485870869417159977.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/ReachabilityCardinality3350357958363811669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2485870869417159977.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/ReachabilityCardinality2485870869417159977.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 857
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :857 after 2973
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2973 after 156764
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :156764 after 6.90597e+06
[2026-05-25 01:58:59] [INFO ] Performed 395/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.90597e+06 after 1.07579e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.07579e+07 after 1.51533e+07
[2026-05-25 01:59:29] [INFO ] Performed 691/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
Detected timeout of ITS tools.
[2026-05-25 01:59:57] [INFO ] Implicit Places using invariants and state equation in 88988 ms returned []
Implicit Place search using SMT with State Equation took 89829 ms to find 0 implicit places.
[2026-05-25 01:59:57] [INFO ] Redundant transitions in 130 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90032 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-05 in 231264 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4251639984492023409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17044166769925089960.kers'
[2026-05-25 01:59:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4251639984492023409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17044166769925089960.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 01:59:57] [INFO ] Computed 32 invariants in 33 ms
Computed 32 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-17044166769925089960.kers
Total runtime 41 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 75 ms. (131 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 01:59:57] [INFO ] Invariant cache hit.
[2026-05-25 01:59:57] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:59:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:59:58] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-05-25 01:59:58] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 01:59:58] [INFO ] [Real]Added 3583 Read/Feed constraints in 288 ms returned sat
[2026-05-25 01:59:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:59:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 01:59:58] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 01:59:59] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2026-05-25 01:59:59] [INFO ] [Nat]Added 3583 Read/Feed constraints in 388 ms returned sat
[2026-05-25 01:59:59] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 149 ms.
[2026-05-25 02:00:00] [INFO ] Added : 6 causal constraints over 2 iterations in 679 ms. Result :sat
Minimization took 593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 1082 transition count 3695
Applied a total of 22 rules in 164 ms. Remains 1082 /1090 variables (removed 8) and now considering 3695/3703 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1082/1090 places, 3695/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10765850862503846316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18008563232711272371.kers'
[2026-05-25 02:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10765850862503846316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18008563232711272371.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3695 rows 1082 cols 7658 entries
Finished phase 1 with 1020 SingleSign rule and 30 generalized
[2026-05-25 02:00:01] [INFO ] Computed 32 invariants in 33 ms
Computed 32 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-18008563232711272371.kers
Total runtime 38 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7149 resets) in 6825 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 953 ms. (1048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 02:00:08] [INFO ] Invariant cache hit.
[2026-05-25 02:00:09] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 02:00:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:00:09] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-25 02:00:09] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 02:00:09] [INFO ] [Real]Added 3605 Read/Feed constraints in 284 ms returned sat
[2026-05-25 02:00:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:00:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 02:00:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:00:10] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-25 02:00:11] [INFO ] [Nat]Added 3605 Read/Feed constraints in 391 ms returned sat
[2026-05-25 02:00:11] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 02:00:11] [INFO ] Added : 6 causal constraints over 2 iterations in 668 ms. Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 62 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 02:00:16] [INFO ] Invariant cache hit.
[2026-05-25 02:00:17] [INFO ] Implicit Places using invariants in 845 ms returned []
[2026-05-25 02:00:17] [INFO ] Invariant cache hit.
[2026-05-25 02:00:18] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2026-05-25 02:00:48] [INFO ] Performed 308/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 02:01:18] [INFO ] Performed 576/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 02:01:48] [INFO ] Performed 847/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 02:02:12] [INFO ] Implicit Places using invariants and state equation in 115341 ms returned []
Implicit Place search using SMT with State Equation took 116186 ms to find 0 implicit places.
[2026-05-25 02:02:12] [INFO ] Redundant transitions in 127 ms returned []
Running 3665 sub problems to find dead transitions.
[2026-05-25 02:02:12] [INFO ] Invariant cache hit.
[2026-05-25 02:02:12] [INFO ] State equation strengthened by 3605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 31443ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 31449ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147839 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2026-05-25 02:02:44] [INFO ] Flatten gal took : 88 ms
[2026-05-25 02:02:44] [INFO ] Flatten gal took : 43 ms
[2026-05-25 02:02:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17962700197615683783.gal : 12 ms
[2026-05-25 02:02:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11356914326712888284.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/ReachabilityCardinality17962700197615683783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11356914326712888284.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
RANDOM walk for 40000 steps (284 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11356914326712888284.prop.
Interrupted probabilistic random walk after 185210 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185210 steps, saw 34057 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 02:02:47] [INFO ] Invariant cache hit.
[2026-05-25 02:02:47] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1354
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1354 after 1559
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1559 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1873
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2123
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2505
SMT process timed out in 8745ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (287 resets) in 499 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 183320 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 183320 steps, saw 33795 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 02:02:59] [INFO ] Invariant cache hit.
[2026-05-25 02:02:59] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 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/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2505 after 3061
At refinement iteration 9 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4775 variables, 1080/1146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 3605/4751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4775 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4777 variables, 2/4755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4777 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4777 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4777/4777 variables, and 4755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27845 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31473ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2026-05-25 02:03:31] [INFO ] Invariant cache hit.
[2026-05-25 02:03:32] [INFO ] Implicit Places using invariants in 834 ms returned []
[2026-05-25 02:03:32] [INFO ] Invariant cache hit.
[2026-05-25 02:03:32] [INFO ] State equation strengthened by 3605 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 02:03:34] [INFO ] Flatten gal took : 39 ms
[2026-05-25 02:03:34] [INFO ] Applying decomposition
[2026-05-25 02:03:34] [INFO ] Flatten gal took : 40 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/graph2317656405381634860.txt' '-o' '/tmp/graph2317656405381634860.bin' '-w' '/tmp/graph2317656405381634860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2317656405381634860.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317656405381634860.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:03:34] [INFO ] Decomposing Gal with order
[2026-05-25 02:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:03:34] [INFO ] Removed a total of 2828 redundant transitions.
[2026-05-25 02:03:34] [INFO ] Flatten gal took : 132 ms
[2026-05-25 02:03:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 3396 labels/synchronizations in 82 ms.
[2026-05-25 02:03:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3080340734274605991.gal : 20 ms
[2026-05-25 02:03:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11893228910244450641.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/ReachabilityCardinality3080340734274605991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11893228910244450641.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/ReachabilityCardinality11893228910244450641.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 126
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :126 after 126
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :126 after 6888
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6888 after 619585
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :619585 after 5.68193e+07
[2026-05-25 02:04:03] [INFO ] Performed 309/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.68193e+07 after 6.13983e+07
Detected timeout of ITS tools.
[2026-05-25 02:04:33] [INFO ] Performed 581/1082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 02:05:03] [INFO ] Performed 867/1082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 02:05:24] [INFO ] Implicit Places using invariants and state equation in 112159 ms returned []
Implicit Place search using SMT with State Equation took 112994 ms to find 0 implicit places.
[2026-05-25 02:05:24] [INFO ] Redundant transitions in 122 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113189 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-07 in 327154 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08
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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1869028812165317920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5193120631849355521.kers'
[2026-05-25 02:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1869028812165317920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5193120631849355521.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 02:05:24] [INFO ] Computed 32 invariants in 30 ms
Computed 32 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-5193120631849355521.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (71 resets) in 72 ms. (136 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 02:05:24] [INFO ] Invariant cache hit.
[2026-05-25 02:05:24] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 02:05:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:05:25] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2026-05-25 02:05:25] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 02:05:25] [INFO ] [Real]Added 3583 Read/Feed constraints in 327 ms returned sat
[2026-05-25 02:05:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:05:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-25 02:05:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:05:26] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2026-05-25 02:05:26] [INFO ] [Nat]Added 3583 Read/Feed constraints in 556 ms returned sat
[2026-05-25 02:05:27] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 148 ms.
[2026-05-25 02:05:27] [INFO ] Added : 5 causal constraints over 1 iterations in 573 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3696
Applied a total of 21 rules in 162 ms. Remains 1083 /1090 variables (removed 7) and now considering 3696/3703 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1083/1090 places, 3696/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6717777142959952322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11953905247668091003.kers'
[2026-05-25 02:05:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6717777142959952322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11953905247668091003.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3696 rows 1083 cols 7660 entries
Finished phase 1 with 1021 SingleSign rule and 30 generalized
[2026-05-25 02:05:28] [INFO ] Computed 32 invariants in 31 ms
Computed 32 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-11953905247668091003.kers
Total runtime 37 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7134 resets) in 6838 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 956 ms. (1044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 02:05:36] [INFO ] Invariant cache hit.
[2026-05-25 02:05:36] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 02:05:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:05:36] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2026-05-25 02:05:36] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 02:05:37] [INFO ] [Real]Added 3604 Read/Feed constraints in 320 ms returned sat
[2026-05-25 02:05:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:05:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 02:05:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:05:38] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2026-05-25 02:05:38] [INFO ] [Nat]Added 3604 Read/Feed constraints in 460 ms returned sat
[2026-05-25 02:05:38] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 142 ms.
[2026-05-25 02:05:39] [INFO ] Added : 9 causal constraints over 2 iterations in 682 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 69 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 61 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 02:05:43] [INFO ] Invariant cache hit.
[2026-05-25 02:05:44] [INFO ] Implicit Places using invariants in 838 ms returned []
[2026-05-25 02:05:44] [INFO ] Invariant cache hit.
[2026-05-25 02:05:45] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 02:06:15] [INFO ] Performed 415/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 02:06:45] [INFO ] Performed 902/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 02:06:54] [INFO ] Implicit Places using invariants and state equation in 69769 ms returned []
Implicit Place search using SMT with State Equation took 70608 ms to find 0 implicit places.
[2026-05-25 02:06:54] [INFO ] Redundant transitions in 129 ms returned []
Running 3666 sub problems to find dead transitions.
[2026-05-25 02:06:54] [INFO ] Invariant cache hit.
[2026-05-25 02:06:54] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 31433ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 31438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102255 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2026-05-25 02:07:26] [INFO ] Flatten gal took : 44 ms
[2026-05-25 02:07:26] [INFO ] Flatten gal took : 43 ms
[2026-05-25 02:07:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18344951477183481634.gal : 26 ms
[2026-05-25 02:07:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6567116817479858485.prop : 6 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/ReachabilityCardinality18344951477183481634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6567116817479858485.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 (283 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6567116817479858485.prop.
Interrupted probabilistic random walk after 183688 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 183688 steps, saw 33836 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 02:07:29] [INFO ] Invariant cache hit.
[2026-05-25 02:07:29] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1366
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1366 after 1562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1562 after 1717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1717 after 1730
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1730 after 1770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1770 after 1872
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2122
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2122 after 2504
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4335 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9186ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (283 resets) in 546 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186188 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186188 steps, saw 34185 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-25 02:07:41] [INFO ] Invariant cache hit.
[2026-05-25 02:07:41] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5518 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 2/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4779 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4779 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4726 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9462 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14991ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 75 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 02:07:56] [INFO ] Invariant cache hit.
[2026-05-25 02:07:57] [INFO ] Implicit Places using invariants in 840 ms returned []
[2026-05-25 02:07:57] [INFO ] Invariant cache hit.
[2026-05-25 02:07:58] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 02:08:16] [INFO ] Flatten gal took : 44 ms
[2026-05-25 02:08:16] [INFO ] Applying decomposition
[2026-05-25 02:08:16] [INFO ] Flatten gal took : 41 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/graph11531481665915943730.txt' '-o' '/tmp/graph11531481665915943730.bin' '-w' '/tmp/graph11531481665915943730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11531481665915943730.bin' '-l' '-1' '-v' '-w' '/tmp/graph11531481665915943730.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:08:16] [INFO ] Decomposing Gal with order
[2026-05-25 02:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:08:16] [INFO ] Removed a total of 2823 redundant transitions.
[2026-05-25 02:08:16] [INFO ] Flatten gal took : 133 ms
[2026-05-25 02:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 3336 labels/synchronizations in 83 ms.
[2026-05-25 02:08:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2486292321168374488.gal : 20 ms
[2026-05-25 02:08:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13369527068937894834.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/ReachabilityCardinality2486292321168374488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13369527068937894834.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/ReachabilityCardinality13369527068937894834.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 91
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :91 after 91
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91 after 111
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :111 after 9234
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9234 after 458617
[2026-05-25 02:08:28] [INFO ] Performed 388/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :458617 after 2.08931e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.08931e+07 after 2.59509e+07
[2026-05-25 02:08:58] [INFO ] Performed 867/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
Detected timeout of ITS tools.
[2026-05-25 02:09:09] [INFO ] Implicit Places using invariants and state equation in 72206 ms returned []
Implicit Place search using SMT with State Equation took 73051 ms to find 0 implicit places.
[2026-05-25 02:09:10] [INFO ] Redundant transitions in 125 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73245 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08 in 225729 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4884515458236937640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3707099146740637830.kers'
[2026-05-25 02:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4884515458236937640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3707099146740637830.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3703 rows 1090 cols 7674 entries
Finished phase 1 with 1028 SingleSign rule and 30 generalized
[2026-05-25 02:09:10] [INFO ] Computed 32 invariants in 30 ms
Computed 32 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-3707099146740637830.kers
Total runtime 34 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (72 resets) in 72 ms. (136 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 02:09:10] [INFO ] Invariant cache hit.
[2026-05-25 02:09:10] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 02:09:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:09:10] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2026-05-25 02:09:10] [INFO ] State equation strengthened by 3583 read => feed constraints.
[2026-05-25 02:09:11] [INFO ] [Real]Added 3583 Read/Feed constraints in 324 ms returned sat
[2026-05-25 02:09:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:09:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 02:09:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 02:09:12] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2026-05-25 02:09:12] [INFO ] [Nat]Added 3583 Read/Feed constraints in 438 ms returned sat
[2026-05-25 02:09:12] [INFO ] Computed and/alt/rep : 2629/6929/2629 causal constraints (skipped 1044 transitions) in 146 ms.
[2026-05-25 02:09:13] [INFO ] Added : 9 causal constraints over 2 iterations in 672 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3703/3703 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3696
Applied a total of 21 rules in 175 ms. Remains 1083 /1090 variables (removed 7) and now considering 3696/3703 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 1083/1090 places, 3696/3703 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1610054164355162917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8883467478510046300.kers'
[2026-05-25 02:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1610054164355162917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8883467478510046300.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3696 rows 1083 cols 7660 entries
Finished phase 1 with 1021 SingleSign rule and 30 generalized
[2026-05-25 02:09:14] [INFO ] Computed 32 invariants in 29 ms
Computed 32 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-8883467478510046300.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[28]
RANDOM walk for 1000000 steps (7157 resets) in 6844 ms. (146 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 944 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[28]
[2026-05-25 02:09:21] [INFO ] Invariant cache hit.
[2026-05-25 02:09:21] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2026-05-25 02:09:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:09:22] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2026-05-25 02:09:22] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 02:09:22] [INFO ] [Real]Added 3604 Read/Feed constraints in 329 ms returned sat
[2026-05-25 02:09:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:09:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-25 02:09:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:09:23] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2026-05-25 02:09:24] [INFO ] [Nat]Added 3604 Read/Feed constraints in 375 ms returned sat
[2026-05-25 02:09:24] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 150 ms.
[2026-05-25 02:09:24] [INFO ] Added : 7 causal constraints over 2 iterations in 675 ms. Result :sat
Minimization took 4561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[28]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 61 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2026-05-25 02:09:29] [INFO ] Invariant cache hit.
[2026-05-25 02:09:30] [INFO ] Implicit Places using invariants in 869 ms returned []
[2026-05-25 02:09:30] [INFO ] Invariant cache hit.
[2026-05-25 02:09:31] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2026-05-25 02:10:01] [INFO ] Performed 337/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 02:10:31] [INFO ] Performed 707/1083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
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-030, 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-177946842100725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;