About the Execution of ITS-Tools for ASLink-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16188.972 | 3600000.00 | 6532865.00 | 14470.60 | FFFTFFFF?FTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200347.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 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 516K 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 booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-05a-LTLCardinality-00
FORMULA_NAME ASLink-PT-05a-LTLCardinality-01
FORMULA_NAME ASLink-PT-05a-LTLCardinality-02
FORMULA_NAME ASLink-PT-05a-LTLCardinality-03
FORMULA_NAME ASLink-PT-05a-LTLCardinality-04
FORMULA_NAME ASLink-PT-05a-LTLCardinality-05
FORMULA_NAME ASLink-PT-05a-LTLCardinality-06
FORMULA_NAME ASLink-PT-05a-LTLCardinality-07
FORMULA_NAME ASLink-PT-05a-LTLCardinality-08
FORMULA_NAME ASLink-PT-05a-LTLCardinality-09
FORMULA_NAME ASLink-PT-05a-LTLCardinality-10
FORMULA_NAME ASLink-PT-05a-LTLCardinality-11
FORMULA_NAME ASLink-PT-05a-LTLCardinality-12
FORMULA_NAME ASLink-PT-05a-LTLCardinality-13
FORMULA_NAME ASLink-PT-05a-LTLCardinality-14
FORMULA_NAME ASLink-PT-05a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779475935628
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 18:52:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:52:17] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2026-05-22 18:52:17] [INFO ] Transformed 1211 places.
[2026-05-22 18:52:17] [INFO ] Transformed 1827 transitions.
[2026-05-22 18:52:17] [INFO ] Found NUPN structural information;
[2026-05-22 18:52:17] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-05a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1171 transition count 1765
Ensure Unique test removed 1 places
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 1170 transition count 1765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 1170 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1755
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1747
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1739
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1731
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1165 transition count 1723
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1165 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1164 transition count 1715
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1164 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1163 transition count 1707
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1163 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1162 transition count 1699
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1162 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1161 transition count 1691
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1161 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1160 transition count 1683
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1160 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1159 transition count 1675
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1159 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1158 transition count 1667
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1158 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1157 transition count 1659
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1157 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1156 transition count 1651
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1156 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1155 transition count 1643
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1155 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1154 transition count 1635
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1154 transition count 1635
Applied a total of 85 rules in 927 ms. Remains 1154 /1211 variables (removed 57) and now considering 1635/1808 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17887026588315670826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11246788375829559017.kers'
[2026-05-22 18:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17887026588315670826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11246788375829559017.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1635 rows 1154 cols 6091 entries
Finished phase 1 with 458 SingleSign rule and 495 generalized
[2026-05-22 18:52:18] [INFO ] Computed 201 invariants in 36 ms
Computed 201 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-11246788375829559017.kers
Total runtime 38 ms.
[2026-05-22 18:52:19] [INFO ] Implicit Places using invariants in 1436 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 956, 968, 972, 973, 974, 992, 994, 997, 1015, 1016, 1017, 1018, 1035, 1043, 1051, 1057, 1063, 1069, 1075, 1083, 1089, 1095, 1103]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1473 ms to find 59 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1095/1211 places, 1635/1808 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1083 transition count 1623
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1083 transition count 1623
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1074 transition count 1614
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1074 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1070 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1070 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1068 transition count 1608
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1068 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1067 transition count 1607
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1067 transition count 1607
Applied a total of 56 rules in 226 ms. Remains 1067 /1095 variables (removed 28) and now considering 1607/1635 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15190274849039521342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15857621525963538415.kers'
[2026-05-22 18:52:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15190274849039521342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15857621525963538415.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1607 rows 1067 cols 5580 entries
Finished phase 1 with 705 SingleSign rule and 220 generalized
[2026-05-22 18:52:20] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15857621525963538415.kers
Total runtime 11 ms.
[2026-05-22 18:52:20] [INFO ] Implicit Places using invariants in 912 ms returned []
[2026-05-22 18:52:20] [INFO ] Invariant cache hit.
[2026-05-22 18:52:23] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3794 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1067/1211 places, 1607/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6434 ms. Remains : 1067/1211 places, 1607/1808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Applied a total of 0 rules in 67 ms. Remains 1067 /1067 variables (removed 0) and now considering 1607/1607 (removed 0) transitions.
[2026-05-22 18:52:23] [INFO ] Invariant cache hit.
[2026-05-22 18:52:24] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2026-05-22 18:52:24] [INFO ] Invariant cache hit.
[2026-05-22 18:52:27] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2026-05-22 18:52:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1066 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1066/2674 variables, and 110 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1067 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1066 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1066/2674 variables, and 110 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1067 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60778ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Finished structural reductions in LTL mode , in 1 iterations and 64617 ms. Remains : 1067/1067 places, 1607/1607 transitions.
Support contains 25 out of 1067 places after structural reductions.
[2026-05-22 18:53:28] [INFO ] Flatten gal took : 121 ms
[2026-05-22 18:53:28] [INFO ] Flatten gal took : 75 ms
[2026-05-22 18:53:29] [INFO ] Input system was already deterministic with 1607 transitions.
RANDOM walk for 40000 steps (237 resets) in 1717 ms. (23 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40003 steps (34 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (37 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
[2026-05-22 18:53:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 304/318 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 151/469 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 598/1067 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1607/2674 variables, 1067/1209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2674 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/2674 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2674/2674 variables, and 1209 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1067/1067 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 304/318 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 151/469 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 598/1067 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1607/2674 variables, 1067/1209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2674 variables, 9/1218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2674/2674 variables, and 1218 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1067/1067 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7076ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1067 transition count 1406
Reduce places removed 201 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 203 rules applied. Total rules applied 404 place count 866 transition count 1404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 864 transition count 1404
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 406 place count 864 transition count 1264
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 325 rules applied. Total rules applied 731 place count 679 transition count 1264
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 749 place count 670 transition count 1255
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 758 place count 661 transition count 1255
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 758 place count 661 transition count 1235
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 798 place count 641 transition count 1235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 803 place count 636 transition count 1230
Iterating global reduction 5 with 5 rules applied. Total rules applied 808 place count 636 transition count 1230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 812 place count 636 transition count 1226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 813 place count 635 transition count 1226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 813 place count 635 transition count 1225
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 815 place count 634 transition count 1225
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 931 place count 576 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 932 place count 575 transition count 1166
Iterating global reduction 7 with 1 rules applied. Total rules applied 933 place count 575 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 934 place count 574 transition count 1165
Iterating global reduction 7 with 1 rules applied. Total rules applied 935 place count 574 transition count 1165
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 940 place count 574 transition count 1160
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 945 place count 569 transition count 1160
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 966 place count 569 transition count 1139
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 988 place count 547 transition count 1139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 990 place count 547 transition count 1137
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 1004 place count 547 transition count 1137
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1008 place count 547 transition count 1137
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1009 place count 547 transition count 1136
Applied a total of 1009 rules in 376 ms. Remains 547 /1067 variables (removed 520) and now considering 1136/1607 (removed 471) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 547/1067 places, 1136/1607 transitions.
RANDOM walk for 40000 steps (528 resets) in 321 ms. (124 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (116 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (110 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (115 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (106 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (116 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (120 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6779264515414770284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17856213164923581912.kers'
[2026-05-22 18:53:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6779264515414770284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17856213164923581912.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 1136 rows 543 cols 4714 entries
Finished phase 1 with 212 SingleSign rule and 248 generalized
[2026-05-22 18:53:37] [INFO ] Computed 87 invariants in 7 ms
Computed 87 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17856213164923581912.kers
Total runtime 8 ms.
[2026-05-22 18:53:37] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 133/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 192/338 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 209/547 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1136/1683 variables, 547/634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 22/656 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1683 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1683 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 656 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 547/547 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 133/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 192/338 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 209/547 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1136/1683 variables, 547/634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 22/656 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1683 variables, 8/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1683 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1683 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 664 constraints, problems are : Problem set: 0 solved, 8 unsolved in 35472 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 547/547 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36867ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 35154 ms.
Support contains 7 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1136/1136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 547 transition count 1133
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 544 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 542 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 542 transition count 1130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 542 transition count 1129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 541 transition count 1129
Applied a total of 13 rules in 81 ms. Remains 541 /547 variables (removed 6) and now considering 1129/1136 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 541/547 places, 1129/1136 transitions.
RANDOM walk for 40000 steps (568 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (114 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (119 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (126 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 423192 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :2 out of 4
Probabilistic random walk after 423192 steps, saw 95454 distinct states, run finished after 3009 ms. (steps per millisecond=140 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7129932047329476431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-977585860264943726.kers'
[2026-05-22 18:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7129932047329476431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-977585860264943726.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 2 ms.
// Phase 1: matrix 1129 rows 537 cols 4726 entries
Finished phase 1 with 206 SingleSign rule and 248 generalized
[2026-05-22 18:54:53] [INFO ] Computed 87 invariants in 21 ms
Computed 87 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-977585860264943726.kers
Total runtime 23 ms.
[2026-05-22 18:54:53] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/328 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 213/541 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1129/1670 variables, 541/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1670 variables, 21/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1670 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1670 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1670/1670 variables, and 649 constraints, problems are : Problem set: 0 solved, 2 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 541/541 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/328 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 213/541 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1129/1670 variables, 541/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1670 variables, 21/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1670 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1670 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1670 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 652 constraints, problems are : Problem set: 0 solved, 2 unsolved in 65522 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 541/541 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66267ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 1129/1129 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 541 transition count 1129
Applied a total of 2 rules in 48 ms. Remains 541 /541 variables (removed 0) and now considering 1129/1129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 541/541 places, 1129/1129 transitions.
FORMULA ASLink-PT-05a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1066 transition count 1395
Reduce places removed 216 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 221 rules applied. Total rules applied 432 place count 850 transition count 1390
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 437 place count 845 transition count 1390
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 437 place count 845 transition count 1240
Deduced a syphon composed of 150 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 345 rules applied. Total rules applied 782 place count 650 transition count 1240
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 34 rules applied. Total rules applied 816 place count 635 transition count 1221
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 835 place count 616 transition count 1221
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 835 place count 616 transition count 1201
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 875 place count 596 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 885 place count 586 transition count 1191
Iterating global reduction 5 with 10 rules applied. Total rules applied 895 place count 586 transition count 1191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 9 rules applied. Total rules applied 904 place count 586 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 905 place count 585 transition count 1182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 905 place count 585 transition count 1181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 907 place count 584 transition count 1181
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 1019 place count 528 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1020 place count 527 transition count 1124
Iterating global reduction 7 with 1 rules applied. Total rules applied 1021 place count 527 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1022 place count 526 transition count 1123
Iterating global reduction 7 with 1 rules applied. Total rules applied 1023 place count 526 transition count 1123
Applied a total of 1023 rules in 138 ms. Remains 526 /1067 variables (removed 541) and now considering 1123/1607 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1863149240384655690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3096410308061953814.kers'
[2026-05-22 18:55:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1863149240384655690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3096410308061953814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1123 rows 526 cols 4542 entries
Finished phase 1 with 215 SingleSign rule and 234 generalized
[2026-05-22 18:55:59] [INFO ] Computed 77 invariants in 9 ms
Computed 77 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3096410308061953814.kers
Total runtime 11 ms.
[2026-05-22 18:56:00] [INFO ] Implicit Places using invariants in 452 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 370, 430, 447, 453, 458, 460, 523]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 455 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1067 places, 1123/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 1122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 1122
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 492 transition count 1113
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 492 transition count 1113
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 483 transition count 1104
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 483 transition count 1104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 478 transition count 1099
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 478 transition count 1099
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 468 transition count 1089
Applied a total of 68 rules in 101 ms. Remains 468 /502 variables (removed 34) and now considering 1089/1123 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1092196516864535858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10761807500475988402.kers'
[2026-05-22 18:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1092196516864535858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10761807500475988402.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1089 rows 468 cols 4385 entries
Finished phase 1 with 215 SingleSign rule and 200 generalized
[2026-05-22 18:56:00] [INFO ] Computed 53 invariants in 22 ms
Computed 53 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-10761807500475988402.kers
Total runtime 24 ms.
[2026-05-22 18:56:01] [INFO ] Implicit Places using invariants in 496 ms returned []
[2026-05-22 18:56:01] [INFO ] Invariant cache hit.
[2026-05-22 18:56:01] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 468/1067 places, 1089/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2082 ms. Remains : 468/1067 places, 1089/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 186 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-01
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-01 finished in 2337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0))) U p0)))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1066 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1066 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1065 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1065 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1064 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1064 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1063 transition count 1603
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1063 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1060 transition count 1600
Applied a total of 14 rules in 236 ms. Remains 1060 /1067 variables (removed 7) and now considering 1600/1607 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8664802570903372815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3025110251322718689.kers'
[2026-05-22 18:56:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8664802570903372815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3025110251322718689.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 18:56:02] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-3025110251322718689.kers
Total runtime 23 ms.
[2026-05-22 18:56:03] [INFO ] Implicit Places using invariants in 791 ms returned []
[2026-05-22 18:56:03] [INFO ] Invariant cache hit.
[2026-05-22 18:56:05] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2939 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2026-05-22 18:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60574ms
Starting structural reductions in LTL mode, iteration 1 : 1060/1067 places, 1600/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63755 ms. Remains : 1060/1067 places, 1600/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0))) U p0)))'
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-04
Product exploration explored 100000 steps with 637 reset in 304 ms.
Product exploration explored 100000 steps with 611 reset in 304 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (260 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (35 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 317332 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317332 steps, saw 119625 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2026-05-22 18:57:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/459 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 601/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/459 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 601/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 1060 transition count 1396
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 856 transition count 1396
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 140 Pre rules applied. Total rules applied 408 place count 856 transition count 1256
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 733 place count 671 transition count 1256
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 18 rules applied. Total rules applied 751 place count 662 transition count 1247
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 760 place count 653 transition count 1247
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 760 place count 653 transition count 1227
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 800 place count 633 transition count 1227
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 805 place count 628 transition count 1222
Iterating global reduction 4 with 5 rules applied. Total rules applied 810 place count 628 transition count 1222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 814 place count 628 transition count 1218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 815 place count 627 transition count 1218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 815 place count 627 transition count 1217
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 817 place count 626 transition count 1217
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 937 place count 566 transition count 1157
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 942 place count 566 transition count 1152
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 947 place count 561 transition count 1152
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 967 place count 561 transition count 1132
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 988 place count 540 transition count 1132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 992 place count 540 transition count 1128
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1008 place count 540 transition count 1128
Applied a total of 1008 rules in 188 ms. Remains 540 /1060 variables (removed 520) and now considering 1128/1600 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 540/1060 places, 1128/1600 transitions.
RANDOM walk for 40000 steps (529 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (111 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 566511 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 566511 steps, saw 123104 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15275543108942361164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13476574099921737918.kers'
[2026-05-22 18:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15275543108942361164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13476574099921737918.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 1128 rows 536 cols 4727 entries
Finished phase 1 with 204 SingleSign rule and 249 generalized
[2026-05-22 18:57:15] [INFO ] Computed 87 invariants in 6 ms
Computed 87 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13476574099921737918.kers
Total runtime 9 ms.
[2026-05-22 18:57:15] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/331 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/540 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1128/1668 variables, 540/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1668 variables, 21/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1668 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1668 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1668/1668 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 540/540 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/331 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/540 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1128/1668 variables, 540/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1668 variables, 21/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1668 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1668/1668 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8831 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 540/540 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9297ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 680 ms.
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1128/1128 transitions.
Applied a total of 0 rules in 21 ms. Remains 540 /540 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 540/540 places, 1128/1128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1128/1128 transitions.
Applied a total of 0 rules in 16 ms. Remains 540 /540 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
[2026-05-22 18:57:25] [INFO ] Invariant cache hit.
[2026-05-22 18:57:26] [INFO ] Implicit Places using invariants in 622 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 273, 279, 282, 284, 287, 294, 295, 368, 374, 377, 379, 382, 389, 390, 391, 460, 466, 469, 471, 474, 487]
[2026-05-22 18:57:26] [INFO ] Actually due to overlaps returned [110, 202, 294, 389, 111, 203, 295, 390, 112, 204, 391, 487, 89, 95, 100, 181, 187, 192, 273, 279, 284, 368, 374, 379, 460, 466, 471, 103, 195, 287, 382, 474]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 634 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/540 places, 1128/1128 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 508 transition count 1120
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 500 transition count 1120
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 41 place count 475 transition count 1095
Iterating global reduction 0 with 25 rules applied. Total rules applied 66 place count 475 transition count 1095
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 475 transition count 1091
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 470 transition count 1086
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 470 transition count 1086
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 465 transition count 1081
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 105 place count 465 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 120 place count 450 transition count 1066
Applied a total of 120 rules in 69 ms. Remains 450 /508 variables (removed 58) and now considering 1066/1128 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16093394207650894020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18008273335888645722.kers'
[2026-05-22 18:57:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16093394207650894020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18008273335888645722.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1066 rows 450 cols 4402 entries
Finished phase 1 with 162 SingleSign rule and 233 generalized
[2026-05-22 18:57:26] [INFO ] Computed 55 invariants in 6 ms
Computed 55 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18008273335888645722.kers
Total runtime 7 ms.
[2026-05-22 18:57:27] [INFO ] Implicit Places using invariants in 381 ms returned [72, 89, 145, 162, 297, 314, 370, 387]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 383 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/540 places, 1066/1128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 441 transition count 1065
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 1065
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 437 transition count 1061
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 437 transition count 1057
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 433 transition count 1057
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 433 transition count 1057
Applied a total of 19 rules in 55 ms. Remains 433 /442 variables (removed 9) and now considering 1057/1066 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9772609469447329337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-645297551064608490.kers'
[2026-05-22 18:57:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9772609469447329337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-645297551064608490.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1057 rows 433 cols 4342 entries
Finished phase 1 with 154 SingleSign rule and 232 generalized
[2026-05-22 18:57:27] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-645297551064608490.kers
Total runtime 7 ms.
[2026-05-22 18:57:27] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-22 18:57:27] [INFO ] Invariant cache hit.
[2026-05-22 18:57:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 18:57:28] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/540 places, 1057/1128 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2666 ms. Remains : 433/540 places, 1057/1128 transitions.
RANDOM walk for 40000 steps (654 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (134 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 490717 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 490717 steps, saw 342401 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2026-05-22 18:57:31] [INFO ] Invariant cache hit.
[2026-05-22 18:57:31] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/293 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/433 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1057/1490 variables, 433/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1490 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1490 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1490 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/293 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/433 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1057/1490 variables, 433/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1490 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1490 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 487 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16319 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16811ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 582 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1057/1057 transitions.
Applied a total of 0 rules in 25 ms. Remains 433 /433 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 433/433 places, 1057/1057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1057/1057 transitions.
Applied a total of 0 rules in 17 ms. Remains 433 /433 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2026-05-22 18:57:49] [INFO ] Invariant cache hit.
[2026-05-22 18:57:49] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-05-22 18:57:49] [INFO ] Invariant cache hit.
[2026-05-22 18:57:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 18:57:50] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2026-05-22 18:57:50] [INFO ] Redundant transitions in 82 ms returned []
Running 1056 sub problems to find dead transitions.
[2026-05-22 18:57:50] [INFO ] Invariant cache hit.
[2026-05-22 18:57:50] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/1490 variables, and 47 constraints, problems are : Problem set: 0 solved, 1056 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/433 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1056/1056 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1056 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/1490 variables, and 49 constraints, problems are : Problem set: 0 solved, 1056 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/433 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1056 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61900 ms. Remains : 433/433 places, 1057/1057 transitions.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 104453 ms.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Applied a total of 0 rules in 28 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4196760045298130780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7201068355842935346.kers'
[2026-05-22 18:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4196760045298130780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7201068355842935346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 18:58:51] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7201068355842935346.kers
Total runtime 10 ms.
[2026-05-22 18:58:52] [INFO ] Implicit Places using invariants in 674 ms returned []
[2026-05-22 18:58:52] [INFO ] Invariant cache hit.
[2026-05-22 18:58:54] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2829 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2026-05-22 18:58:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60525ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Finished structural reductions in LTL mode , in 1 iterations and 63407 ms. Remains : 1060/1060 places, 1600/1600 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (245 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (38 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321231 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 321231 steps, saw 120855 distinct states, run finished after 3013 ms. (steps per millisecond=106 ) properties seen :0
[2026-05-22 18:59:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/459 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 601/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/459 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 601/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2468ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 1060 transition count 1396
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 856 transition count 1396
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 140 Pre rules applied. Total rules applied 408 place count 856 transition count 1256
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 733 place count 671 transition count 1256
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 18 rules applied. Total rules applied 751 place count 662 transition count 1247
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 760 place count 653 transition count 1247
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 760 place count 653 transition count 1227
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 800 place count 633 transition count 1227
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 805 place count 628 transition count 1222
Iterating global reduction 4 with 5 rules applied. Total rules applied 810 place count 628 transition count 1222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 814 place count 628 transition count 1218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 815 place count 627 transition count 1218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 815 place count 627 transition count 1217
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 817 place count 626 transition count 1217
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 937 place count 566 transition count 1157
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 942 place count 566 transition count 1152
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 947 place count 561 transition count 1152
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 967 place count 561 transition count 1132
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 988 place count 540 transition count 1132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 992 place count 540 transition count 1128
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1008 place count 540 transition count 1128
Applied a total of 1008 rules in 151 ms. Remains 540 /1060 variables (removed 520) and now considering 1128/1600 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 540/1060 places, 1128/1600 transitions.
RANDOM walk for 40000 steps (506 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (108 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 566870 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 566870 steps, saw 123185 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1202012507599014194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4558724665895681297.kers'
[2026-05-22 19:00:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1202012507599014194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4558724665895681297.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 14 ms.
// Phase 1: matrix 1128 rows 536 cols 4727 entries
Finished phase 1 with 204 SingleSign rule and 249 generalized
[2026-05-22 19:00:03] [INFO ] Computed 87 invariants in 24 ms
Computed 87 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-4558724665895681297.kers
Total runtime 27 ms.
[2026-05-22 19:00:03] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/331 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/540 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1128/1668 variables, 540/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1668 variables, 21/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1668 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1668 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1668/1668 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 540/540 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/331 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/540 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1128/1668 variables, 540/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1668 variables, 21/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1668 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1668/1668 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9820 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 540/540 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10325ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1128/1128 transitions.
Applied a total of 0 rules in 41 ms. Remains 540 /540 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 540/540 places, 1128/1128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1128/1128 transitions.
Applied a total of 0 rules in 25 ms. Remains 540 /540 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
[2026-05-22 19:00:14] [INFO ] Invariant cache hit.
[2026-05-22 19:00:14] [INFO ] Implicit Places using invariants in 523 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 273, 279, 282, 284, 287, 294, 295, 368, 374, 377, 379, 382, 389, 390, 391, 460, 466, 469, 471, 474, 487]
[2026-05-22 19:00:14] [INFO ] Actually due to overlaps returned [110, 202, 294, 389, 111, 203, 295, 390, 112, 204, 391, 487, 89, 95, 100, 181, 187, 192, 273, 279, 284, 368, 374, 379, 460, 466, 471, 103, 195, 287, 382, 474]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 538 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/540 places, 1128/1128 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 508 transition count 1120
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 500 transition count 1120
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 41 place count 475 transition count 1095
Iterating global reduction 0 with 25 rules applied. Total rules applied 66 place count 475 transition count 1095
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 475 transition count 1091
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 470 transition count 1086
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 470 transition count 1086
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 465 transition count 1081
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 105 place count 465 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 120 place count 450 transition count 1066
Applied a total of 120 rules in 71 ms. Remains 450 /508 variables (removed 58) and now considering 1066/1128 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15535804546668556987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6342813623150064314.kers'
[2026-05-22 19:00:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15535804546668556987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6342813623150064314.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1066 rows 450 cols 4402 entries
Finished phase 1 with 162 SingleSign rule and 233 generalized
[2026-05-22 19:00:14] [INFO ] Computed 55 invariants in 16 ms
Computed 55 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6342813623150064314.kers
Total runtime 17 ms.
[2026-05-22 19:00:15] [INFO ] Implicit Places using invariants in 438 ms returned [72, 89, 145, 162, 297, 314, 370, 387]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 440 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/540 places, 1066/1128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 441 transition count 1065
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 1065
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 437 transition count 1061
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 437 transition count 1057
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 433 transition count 1057
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 433 transition count 1057
Applied a total of 19 rules in 67 ms. Remains 433 /442 variables (removed 9) and now considering 1057/1066 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9436025428622291720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10492325073751414969.kers'
[2026-05-22 19:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9436025428622291720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10492325073751414969.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1057 rows 433 cols 4342 entries
Finished phase 1 with 154 SingleSign rule and 232 generalized
[2026-05-22 19:00:15] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10492325073751414969.kers
Total runtime 7 ms.
[2026-05-22 19:00:15] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-22 19:00:15] [INFO ] Invariant cache hit.
[2026-05-22 19:00:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:00:16] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/540 places, 1057/1128 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2571 ms. Remains : 433/540 places, 1057/1128 transitions.
RANDOM walk for 40000 steps (731 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (139 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 491860 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 491860 steps, saw 343212 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2026-05-22 19:00:19] [INFO ] Invariant cache hit.
[2026-05-22 19:00:19] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/293 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/433 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1057/1490 variables, 433/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1490 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1490 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1490 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/293 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/433 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1057/1490 variables, 433/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1490 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1490 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 487 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18582 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19077ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1057/1057 transitions.
Applied a total of 0 rules in 30 ms. Remains 433 /433 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 433/433 places, 1057/1057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1057/1057 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2026-05-22 19:00:38] [INFO ] Invariant cache hit.
[2026-05-22 19:00:39] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-22 19:00:39] [INFO ] Invariant cache hit.
[2026-05-22 19:00:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:00:40] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2026-05-22 19:00:40] [INFO ] Redundant transitions in 26 ms returned []
Running 1056 sub problems to find dead transitions.
[2026-05-22 19:00:40] [INFO ] Invariant cache hit.
[2026-05-22 19:00:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/1490 variables, and 47 constraints, problems are : Problem set: 0 solved, 1056 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/433 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1056/1056 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1056 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/1490 variables, and 49 constraints, problems are : Problem set: 0 solved, 1056 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/433 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1056 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61896 ms. Remains : 433/433 places, 1057/1057 transitions.
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 106151 ms.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 627 reset in 221 ms.
Product exploration explored 100000 steps with 620 reset in 229 ms.
Spot run failed in 114 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin5929568380386997568
[2026-05-22 19:01:41] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5929568380386997568
Running compilation step : cd /tmp/ltsmin5929568380386997568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5929568380386997568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5929568380386997568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Applied a total of 0 rules in 34 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8377197384196949999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11171449400836743633.kers'
[2026-05-22 19:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8377197384196949999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11171449400836743633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:01:44] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-11171449400836743633.kers
Total runtime 12 ms.
[2026-05-22 19:01:45] [INFO ] Implicit Places using invariants in 958 ms returned []
[2026-05-22 19:01:45] [INFO ] Invariant cache hit.
[2026-05-22 19:01:47] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2026-05-22 19:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2660 variables, and 110 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 110/117 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60540ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Finished structural reductions in LTL mode , in 1 iterations and 63447 ms. Remains : 1060/1060 places, 1600/1600 transitions.
Built C files in :
/tmp/ltsmin10994573079016406184
[2026-05-22 19:02:48] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10994573079016406184
Running compilation step : cd /tmp/ltsmin10994573079016406184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2887 ms.
Running link step : cd /tmp/ltsmin10994573079016406184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10994573079016406184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12701888523483755664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 19:03:03] [INFO ] Flatten gal took : 51 ms
[2026-05-22 19:03:03] [INFO ] Flatten gal took : 62 ms
[2026-05-22 19:03:03] [INFO ] Time to serialize gal into /tmp/LTL8700841660508962367.gal : 44 ms
[2026-05-22 19:03:03] [INFO ] Time to serialize properties into /tmp/LTL5738483049046841556.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8700841660508962367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12656562162137690890.hoa' '-atoms' '/tmp/LTL5738483049046841556.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5738483049046841556.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12656562162137690890.hoa
Detected timeout of ITS tools.
[2026-05-22 19:03:18] [INFO ] Flatten gal took : 47 ms
[2026-05-22 19:03:18] [INFO ] Flatten gal took : 41 ms
[2026-05-22 19:03:18] [INFO ] Time to serialize gal into /tmp/LTL10921097935831804234.gal : 10 ms
[2026-05-22 19:03:18] [INFO ] Time to serialize properties into /tmp/LTL1134155292392321787.ltl : 5 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10921097935831804234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1134155292392321787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("((p10==0)||(p616==1))"))))U("((p10==0)||(p616==1))"))))
Formula 0 simplified : F(!"((p10==0)||(p616==1))" & X(!"((p10==0)||(p616==1))" W XX!"((p10==0)||(p616==1))"))
Detected timeout of ITS tools.
[2026-05-22 19:03:34] [INFO ] Flatten gal took : 61 ms
[2026-05-22 19:03:34] [INFO ] Applying decomposition
[2026-05-22 19:03:34] [INFO ] Flatten gal took : 52 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/graph5009570996717299242.txt' '-o' '/tmp/graph5009570996717299242.bin' '-w' '/tmp/graph5009570996717299242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5009570996717299242.bin' '-l' '-1' '-v' '-w' '/tmp/graph5009570996717299242.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:03:34] [INFO ] Decomposing Gal with order
[2026-05-22 19:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:03:34] [INFO ] Removed a total of 2194 redundant transitions.
[2026-05-22 19:03:34] [INFO ] Flatten gal took : 187 ms
[2026-05-22 19:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 26 ms.
[2026-05-22 19:03:34] [INFO ] Time to serialize gal into /tmp/LTL3558429677265258789.gal : 14 ms
[2026-05-22 19:03:34] [INFO ] Time to serialize properties into /tmp/LTL12929737761600994958.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3558429677265258789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12929737761600994958.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("((i0.u3.p10==0)||(i7.u174.p616==1))"))))U("((i0.u3.p10==0)||(i7.u174.p616==1))"))))
Formula 0 simplified : F(!"((i0.u3.p10==0)||(i7.u174.p616==1))" & X(!"((i0.u3.p10==0)||(i7.u174.p616==1))" W XX!"((i0.u3.p10==0)||(i7.u174.p616==1))"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05a-LTLCardinality-04 finished in 467698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1066 transition count 1395
Reduce places removed 216 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 221 rules applied. Total rules applied 432 place count 850 transition count 1390
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 437 place count 845 transition count 1390
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 437 place count 845 transition count 1240
Deduced a syphon composed of 150 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 345 rules applied. Total rules applied 782 place count 650 transition count 1240
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 34 rules applied. Total rules applied 816 place count 635 transition count 1221
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 835 place count 616 transition count 1221
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 835 place count 616 transition count 1200
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 877 place count 595 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 887 place count 585 transition count 1190
Iterating global reduction 5 with 10 rules applied. Total rules applied 897 place count 585 transition count 1190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 9 rules applied. Total rules applied 906 place count 585 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 907 place count 584 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 907 place count 584 transition count 1180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 909 place count 583 transition count 1180
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 1021 place count 527 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1022 place count 526 transition count 1123
Iterating global reduction 7 with 1 rules applied. Total rules applied 1023 place count 526 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1024 place count 525 transition count 1122
Iterating global reduction 7 with 1 rules applied. Total rules applied 1025 place count 525 transition count 1122
Applied a total of 1025 rules in 105 ms. Remains 525 /1067 variables (removed 542) and now considering 1122/1607 (removed 485) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7962932143392222761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2225767123814885003.kers'
[2026-05-22 19:03:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7962932143392222761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2225767123814885003.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1122 rows 525 cols 4540 entries
Finished phase 1 with 214 SingleSign rule and 234 generalized
[2026-05-22 19:03:49] [INFO ] Computed 77 invariants in 19 ms
Computed 77 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-2225767123814885003.kers
Total runtime 21 ms.
[2026-05-22 19:03:50] [INFO ] Implicit Places using invariants in 495 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 522]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 509 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1067 places, 1122/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 1121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 499 transition count 1121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 489 transition count 1111
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 489 transition count 1111
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 479 transition count 1101
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 479 transition count 1101
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 474 transition count 1096
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 474 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 72 place count 464 transition count 1086
Applied a total of 72 rules in 54 ms. Remains 464 /500 variables (removed 36) and now considering 1086/1122 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3970754251839424608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4730853562966555634.kers'
[2026-05-22 19:03:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3970754251839424608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4730853562966555634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1086 rows 464 cols 4376 entries
Finished phase 1 with 212 SingleSign rule and 200 generalized
[2026-05-22 19:03:50] [INFO ] Computed 52 invariants in 6 ms
Computed 52 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4730853562966555634.kers
Total runtime 8 ms.
[2026-05-22 19:03:50] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-22 19:03:50] [INFO ] Invariant cache hit.
[2026-05-22 19:03:51] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/1067 places, 1086/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1966 ms. Remains : 464/1067 places, 1086/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-05
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-05 finished in 2028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(X((F(p0)&&p1)))||(p1 U p2))) U G(p2)))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1066 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1066 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1065 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1065 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1064 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1064 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1063 transition count 1603
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1063 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1060 transition count 1600
Applied a total of 14 rules in 307 ms. Remains 1060 /1067 variables (removed 7) and now considering 1600/1607 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6163685829267634957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-454463337778341482.kers'
[2026-05-22 19:03:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6163685829267634957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-454463337778341482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:03:52] [INFO ] Computed 142 invariants in 18 ms
Computed 142 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-454463337778341482.kers
Total runtime 33 ms.
[2026-05-22 19:03:52] [INFO ] Implicit Places using invariants in 738 ms returned []
[2026-05-22 19:03:52] [INFO ] Invariant cache hit.
[2026-05-22 19:03:55] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1060/1067 places, 1600/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3213 ms. Remains : 1060/1067 places, 1600/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(X((F(p0)&&p1)))||(p1 U p2))) U G(p2)))'
Stuttering acceptance computed with spot in 439 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-08
Product exploration explored 100000 steps with 622 reset in 262 ms.
Product exploration explored 100000 steps with 599 reset in 336 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 12 factoid took 174 ms. Reduced automaton from 10 states, 44 edges and 3 AP (stutter sensitive) to 10 states, 44 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (250 resets) in 330 ms. (120 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40002 steps (37 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (40 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (33 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (34 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (39 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
[2026-05-22 19:03:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 245/460 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 600/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2660 variables, 1060/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2660 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/2660 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 245/460 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 600/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2660 variables, 1060/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2660 variables, 10/1212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 1212 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7065ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1060 transition count 1395
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 855 transition count 1395
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 140 Pre rules applied. Total rules applied 410 place count 855 transition count 1255
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 735 place count 670 transition count 1255
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 18 rules applied. Total rules applied 753 place count 661 transition count 1246
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 762 place count 652 transition count 1246
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 762 place count 652 transition count 1226
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 802 place count 632 transition count 1226
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 807 place count 627 transition count 1221
Iterating global reduction 4 with 5 rules applied. Total rules applied 812 place count 627 transition count 1221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 816 place count 627 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 817 place count 626 transition count 1217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 817 place count 626 transition count 1216
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 819 place count 625 transition count 1216
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 935 place count 567 transition count 1158
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 940 place count 567 transition count 1153
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 945 place count 562 transition count 1153
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 964 place count 562 transition count 1134
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 984 place count 542 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 988 place count 542 transition count 1130
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1004 place count 542 transition count 1130
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1006 place count 542 transition count 1130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1007 place count 541 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1012 place count 536 transition count 1129
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 1012 place count 536 transition count 1119
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1037 place count 521 transition count 1119
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1042 place count 516 transition count 1114
Iterating global reduction 9 with 5 rules applied. Total rules applied 1047 place count 516 transition count 1114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1052 place count 516 transition count 1109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1053 place count 516 transition count 1108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1054 place count 515 transition count 1108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1055 place count 515 transition count 1107
Applied a total of 1055 rules in 216 ms. Remains 515 /1060 variables (removed 545) and now considering 1107/1600 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 515/1060 places, 1107/1600 transitions.
RANDOM walk for 40000 steps (700 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (145 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (157 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (151 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (154 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (155 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (147 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (159 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (146 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 281809 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :3 out of 10
Probabilistic random walk after 281809 steps, saw 127849 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10758920355853891948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9591156660475283529.kers'
[2026-05-22 19:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10758920355853891948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9591156660475283529.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 1107 rows 512 cols 4516 entries
Finished phase 1 with 193 SingleSign rule and 245 generalized
[2026-05-22 19:04:07] [INFO ] Computed 77 invariants in 7 ms
Computed 77 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9591156660475283529.kers
Total runtime 8 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 146/255 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 124/379 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 33/412 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 101/513 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/515 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1107/1622 variables, 515/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1622/1622 variables, and 592 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/109 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 146/255 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 124/379 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 33/412 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 101/513 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/515 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1107/1622 variables, 515/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1622/1622 variables, and 601 constraints, problems are : Problem set: 0 solved, 7 unsolved in 21169 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22231ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16391 ms.
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 16 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 515/515 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (654 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (160 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (151 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (150 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (144 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (147 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (160 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (155 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 263811 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 7
Probabilistic random walk after 263811 steps, saw 119822 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2026-05-22 19:04:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 146/255 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 124/379 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 33/412 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 101/513 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/515 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1107/1622 variables, 515/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1622/1622 variables, and 592 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/109 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 146/255 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 124/379 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 33/412 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 101/513 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/515 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1107/1622 variables, 515/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1622/1622 variables, and 601 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75017 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76116ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 40 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 515/515 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 27 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2026-05-22 19:06:05] [INFO ] Invariant cache hit.
[2026-05-22 19:06:05] [INFO ] Implicit Places using invariants in 457 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 263, 269, 272, 274, 275, 283, 335, 352, 358, 361, 363, 364, 369, 370, 423, 440, 446, 449, 451, 452]
[2026-05-22 19:06:05] [INFO ] Actually due to overlaps returned [187, 275, 452, 364, 88, 94, 99, 175, 181, 186, 263, 269, 274, 352, 358, 363, 440, 446, 451, 71, 100, 158, 245, 335, 423]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 460 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 490/515 places, 1107/1107 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 469 transition count 1086
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 469 transition count 1086
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 464 transition count 1081
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 464 transition count 1081
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 72 place count 454 transition count 1071
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 87 place count 454 transition count 1056
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 102 place count 439 transition count 1056
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 439 transition count 1051
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 434 transition count 1051
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 434 transition count 1051
Applied a total of 113 rules in 102 ms. Remains 434 /490 variables (removed 56) and now considering 1051/1107 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-859292494541297000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11055691814265817612.kers'
[2026-05-22 19:06:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-859292494541297000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11055691814265817612.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1051 rows 434 cols 4381 entries
Finished phase 1 with 152 SingleSign rule and 230 generalized
[2026-05-22 19:06:06] [INFO ] Computed 52 invariants in 15 ms
Computed 52 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11055691814265817612.kers
Total runtime 17 ms.
[2026-05-22 19:06:06] [INFO ] Implicit Places using invariants in 339 ms returned [88, 89, 159, 160, 234, 304, 305]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 353 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/515 places, 1051/1107 transitions.
Applied a total of 0 rules in 15 ms. Remains 427 /427 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 957 ms. Remains : 427/515 places, 1051/1107 transitions.
Knowledge based reduction with 12 factoid took 248 ms. Reduced automaton from 10 states, 44 edges and 3 AP (stutter sensitive) to 10 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 523 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Knowledge-based reduction took 131087 ms.
Stuttering acceptance computed with spot in 593 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Applied a total of 0 rules in 67 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14614117782483006845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7265623886745263311.kers'
[2026-05-22 19:06:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14614117782483006845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7265623886745263311.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:06:07] [INFO ] Computed 142 invariants in 28 ms
Computed 142 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-7265623886745263311.kers
Total runtime 31 ms.
[2026-05-22 19:06:08] [INFO ] Implicit Places using invariants in 893 ms returned []
[2026-05-22 19:06:08] [INFO ] Invariant cache hit.
[2026-05-22 19:06:11] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 3105 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3174 ms. Remains : 1060/1060 places, 1600/1600 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 12 factoid took 243 ms. Reduced automaton from 10 states, 44 edges and 3 AP (stutter sensitive) to 10 states, 44 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (244 resets) in 443 ms. (90 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (41 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (40 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (39 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (39 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
[2026-05-22 19:06:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 245/460 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 600/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2660 variables, 1060/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2660 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/2660 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 1202 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 245/460 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 600/1060 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2660 variables, 1060/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2660 variables, 10/1212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 1212 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1060/1060 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7006ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1060 transition count 1395
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 855 transition count 1395
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 140 Pre rules applied. Total rules applied 410 place count 855 transition count 1255
Deduced a syphon composed of 140 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 735 place count 670 transition count 1255
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 18 rules applied. Total rules applied 753 place count 661 transition count 1246
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 762 place count 652 transition count 1246
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 762 place count 652 transition count 1226
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 802 place count 632 transition count 1226
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 807 place count 627 transition count 1221
Iterating global reduction 4 with 5 rules applied. Total rules applied 812 place count 627 transition count 1221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 816 place count 627 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 817 place count 626 transition count 1217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 817 place count 626 transition count 1216
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 819 place count 625 transition count 1216
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 935 place count 567 transition count 1158
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 940 place count 567 transition count 1153
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 945 place count 562 transition count 1153
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 964 place count 562 transition count 1134
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 984 place count 542 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 988 place count 542 transition count 1130
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1004 place count 542 transition count 1130
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1006 place count 542 transition count 1130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1007 place count 541 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1012 place count 536 transition count 1129
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 1012 place count 536 transition count 1119
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1037 place count 521 transition count 1119
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1042 place count 516 transition count 1114
Iterating global reduction 9 with 5 rules applied. Total rules applied 1047 place count 516 transition count 1114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1052 place count 516 transition count 1109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1053 place count 516 transition count 1108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1054 place count 515 transition count 1108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1055 place count 515 transition count 1107
Applied a total of 1055 rules in 269 ms. Remains 515 /1060 variables (removed 545) and now considering 1107/1600 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 515/1060 places, 1107/1600 transitions.
RANDOM walk for 40000 steps (644 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (153 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (154 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (147 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (160 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (151 resets) in 68 ms. (579 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (157 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (147 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (155 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1151036616342752699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2100600441443946749.kers'
[2026-05-22 19:06:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1151036616342752699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2100600441443946749.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 1107 rows 512 cols 4516 entries
Finished phase 1 with 193 SingleSign rule and 245 generalized
[2026-05-22 19:06:19] [INFO ] Computed 77 invariants in 6 ms
Computed 77 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2100600441443946749.kers
Total runtime 8 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 146/255 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 124/379 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 33/412 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 101/513 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/515 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1107/1622 variables, 515/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1622/1622 variables, and 592 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/109 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 146/255 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 124/379 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 33/412 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 101/513 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/515 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1107/1622 variables, 515/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1622/1622 variables, and 601 constraints, problems are : Problem set: 0 solved, 7 unsolved in 22089 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23552ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 29598 ms.
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 17 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 515/515 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (665 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (158 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (149 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (150 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (156 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (146 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (152 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (156 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 246672 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 7
Probabilistic random walk after 246672 steps, saw 109768 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2026-05-22 19:07:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 146/255 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 124/379 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 33/412 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 101/513 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/515 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1107/1622 variables, 515/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1622 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1622/1622 variables, and 592 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/109 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 146/255 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 124/379 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 33/412 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 101/513 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/515 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1107/1622 variables, 515/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1622 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1622/1622 variables, and 601 constraints, problems are : Problem set: 0 solved, 7 unsolved in 31193 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32245ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 35484 ms.
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 19 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 515/515 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1107/1107 transitions.
Applied a total of 0 rules in 17 ms. Remains 515 /515 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2026-05-22 19:08:23] [INFO ] Invariant cache hit.
[2026-05-22 19:08:23] [INFO ] Implicit Places using invariants in 558 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 263, 269, 272, 274, 275, 283, 335, 352, 358, 361, 363, 364, 369, 370, 423, 440, 446, 449, 451, 452]
[2026-05-22 19:08:23] [INFO ] Actually due to overlaps returned [187, 275, 452, 364, 88, 94, 99, 175, 181, 186, 263, 269, 274, 352, 358, 363, 440, 446, 451, 71, 100, 158, 245, 335, 423]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 561 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 490/515 places, 1107/1107 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 469 transition count 1086
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 469 transition count 1086
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 464 transition count 1081
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 464 transition count 1081
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 72 place count 454 transition count 1071
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 87 place count 454 transition count 1056
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 102 place count 439 transition count 1056
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 439 transition count 1051
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 434 transition count 1051
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 434 transition count 1051
Applied a total of 113 rules in 94 ms. Remains 434 /490 variables (removed 56) and now considering 1051/1107 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17314606255042422840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5301692710516800960.kers'
[2026-05-22 19:08:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17314606255042422840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5301692710516800960.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1051 rows 434 cols 4381 entries
Finished phase 1 with 152 SingleSign rule and 230 generalized
[2026-05-22 19:08:23] [INFO ] Computed 52 invariants in 20 ms
Computed 52 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-5301692710516800960.kers
Total runtime 21 ms.
[2026-05-22 19:08:24] [INFO ] Implicit Places using invariants in 441 ms returned [88, 89, 159, 160, 234, 304, 305]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 455 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/515 places, 1051/1107 transitions.
Applied a total of 0 rules in 17 ms. Remains 427 /427 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1144 ms. Remains : 427/515 places, 1051/1107 transitions.
Knowledge based reduction with 12 factoid took 222 ms. Reduced automaton from 10 states, 44 edges and 3 AP (stutter sensitive) to 10 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Knowledge-based reduction took 133981 ms.
Stuttering acceptance computed with spot in 442 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Stuttering acceptance computed with spot in 420 ms :[(NOT p2), (AND p0 p1), p2, (AND p0 p1), (AND p2 p1 p0), (AND p0 p1), (OR p2 (AND p0 p1)), (AND p0 p2), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1)]
Product exploration explored 100000 steps with 618 reset in 281 ms.
Product exploration explored 100000 steps with 597 reset in 294 ms.
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin3949686491190355776
[2026-05-22 19:08:26] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3949686491190355776
Running compilation step : cd /tmp/ltsmin3949686491190355776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2959 ms.
Running link step : cd /tmp/ltsmin3949686491190355776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3949686491190355776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17026094211966699304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Applied a total of 0 rules in 29 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10040509332534943240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16873203863978593976.kers'
[2026-05-22 19:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10040509332534943240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16873203863978593976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:08:41] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-16873203863978593976.kers
Total runtime 23 ms.
[2026-05-22 19:08:42] [INFO ] Implicit Places using invariants in 725 ms returned []
[2026-05-22 19:08:42] [INFO ] Invariant cache hit.
[2026-05-22 19:08:44] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2598 ms. Remains : 1060/1060 places, 1600/1600 transitions.
Built C files in :
/tmp/ltsmin10076614201445589906
[2026-05-22 19:08:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10076614201445589906
Running compilation step : cd /tmp/ltsmin10076614201445589906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2901 ms.
Running link step : cd /tmp/ltsmin10076614201445589906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10076614201445589906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14084544104604874935.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 19:08:59] [INFO ] Flatten gal took : 33 ms
[2026-05-22 19:08:59] [INFO ] Flatten gal took : 30 ms
[2026-05-22 19:08:59] [INFO ] Time to serialize gal into /tmp/LTL10666216355905107691.gal : 7 ms
[2026-05-22 19:08:59] [INFO ] Time to serialize properties into /tmp/LTL15036417193588376709.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10666216355905107691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4258458103167897059.hoa' '-atoms' '/tmp/LTL15036417193588376709.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15036417193588376709.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4258458103167897059.hoa
Detected timeout of ITS tools.
[2026-05-22 19:09:14] [INFO ] Flatten gal took : 49 ms
[2026-05-22 19:09:14] [INFO ] Flatten gal took : 31 ms
[2026-05-22 19:09:14] [INFO ] Time to serialize gal into /tmp/LTL17467821719633119019.gal : 7 ms
[2026-05-22 19:09:14] [INFO ] Time to serialize properties into /tmp/LTL7030242705609442436.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17467821719633119019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7030242705609442436.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(!((X(X((F("(p805==1)"))&&("(p519==1)"))))||(("(p519==1)")U("((p75==0)||(p605==1))")))))U(G("((p75==0)||(p605==1))"))))
Formula 0 simplified : G(XX("(p519==1)" & F"(p805==1)") | ("(p519==1)" U "((p75==0)||(p605==1))")) R F!"((p75==0)||(p605==1))"
Detected timeout of ITS tools.
[2026-05-22 19:09:29] [INFO ] Flatten gal took : 46 ms
[2026-05-22 19:09:29] [INFO ] Applying decomposition
[2026-05-22 19:09:29] [INFO ] Flatten gal took : 32 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/graph3075985236313830132.txt' '-o' '/tmp/graph3075985236313830132.bin' '-w' '/tmp/graph3075985236313830132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3075985236313830132.bin' '-l' '-1' '-v' '-w' '/tmp/graph3075985236313830132.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:09:29] [INFO ] Decomposing Gal with order
[2026-05-22 19:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:09:29] [INFO ] Removed a total of 2187 redundant transitions.
[2026-05-22 19:09:29] [INFO ] Flatten gal took : 62 ms
[2026-05-22 19:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 20 ms.
[2026-05-22 19:09:29] [INFO ] Time to serialize gal into /tmp/LTL8626875658663301819.gal : 12 ms
[2026-05-22 19:09:29] [INFO ] Time to serialize properties into /tmp/LTL12939323507460494161.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8626875658663301819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12939323507460494161.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(!((X(X((F("(i10.u192.p805==1)"))&&("(i7.u152.p519==1)"))))||(("(i7.u152.p519==1)")U("((i0.u19.p75==0)||(i7.u175.p605==1))")))))U...200
Formula 0 simplified : G(XX("(i7.u152.p519==1)" & F"(i10.u192.p805==1)") | ("(i7.u152.p519==1)" U "((i0.u19.p75==0)||(i7.u175.p605==1))")) R F!"((i0.u19.p7...181
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05a-LTLCardinality-08 finished in 353157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 1066 transition count 1400
Reduce places removed 210 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 214 rules applied. Total rules applied 420 place count 856 transition count 1396
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 426 place count 852 transition count 1394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 428 place count 850 transition count 1394
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 147 Pre rules applied. Total rules applied 428 place count 850 transition count 1247
Deduced a syphon composed of 147 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 766 place count 659 transition count 1247
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 796 place count 646 transition count 1230
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 813 place count 629 transition count 1230
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 813 place count 629 transition count 1211
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 851 place count 610 transition count 1211
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 860 place count 601 transition count 1202
Iterating global reduction 6 with 9 rules applied. Total rules applied 869 place count 601 transition count 1202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 877 place count 601 transition count 1194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 878 place count 600 transition count 1194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 878 place count 600 transition count 1193
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 880 place count 599 transition count 1193
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 996 place count 541 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 997 place count 540 transition count 1134
Iterating global reduction 8 with 1 rules applied. Total rules applied 998 place count 540 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 999 place count 539 transition count 1133
Iterating global reduction 8 with 1 rules applied. Total rules applied 1000 place count 539 transition count 1133
Applied a total of 1000 rules in 137 ms. Remains 539 /1067 variables (removed 528) and now considering 1133/1607 (removed 474) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4171353644194368111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1218850744728981963.kers'
[2026-05-22 19:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4171353644194368111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1218850744728981963.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1133 rows 538 cols 4573 entries
Finished phase 1 with 228 SingleSign rule and 230 generalized
[2026-05-22 19:09:45] [INFO ] Computed 81 invariants in 20 ms
Computed 81 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-1218850744728981963.kers
Total runtime 24 ms.
[2026-05-22 19:09:45] [INFO ] Implicit Places using invariants in 577 ms returned [89, 95, 100, 169, 189, 195, 200, 202, 262, 279, 285, 290, 292, 352, 369, 375, 380, 382, 442, 460, 466, 471, 473, 536]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 581 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/1067 places, 1133/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 1132
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 505 transition count 1123
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 505 transition count 1123
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 28 place count 497 transition count 1115
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 497 transition count 1115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 494 transition count 1112
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 494 transition count 1112
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 60 place count 485 transition count 1103
Applied a total of 60 rules in 79 ms. Remains 485 /515 variables (removed 30) and now considering 1103/1133 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2660821484130009814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2554716828572076751.kers'
[2026-05-22 19:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2660821484130009814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2554716828572076751.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1103 rows 484 cols 4422 entries
Finished phase 1 with 224 SingleSign rule and 204 generalized
[2026-05-22 19:09:45] [INFO ] Computed 57 invariants in 20 ms
Computed 57 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-2554716828572076751.kers
Total runtime 22 ms.
[2026-05-22 19:09:46] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-05-22 19:09:46] [INFO ] Invariant cache hit.
[2026-05-22 19:09:47] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 485/1067 places, 1103/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2349 ms. Remains : 485/1067 places, 1103/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-12
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-12 finished in 2570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1066 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1066 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1065 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1065 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1064 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1064 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1063 transition count 1603
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1063 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1060 transition count 1600
Applied a total of 14 rules in 320 ms. Remains 1060 /1067 variables (removed 7) and now considering 1600/1607 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1854183273855090705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11565039150789835435.kers'
[2026-05-22 19:09:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1854183273855090705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11565039150789835435.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:09:47] [INFO ] Computed 142 invariants in 27 ms
Computed 142 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-11565039150789835435.kers
Total runtime 31 ms.
[2026-05-22 19:09:48] [INFO ] Implicit Places using invariants in 878 ms returned []
[2026-05-22 19:09:48] [INFO ] Invariant cache hit.
[2026-05-22 19:09:50] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1060/1067 places, 1600/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3197 ms. Remains : 1060/1067 places, 1600/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-13 finished in 3463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 1066 transition count 1397
Reduce places removed 214 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 219 rules applied. Total rules applied 428 place count 852 transition count 1392
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 434 place count 847 transition count 1391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 846 transition count 1391
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 435 place count 846 transition count 1243
Deduced a syphon composed of 148 places in 1 ms
Ensure Unique test removed 43 places
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 339 rules applied. Total rules applied 774 place count 655 transition count 1243
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 34 rules applied. Total rules applied 808 place count 640 transition count 1224
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 827 place count 621 transition count 1224
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 827 place count 621 transition count 1204
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 867 place count 601 transition count 1204
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 877 place count 591 transition count 1194
Iterating global reduction 6 with 10 rules applied. Total rules applied 887 place count 591 transition count 1194
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 9 rules applied. Total rules applied 896 place count 591 transition count 1185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 897 place count 590 transition count 1185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 897 place count 590 transition count 1184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 589 transition count 1184
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 8 with 112 rules applied. Total rules applied 1011 place count 533 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1012 place count 532 transition count 1127
Iterating global reduction 8 with 1 rules applied. Total rules applied 1013 place count 532 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1014 place count 531 transition count 1126
Iterating global reduction 8 with 1 rules applied. Total rules applied 1015 place count 531 transition count 1126
Applied a total of 1015 rules in 113 ms. Remains 531 /1067 variables (removed 536) and now considering 1126/1607 (removed 481) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11955431389161338968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12867078433393142506.kers'
[2026-05-22 19:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11955431389161338968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12867078433393142506.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1126 rows 531 cols 4552 entries
Finished phase 1 with 219 SingleSign rule and 233 generalized
[2026-05-22 19:09:51] [INFO ] Computed 79 invariants in 20 ms
Computed 79 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-12867078433393142506.kers
Total runtime 23 ms.
[2026-05-22 19:09:51] [INFO ] Implicit Places using invariants in 533 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 528]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 534 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 506/1067 places, 1126/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 1125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 505 transition count 1125
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 496 transition count 1116
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 496 transition count 1116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 487 transition count 1107
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 487 transition count 1107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 483 transition count 1103
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 483 transition count 1103
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 473 transition count 1093
Applied a total of 66 rules in 55 ms. Remains 473 /506 variables (removed 33) and now considering 1093/1126 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-797978188124309138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15329413218570338885.kers'
[2026-05-22 19:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-797978188124309138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15329413218570338885.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1093 rows 473 cols 4397 entries
Finished phase 1 with 218 SingleSign rule and 201 generalized
[2026-05-22 19:09:51] [INFO ] Computed 54 invariants in 15 ms
Computed 54 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15329413218570338885.kers
Total runtime 16 ms.
[2026-05-22 19:09:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-05-22 19:09:52] [INFO ] Invariant cache hit.
[2026-05-22 19:09:53] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 473/1067 places, 1093/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2090 ms. Remains : 473/1067 places, 1093/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-14
Stuttering criterion allowed to conclude after 64 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-14 finished in 2172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(F(!p0))))))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1607/1607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1066 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1066 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1065 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1065 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1064 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1064 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1063 transition count 1603
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1063 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1060 transition count 1600
Applied a total of 14 rules in 299 ms. Remains 1060 /1067 variables (removed 7) and now considering 1600/1607 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8200225597026538205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13369384667216838728.kers'
[2026-05-22 19:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8200225597026538205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13369384667216838728.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1600 rows 1060 cols 5560 entries
Finished phase 1 with 698 SingleSign rule and 220 generalized
[2026-05-22 19:09:53] [INFO ] Computed 142 invariants in 27 ms
Computed 142 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-13369384667216838728.kers
Total runtime 30 ms.
[2026-05-22 19:09:54] [INFO ] Implicit Places using invariants in 802 ms returned []
[2026-05-22 19:09:54] [INFO ] Invariant cache hit.
[2026-05-22 19:09:56] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1060/1067 places, 1600/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3045 ms. Remains : 1060/1067 places, 1600/1607 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(F(!p0))))))'
Stuttering acceptance computed with spot in 151 ms :[true, true, true, (NOT p0), p0]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-15
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-15 finished in 3249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0))) U p0)))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(X((F(p0)&&p1)))||(p1 U p2))) U G(p2)))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 19:09:56] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin564766276891181021
[2026-05-22 19:09:56] [INFO ] Too many transitions (1607) to apply POR reductions. Disabling POR matrices.
[2026-05-22 19:09:56] [INFO ] Applying decomposition
[2026-05-22 19:09:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin564766276891181021
Running compilation step : cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 19:09:56] [INFO ] Flatten gal took : 27 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/graph17106612485020399986.txt' '-o' '/tmp/graph17106612485020399986.bin' '-w' '/tmp/graph17106612485020399986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17106612485020399986.bin' '-l' '-1' '-v' '-w' '/tmp/graph17106612485020399986.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:09:56] [INFO ] Decomposing Gal with order
[2026-05-22 19:09:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:09:56] [INFO ] Removed a total of 2200 redundant transitions.
[2026-05-22 19:09:56] [INFO ] Flatten gal took : 77 ms
[2026-05-22 19:09:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 13 ms.
[2026-05-22 19:09:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality13898867110202090098.gal : 10 ms
[2026-05-22 19:09:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality4335021393562923745.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13898867110202090098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4335021393562923745.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G((X(X(X("((i2.u3.p10==0)||(i7.u173.p616==1))"))))U("((i2.u3.p10==0)||(i7.u173.p616==1))"))))
Formula 0 simplified : F(!"((i2.u3.p10==0)||(i7.u173.p616==1))" & X(!"((i2.u3.p10==0)||(i7.u173.p616==1))" W XX!"((i2.u3.p10==0)||(i7.u173.p616==1))"))
Compilation finished in 3116 ms.
Running link step : cd /tmp/ltsmin564766276891181021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(X(X((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(X(X((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>(!(X(X((<>((LTLAPp1==true))&&(LTLAPp2==true))))||((LTLAPp2==true) U (LTLAPp3==true)))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 19:35:50] [INFO ] Applying decomposition
[2026-05-22 19:35:50] [INFO ] Flatten gal took : 27 ms
[2026-05-22 19:35:50] [INFO ] Decomposing Gal with order
[2026-05-22 19:35:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:35:50] [INFO ] Removed a total of 1812 redundant transitions.
[2026-05-22 19:35:50] [INFO ] Flatten gal took : 98 ms
[2026-05-22 19:35:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 682 labels/synchronizations in 27 ms.
[2026-05-22 19:35:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality17201342643800501726.gal : 7 ms
[2026-05-22 19:35:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality12435012856112988305.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17201342643800501726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12435012856112988305.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((X(X(X("((u1.p10==0)||(u107.p616==1))"))))U("((u1.p10==0)||(u107.p616==1))"))))
Formula 0 simplified : F(!"((u1.p10==0)||(u107.p616==1))" & X(!"((u1.p10==0)||(u107.p616==1))" W XX!"((u1.p10==0)||(u107.p616==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1008, t1193, t1194, t1197, t1202, t1214, t1223, t1276, t1299, t1352, t1375, t1428, t1451, t1...840
Computing Next relation with stutter on 4.08317e+13 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>(!(X(X((<>((LTLAPp1==true))&&(LTLAPp2==true))))||((LTLAPp2==true) U (LTLAPp3==true)))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin564766276891181021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(X(X((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
153 unique states visited
153 strongly connected components in search stack
154 transitions explored
153 items max in DFS search stack
44172 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,441.813,5285728,1,0,1.11015e+07,13477,2886,1.75483e+07,505,55907,15575067
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ASLink-PT-05a-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(!((X(X((F("(u141.p805==1)"))&&("(i21.u83.p519==1)"))))||(("(i21.u83.p519==1)")U("((u6.p75==0)||(u105.p605==1))")))))U(G("((u6.p7...182
Formula 1 simplified : G(XX("(i21.u83.p519==1)" & F"(u141.p805==1)") | ("(i21.u83.p519==1)" U "((u6.p75==0)||(u105.p605==1))")) R F!"((u6.p75==0)||(u105.p6...163
Computing Next relation with stutter on 4.08317e+13 deadlock states
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ASLink-PT-05a"
export BK_EXAMINATION="LTLCardinality"
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 ASLink-PT-05a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;