About the Execution of ITS-Tools for Champagne-PT-H10T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14771.191 | 3600000.00 | 6306752.00 | 8116.30 | FTFFFFFFFFFFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901100156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Champagne-PT-H10T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 612K 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 Champagne-PT-H10T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779546800201
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 14:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 14:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:33:23] [INFO ] Load time of PNML (sax parser for PT used): 416 ms
[2026-05-23 14:33:23] [INFO ] Transformed 1637 places.
[2026-05-23 14:33:23] [INFO ] Transformed 2633 transitions.
[2026-05-23 14:33:23] [INFO ] Found NUPN structural information;
[2026-05-23 14:33:23] [INFO ] Parsed PT model containing 1637 places and 2633 transitions and 7256 arcs in 702 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Champagne-PT-H10T1U-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H10T1U-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1637/1637 places, 2633/2633 transitions.
Discarding 367 places :
Symmetric choice reduction at 0 with 367 rule applications. Total rules 367 place count 1270 transition count 2266
Iterating global reduction 0 with 367 rules applied. Total rules applied 734 place count 1270 transition count 2266
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 973 place count 1031 transition count 2027
Iterating global reduction 0 with 239 rules applied. Total rules applied 1212 place count 1031 transition count 2027
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 1338 place count 905 transition count 1901
Iterating global reduction 0 with 126 rules applied. Total rules applied 1464 place count 905 transition count 1901
Applied a total of 1464 rules in 443 ms. Remains 905 /1637 variables (removed 732) and now considering 1901/2633 (removed 732) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17144787168667363545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7867782072688037521.kers'
[2026-05-23 14:33:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17144787168667363545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7867782072688037521.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1901 rows 905 cols 5792 entries
Finished phase 1 with 842 SingleSign rule and 0 generalized
[2026-05-23 14:33:24] [INFO ] Computed 63 invariants in 9 ms
Computed 63 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7867782072688037521.kers
Total runtime 13 ms.
[2026-05-23 14:33:25] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2026-05-23 14:33:25] [INFO ] Invariant cache hit.
[2026-05-23 14:33:26] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
Running 1900 sub problems to find dead transitions.
[2026-05-23 14:33:27] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2806 variables, and 0 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1900/1899 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2806 variables, and 0 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1/1899 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61519ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 61585ms
Starting structural reductions in LTL mode, iteration 1 : 905/1637 places, 1901/2633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64862 ms. Remains : 905/1637 places, 1901/2633 transitions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Applied a total of 0 rules in 38 ms. Remains 905 /905 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2026-05-23 14:34:28] [INFO ] Invariant cache hit.
[2026-05-23 14:34:29] [INFO ] Implicit Places using invariants in 592 ms returned []
[2026-05-23 14:34:29] [INFO ] Invariant cache hit.
[2026-05-23 14:34:30] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1993 ms. Remains : 905/905 places, 1901/1901 transitions.
Support contains 44 out of 905 places after structural reductions.
[2026-05-23 14:34:31] [INFO ] Flatten gal took : 290 ms
[2026-05-23 14:34:31] [INFO ] Flatten gal took : 178 ms
[2026-05-23 14:34:31] [INFO ] Input system was already deterministic with 1901 transitions.
RANDOM walk for 40000 steps (30 resets) in 2514 ms. (15 steps per ms) remains 0/36 properties
Computed a total of 76 stabilizing places and 76 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' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 927 edges and 905 vertex of which 463 / 905 are part of one of the 63 SCC in 9 ms
Free SCC test removed 400 places
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 504 transition count 1386
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 1 with 202 rules applied. Total rules applied 287 place count 420 transition count 1268
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 58 rules applied. Total rules applied 345 place count 363 transition count 1267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 362 transition count 1267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 346 place count 362 transition count 1265
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 350 place count 360 transition count 1265
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 404 place count 306 transition count 830
Iterating global reduction 4 with 54 rules applied. Total rules applied 458 place count 306 transition count 830
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 504 place count 306 transition count 784
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 744 place count 186 transition count 664
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 746 place count 184 transition count 654
Iterating global reduction 5 with 2 rules applied. Total rules applied 748 place count 184 transition count 654
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 750 place count 184 transition count 652
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 751 place count 184 transition count 651
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 753 place count 182 transition count 649
Applied a total of 753 rules in 411 ms. Remains 182 /905 variables (removed 723) and now considering 649/1901 (removed 1252) transitions.
[2026-05-23 14:34:33] [INFO ] Flow matrix only has 196 transitions (discarded 453 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3583639907491283511.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11475800602277751360.kers'
[2026-05-23 14:34:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3583639907491283511.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11475800602277751360.kers]
Normalized transition count is 195 out of 196 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 195 rows 169 cols 536 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:34:33] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11475800602277751360.kers
Total runtime 2 ms.
[2026-05-23 14:34:33] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-23 14:34:33] [INFO ] Flow matrix only has 196 transitions (discarded 453 similar events)
[2026-05-23 14:34:33] [INFO ] Invariant cache hit.
[2026-05-23 14:34:34] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2026-05-23 14:34:34] [INFO ] Redundant transitions in 63 ms returned []
Running 474 sub problems to find dead transitions.
[2026-05-23 14:34:34] [INFO ] Flow matrix only has 196 transitions (discarded 453 similar events)
[2026-05-23 14:34:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 3/182 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 195/377 variables, 182/245 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/378 variables, and 245 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 474/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 3/182 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 195/377 variables, 182/245 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 473/718 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/378 variables, and 718 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 474/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 182/905 places, 649/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61444 ms. Remains : 182/905 places, 649/1901 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 350 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 6 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-00 finished in 61927 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((F(p0)&&X(F((G(F(((p1&&X(F(p2)))||G(F(p2)))))||(p3&&F(((p1&&X(F(p2)))||G(F(p2)))))))))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 887 transition count 1883
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 887 transition count 1883
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 877 transition count 1873
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 877 transition count 1873
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 872 transition count 1868
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 872 transition count 1868
Applied a total of 66 rules in 168 ms. Remains 872 /905 variables (removed 33) and now considering 1868/1901 (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-13179626815690780835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5989818163033213617.kers'
[2026-05-23 14:35:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13179626815690780835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5989818163033213617.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1868 rows 872 cols 5726 entries
Finished phase 1 with 809 SingleSign rule and 0 generalized
[2026-05-23 14:35:35] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5989818163033213617.kers
Total runtime 11 ms.
[2026-05-23 14:35:35] [INFO ] Implicit Places using invariants in 528 ms returned []
[2026-05-23 14:35:35] [INFO ] Invariant cache hit.
[2026-05-23 14:35:36] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
Running 1867 sub problems to find dead transitions.
[2026-05-23 14:35:36] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1867/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1867 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 1867 unsolved
Search for dead transitions found 0 dead transitions in 60702ms
Starting structural reductions in LTL mode, iteration 1 : 872/905 places, 1868/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62603 ms. Remains : 872/905 places, 1868/1901 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((F(p0)&&X(F((G(F(((p1&&X(F(p2)))||G(F(p2)))))||(p3&&F(((p1&&X(F(p2)))||G(F(p2)))))))))))'
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 680 ms.
Product exploration explored 100000 steps with 25000 reset in 463 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 8 factoid took 71 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 5940 steps (3 resets) in 76 ms. (77 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 376 ms.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 872 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 1868/1868 transitions.
Applied a total of 0 rules in 25 ms. Remains 872 /872 variables (removed 0) and now considering 1868/1868 (removed 0) transitions.
[2026-05-23 14:36:39] [INFO ] Invariant cache hit.
[2026-05-23 14:36:40] [INFO ] Implicit Places using invariants in 653 ms returned []
[2026-05-23 14:36:40] [INFO ] Invariant cache hit.
[2026-05-23 14:36:41] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2050 ms. Remains : 872/872 places, 1868/1868 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 11426 steps (8 resets) in 125 ms. (90 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 455 ms.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 322 ms.
Product exploration explored 100000 steps with 25000 reset in 384 ms.
Spot run failed in 116 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/ltsmin11849887118880846144
[2026-05-23 14:36:43] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11849887118880846144
Running compilation step : cd /tmp/ltsmin11849887118880846144;'/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/ltsmin11849887118880846144;'/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/ltsmin11849887118880846144;'/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 1 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 1868/1868 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 869 transition count 1865
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 869 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 868 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 868 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 867 transition count 1863
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 867 transition count 1863
Applied a total of 10 rules in 78 ms. Remains 867 /872 variables (removed 5) and now considering 1863/1868 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5459077973386520167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9804958508900056023.kers'
[2026-05-23 14:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5459077973386520167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9804958508900056023.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1863 rows 867 cols 5716 entries
Finished phase 1 with 804 SingleSign rule and 0 generalized
[2026-05-23 14:36:46] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9804958508900056023.kers
Total runtime 11 ms.
[2026-05-23 14:36:47] [INFO ] Implicit Places using invariants in 502 ms returned []
[2026-05-23 14:36:47] [INFO ] Invariant cache hit.
[2026-05-23 14:36:48] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2026-05-23 14:36:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60974ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60983ms
Starting structural reductions in LTL mode, iteration 1 : 867/872 places, 1863/1868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62771 ms. Remains : 867/872 places, 1863/1868 transitions.
Built C files in :
/tmp/ltsmin7364556729777523761
[2026-05-23 14:37:49] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7364556729777523761
Running compilation step : cd /tmp/ltsmin7364556729777523761;'/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/ltsmin7364556729777523761;'/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/ltsmin7364556729777523761;'/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)
[2026-05-23 14:37:52] [INFO ] Flatten gal took : 95 ms
[2026-05-23 14:37:52] [INFO ] Flatten gal took : 57 ms
[2026-05-23 14:37:52] [INFO ] Time to serialize gal into /tmp/LTL18376298252037121869.gal : 31 ms
[2026-05-23 14:37:52] [INFO ] Time to serialize properties into /tmp/LTL11171647884047355407.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18376298252037121869.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4213924935520310355.hoa' '-atoms' '/tmp/LTL11171647884047355407.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/LTL11171647884047355407.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4213924935520310355.hoa
Detected timeout of ITS tools.
[2026-05-23 14:38:07] [INFO ] Flatten gal took : 53 ms
[2026-05-23 14:38:08] [INFO ] Flatten gal took : 53 ms
[2026-05-23 14:38:08] [INFO ] Time to serialize gal into /tmp/LTL3648972829997989109.gal : 16 ms
[2026-05-23 14:38:08] [INFO ] Time to serialize properties into /tmp/LTL17198214494733251740.ltl : 7 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/LTL3648972829997989109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17198214494733251740.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 : !((X((F("(p1163==0)"))&&(X(F((G(F((G(F("(p135!=1)")))||(("(p1293!=1)")&&(X(F("(p135!=1)")))))))||(("(p420!=1)")&&(F((G(F("(p135!=1)"))...204
Formula 0 simplified : X(G!"(p1163==0)" | XG(FG!"(p135!=1)" & (!"(p420!=1)" | G(FG!"(p135!=1)" & (!"(p1293!=1)" | XG!"(p135!=1)")))))
Detected timeout of ITS tools.
[2026-05-23 14:38:23] [INFO ] Flatten gal took : 51 ms
[2026-05-23 14:38:23] [INFO ] Applying decomposition
[2026-05-23 14:38:23] [INFO ] Flatten gal took : 49 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/graph15341921540568958010.txt' '-o' '/tmp/graph15341921540568958010.bin' '-w' '/tmp/graph15341921540568958010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15341921540568958010.bin' '-l' '-1' '-v' '-w' '/tmp/graph15341921540568958010.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:38:23] [INFO ] Decomposing Gal with order
[2026-05-23 14:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:38:23] [INFO ] Removed a total of 1942 redundant transitions.
[2026-05-23 14:38:23] [INFO ] Flatten gal took : 259 ms
[2026-05-23 14:38:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 85 ms.
[2026-05-23 14:38:24] [INFO ] Time to serialize gal into /tmp/LTL6734537552040702341.gal : 26 ms
[2026-05-23 14:38:24] [INFO ] Time to serialize properties into /tmp/LTL14096498743574925497.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/LTL6734537552040702341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14096498743574925497.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 : !((X((F("(i40.i1.i1.u242.p1163==0)"))&&(X(F((G(F((G(F("(i4.u30.p135!=1)")))||(("(i44.i1.i0.u268.p1293!=1)")&&(X(F("(i4.u30.p135!=1)"))...285
Formula 0 simplified : X(G!"(i40.i1.i1.u242.p1163==0)" | XG(FG!"(i4.u30.p135!=1)" & (!"(i15.u89.p420!=1)" | G(FG!"(i4.u30.p135!=1)" & (!"(i44.i1.i0.u268.p1...192
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T1U-LTLFireability-01 finished in 184215 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(p0) U (!(p0 U p1)&&G(!p0)))||X(p2)))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 886 transition count 1882
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 886 transition count 1882
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 875 transition count 1871
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 875 transition count 1871
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 870 transition count 1866
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 870 transition count 1866
Applied a total of 70 rules in 80 ms. Remains 870 /905 variables (removed 35) and now considering 1866/1901 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3710808378290294437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16183104686736816756.kers'
[2026-05-23 14:38:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3710808378290294437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16183104686736816756.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1866 rows 870 cols 5722 entries
Finished phase 1 with 807 SingleSign rule and 0 generalized
[2026-05-23 14:38:39] [INFO ] Computed 63 invariants in 8 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16183104686736816756.kers
Total runtime 10 ms.
[2026-05-23 14:38:39] [INFO ] Implicit Places using invariants in 537 ms returned []
[2026-05-23 14:38:39] [INFO ] Invariant cache hit.
[2026-05-23 14:38:41] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2026-05-23 14:38:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1865/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60905ms
Starting structural reductions in LTL mode, iteration 1 : 870/905 places, 1866/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62837 ms. Remains : 870/905 places, 1866/1901 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(p0) U (!(p0 U p1)&&G(!p0)))||X(p2)))'
Stuttering acceptance computed with spot in 234 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), p0, true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1217 steps with 1 reset in 10 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-02 finished in 63152 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(p0)||(F(p1)&&(F(p0) U p2))))'
Support contains 3 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 930 edges and 905 vertex of which 465 / 905 are part of one of the 63 SCC in 2 ms
Free SCC test removed 402 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 502 transition count 1383
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 1 with 202 rules applied. Total rules applied 288 place count 417 transition count 1266
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 58 rules applied. Total rules applied 346 place count 360 transition count 1265
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 349 place count 359 transition count 1263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 358 transition count 1263
Discarding 55 places :
Symmetric choice reduction at 5 with 55 rule applications. Total rules 405 place count 303 transition count 814
Iterating global reduction 5 with 55 rules applied. Total rules applied 460 place count 303 transition count 814
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 507 place count 303 transition count 767
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 6 with 238 rules applied. Total rules applied 745 place count 184 transition count 648
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 747 place count 182 transition count 638
Iterating global reduction 6 with 2 rules applied. Total rules applied 749 place count 182 transition count 638
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 751 place count 182 transition count 636
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 182 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 754 place count 180 transition count 633
Applied a total of 754 rules in 109 ms. Remains 180 /905 variables (removed 725) and now considering 633/1901 (removed 1268) transitions.
[2026-05-23 14:39:42] [INFO ] Flow matrix only has 186 transitions (discarded 447 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13733228079817945102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7362052030109869558.kers'
[2026-05-23 14:39:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13733228079817945102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7362052030109869558.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 185 rows 167 cols 506 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 14:39:42] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7362052030109869558.kers
Total runtime 2 ms.
[2026-05-23 14:39:42] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-23 14:39:42] [INFO ] Flow matrix only has 186 transitions (discarded 447 similar events)
[2026-05-23 14:39:42] [INFO ] Invariant cache hit.
[2026-05-23 14:39:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 14:39:43] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2026-05-23 14:39:43] [INFO ] Redundant transitions in 9 ms returned []
Running 473 sub problems to find dead transitions.
[2026-05-23 14:39:43] [INFO ] Flow matrix only has 186 transitions (discarded 447 similar events)
[2026-05-23 14:39:43] [INFO ] Invariant cache hit.
[2026-05-23 14:39:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 4/180 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 185/365 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/366 variables, and 247 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 473/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 4/180 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 185/365 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 472/719 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/366 variables, and 719 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 473/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 180/905 places, 633/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61086 ms. Remains : 180/905 places, 633/1901 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(p0)||(F(p1)&&(F(p0) U p2))))'
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-03
Stuttering criterion allowed to conclude after 564 steps with 12 reset in 13 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-03 finished in 61499 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' '!(((p0 U X(p1)) U X((F(p2)&&X(X(!p1))))))'
Support contains 3 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 887 transition count 1883
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 887 transition count 1883
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 877 transition count 1873
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 877 transition count 1873
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 872 transition count 1868
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 872 transition count 1868
Applied a total of 66 rules in 132 ms. Remains 872 /905 variables (removed 33) and now considering 1868/1901 (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-1911241619830057951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1505414657917425511.kers'
[2026-05-23 14:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1911241619830057951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1505414657917425511.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1868 rows 872 cols 5726 entries
Finished phase 1 with 809 SingleSign rule and 0 generalized
[2026-05-23 14:40:44] [INFO ] Computed 63 invariants in 13 ms
Computed 63 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1505414657917425511.kers
Total runtime 17 ms.
[2026-05-23 14:40:44] [INFO ] Implicit Places using invariants in 749 ms returned []
[2026-05-23 14:40:44] [INFO ] Invariant cache hit.
[2026-05-23 14:40:46] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
Running 1867 sub problems to find dead transitions.
[2026-05-23 14:40:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1867/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1867 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 1867 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in LTL mode, iteration 1 : 872/905 places, 1868/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63260 ms. Remains : 872/905 places, 1868/1901 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' '!(((p0 U X(p1)) U X((F(p2)&&X(X(!p1))))))'
Stuttering acceptance computed with spot in 747 ms :[(OR (NOT p2) p1), false, (OR (NOT p2) p1), (AND p0 (NOT p1) (NOT p2)), p1, (NOT p2), p1, true, false, p1, (AND p0 (NOT p1) (NOT p2)), false, (AND (NOT p2) p1), p1, p1]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-04
Product exploration explored 100000 steps with 5659 reset in 560 ms.
Stack based approach found an accepted trace after 5667 steps with 310 reset with depth 7 and stack size 7 in 33 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-04 finished in 64699 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 U p1)&&X(X(G((X(G(p2))||F(p3))))))))'
Support contains 6 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 884 transition count 1880
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 884 transition count 1880
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 873 transition count 1869
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 873 transition count 1869
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 867 transition count 1863
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 867 transition count 1863
Applied a total of 76 rules in 139 ms. Remains 867 /905 variables (removed 38) and now considering 1863/1901 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11135518083249182879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12695635196786076624.kers'
[2026-05-23 14:41:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11135518083249182879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12695635196786076624.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1863 rows 867 cols 5716 entries
Finished phase 1 with 804 SingleSign rule and 0 generalized
[2026-05-23 14:41:48] [INFO ] Computed 63 invariants in 10 ms
Computed 63 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12695635196786076624.kers
Total runtime 13 ms.
[2026-05-23 14:41:49] [INFO ] Implicit Places using invariants in 650 ms returned []
[2026-05-23 14:41:49] [INFO ] Invariant cache hit.
[2026-05-23 14:41:51] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2026-05-23 14:41:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60970ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60977ms
Starting structural reductions in LTL mode, iteration 1 : 867/905 places, 1863/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63539 ms. Remains : 867/905 places, 1863/1901 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 U p1)&&X(X(G((X(G(p2))||F(p3))))))))'
Stuttering acceptance computed with spot in 1170 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-06
Stuttering criterion allowed to conclude after 1204 steps with 0 reset in 14 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-06 finished in 64852 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(G(p1)))))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 933 edges and 905 vertex of which 469 / 905 are part of one of the 63 SCC in 2 ms
Free SCC test removed 406 places
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 438 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 498 transition count 1379
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 202 rules applied. Total rules applied 286 place count 415 transition count 1260
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 344 place count 357 transition count 1260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 344 place count 357 transition count 1259
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 356 transition count 1259
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 399 place count 303 transition count 812
Iterating global reduction 3 with 53 rules applied. Total rules applied 452 place count 303 transition count 812
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 499 place count 303 transition count 765
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 739 place count 183 transition count 645
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 741 place count 181 transition count 635
Iterating global reduction 4 with 2 rules applied. Total rules applied 743 place count 181 transition count 635
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 745 place count 181 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 747 place count 179 transition count 631
Applied a total of 747 rules in 155 ms. Remains 179 /905 variables (removed 726) and now considering 631/1901 (removed 1270) transitions.
[2026-05-23 14:42:53] [INFO ] Flow matrix only has 167 transitions (discarded 464 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2428063807616730624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5620023151119012756.kers'
[2026-05-23 14:42:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2428063807616730624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5620023151119012756.kers]
Normalized transition count is 166 out of 167 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 166 rows 165 cols 435 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 14:42:53] [INFO ] Computed 63 invariants in 3 ms
Computed 63 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5620023151119012756.kers
Total runtime 4 ms.
[2026-05-23 14:42:53] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-23 14:42:53] [INFO ] Flow matrix only has 167 transitions (discarded 464 similar events)
[2026-05-23 14:42:53] [INFO ] Invariant cache hit.
[2026-05-23 14:42:54] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2026-05-23 14:42:54] [INFO ] Redundant transitions in 8 ms returned []
Running 481 sub problems to find dead transitions.
[2026-05-23 14:42:54] [INFO ] Flow matrix only has 167 transitions (discarded 464 similar events)
[2026-05-23 14:42:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 4/179 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 166/345 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 345/346 variables, and 242 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 481/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 4/179 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 166/345 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 480/722 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/346 variables, and 723 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 481/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/905 places, 631/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60891 ms. Remains : 179/905 places, 631/1901 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(G(p1)))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-07 finished in 61106 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((F(p0)&&F(p1)&&(p2||G(!p1)))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 885 transition count 1881
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 885 transition count 1881
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 875 transition count 1871
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 875 transition count 1871
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 869 transition count 1865
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 869 transition count 1865
Applied a total of 72 rules in 137 ms. Remains 869 /905 variables (removed 36) and now considering 1865/1901 (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-360723084309907791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8154605602727530178.kers'
[2026-05-23 14:43:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-360723084309907791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8154605602727530178.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1865 rows 869 cols 5720 entries
Finished phase 1 with 806 SingleSign rule and 0 generalized
[2026-05-23 14:43:54] [INFO ] Computed 63 invariants in 12 ms
Computed 63 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8154605602727530178.kers
Total runtime 16 ms.
[2026-05-23 14:43:55] [INFO ] Implicit Places using invariants in 839 ms returned []
[2026-05-23 14:43:55] [INFO ] Invariant cache hit.
[2026-05-23 14:43:56] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
Running 1864 sub problems to find dead transitions.
[2026-05-23 14:43:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/2734 variables, and 0 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1864/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2734 variables, and 0 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60767ms problems are : Problem set: 0 solved, 1864 unsolved
Search for dead transitions found 0 dead transitions in 60772ms
Starting structural reductions in LTL mode, iteration 1 : 869/905 places, 1865/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63250 ms. Remains : 869/905 places, 1865/1901 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((F(p0)&&F(p1)&&(p2||G(!p1)))))'
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 1736 steps with 0 reset in 12 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-09 finished in 63616 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 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 931 edges and 905 vertex of which 462 / 905 are part of one of the 62 SCC in 2 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 504 transition count 1382
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 205 rules applied. Total rules applied 292 place count 418 transition count 1263
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 350 place count 360 transition count 1263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 350 place count 360 transition count 1262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 359 transition count 1262
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 405 place count 306 transition count 839
Iterating global reduction 3 with 53 rules applied. Total rules applied 458 place count 306 transition count 839
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 503 place count 306 transition count 794
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 749 place count 183 transition count 671
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 751 place count 181 transition count 661
Iterating global reduction 4 with 2 rules applied. Total rules applied 753 place count 181 transition count 661
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 755 place count 181 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 757 place count 180 transition count 672
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 771 place count 180 transition count 658
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 772 place count 179 transition count 644
Iterating global reduction 5 with 1 rules applied. Total rules applied 773 place count 179 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 774 place count 179 transition count 643
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 776 place count 177 transition count 641
Applied a total of 776 rules in 170 ms. Remains 177 /905 variables (removed 728) and now considering 641/1901 (removed 1260) transitions.
[2026-05-23 14:44:58] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13990147336312624914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-472399811481198444.kers'
[2026-05-23 14:44:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13990147336312624914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-472399811481198444.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 177 rows 163 cols 472 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 14:44:58] [INFO ] Computed 63 invariants in 2 ms
Computed 63 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-472399811481198444.kers
Total runtime 4 ms.
[2026-05-23 14:44:58] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-23 14:44:58] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
[2026-05-23 14:44:58] [INFO ] Invariant cache hit.
[2026-05-23 14:44:58] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2026-05-23 14:44:58] [INFO ] Redundant transitions in 14 ms returned []
Running 467 sub problems to find dead transitions.
[2026-05-23 14:44:58] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
[2026-05-23 14:44:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 177/354 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/355 variables, and 240 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 177/354 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 466/706 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/355 variables, and 706 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/905 places, 641/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61041 ms. Remains : 177/905 places, 641/1901 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 59 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-10 finished in 61143 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' '!((p0 U G(!p0)))'
Support contains 1 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 934 edges and 905 vertex of which 462 / 905 are part of one of the 62 SCC in 2 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 504 transition count 1382
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 205 rules applied. Total rules applied 292 place count 418 transition count 1263
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 350 place count 360 transition count 1263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 350 place count 360 transition count 1261
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 354 place count 358 transition count 1261
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 408 place count 304 transition count 824
Iterating global reduction 3 with 54 rules applied. Total rules applied 462 place count 304 transition count 824
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 508 place count 304 transition count 778
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 752 place count 182 transition count 656
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 754 place count 180 transition count 646
Iterating global reduction 4 with 2 rules applied. Total rules applied 756 place count 180 transition count 646
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 758 place count 180 transition count 644
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 760 place count 178 transition count 642
Applied a total of 760 rules in 115 ms. Remains 178 /905 variables (removed 727) and now considering 642/1901 (removed 1259) transitions.
[2026-05-23 14:45:59] [INFO ] Flow matrix only has 168 transitions (discarded 474 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10945824696762446981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1778534755459191150.kers'
[2026-05-23 14:45:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10945824696762446981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1778534755459191150.kers]
Normalized transition count is 167 out of 168 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 167 rows 164 cols 430 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 14:45:59] [INFO ] Computed 63 invariants in 2 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1778534755459191150.kers
Total runtime 3 ms.
[2026-05-23 14:45:59] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-23 14:45:59] [INFO ] Flow matrix only has 168 transitions (discarded 474 similar events)
[2026-05-23 14:45:59] [INFO ] Invariant cache hit.
[2026-05-23 14:46:00] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2026-05-23 14:46:00] [INFO ] Redundant transitions in 13 ms returned []
Running 467 sub problems to find dead transitions.
[2026-05-23 14:46:00] [INFO ] Flow matrix only has 168 transitions (discarded 474 similar events)
[2026-05-23 14:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 345/346 variables, and 241 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 466/707 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/346 variables, and 707 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/905 places, 642/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61009 ms. Remains : 178/905 places, 642/1901 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' '!((p0 U G(!p0)))'
Stuttering acceptance computed with spot in 118 ms :[p0, true, p0]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-11
Entered a terminal (fully accepting) state of product in 365 steps with 2 reset in 3 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-11 finished in 61169 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(((p0||X((X(X(X(p1))) U (p0&&X(X(X(p1))))))) U X(G(p2))))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 886 transition count 1882
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 886 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 877 transition count 1873
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 877 transition count 1873
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 872 transition count 1868
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 872 transition count 1868
Applied a total of 66 rules in 79 ms. Remains 872 /905 variables (removed 33) and now considering 1868/1901 (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-2176621579413444470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10206022942377975590.kers'
[2026-05-23 14:47:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2176621579413444470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10206022942377975590.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1868 rows 872 cols 5726 entries
Finished phase 1 with 809 SingleSign rule and 0 generalized
[2026-05-23 14:47:00] [INFO ] Computed 63 invariants in 12 ms
Computed 63 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-10206022942377975590.kers
Total runtime 16 ms.
[2026-05-23 14:47:01] [INFO ] Implicit Places using invariants in 694 ms returned []
[2026-05-23 14:47:01] [INFO ] Invariant cache hit.
[2026-05-23 14:47:02] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
Running 1867 sub problems to find dead transitions.
[2026-05-23 14:47:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1867/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1867 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2740 variables, and 0 constraints, problems are : Problem set: 0 solved, 1867 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1/1866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 1867 unsolved
Search for dead transitions found 0 dead transitions in 60889ms
Starting structural reductions in LTL mode, iteration 1 : 872/905 places, 1868/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63084 ms. Remains : 872/905 places, 1868/1901 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(((p0||X((X(X(X(p1))) U (p0&&X(X(X(p1))))))) U X(G(p2))))))'
Stuttering acceptance computed with spot in 692 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-12
Stuttering criterion allowed to conclude after 4307 steps with 14 reset in 33 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-12 finished in 63940 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)&&G(p1)))))'
Support contains 3 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 885 transition count 1881
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 885 transition count 1881
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 874 transition count 1870
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 874 transition count 1870
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 868 transition count 1864
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 868 transition count 1864
Applied a total of 74 rules in 129 ms. Remains 868 /905 variables (removed 37) and now considering 1864/1901 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-227504595781659568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13634175207152260722.kers'
[2026-05-23 14:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-227504595781659568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13634175207152260722.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1864 rows 868 cols 5718 entries
Finished phase 1 with 805 SingleSign rule and 0 generalized
[2026-05-23 14:48:04] [INFO ] Computed 63 invariants in 13 ms
Computed 63 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13634175207152260722.kers
Total runtime 17 ms.
[2026-05-23 14:48:05] [INFO ] Implicit Places using invariants in 770 ms returned []
[2026-05-23 14:48:05] [INFO ] Invariant cache hit.
[2026-05-23 14:48:06] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2026-05-23 14:48:06] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2732 variables, and 0 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1863/1862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/2732 variables, and 0 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1/1862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60852ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60859ms
Starting structural reductions in LTL mode, iteration 1 : 868/905 places, 1864/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63279 ms. Remains : 868/905 places, 1864/1901 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)&&G(p1)))))'
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3140 steps with 2 reset in 19 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-13 finished in 63573 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 1 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Graph (trivial) has 934 edges and 905 vertex of which 467 / 905 are part of one of the 63 SCC in 2 ms
Free SCC test removed 404 places
Ensure Unique test removed 435 transitions
Reduce isomorphic transitions removed 435 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 500 transition count 1380
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 204 rules applied. Total rules applied 290 place count 415 transition count 1261
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 348 place count 357 transition count 1261
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 403 place count 302 transition count 812
Iterating global reduction 3 with 55 rules applied. Total rules applied 458 place count 302 transition count 812
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 505 place count 302 transition count 765
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 747 place count 181 transition count 644
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 749 place count 179 transition count 634
Iterating global reduction 4 with 2 rules applied. Total rules applied 751 place count 179 transition count 634
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 753 place count 179 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 755 place count 177 transition count 630
Applied a total of 755 rules in 63 ms. Remains 177 /905 variables (removed 728) and now considering 630/1901 (removed 1271) transitions.
[2026-05-23 14:49:08] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-273399707353221342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6310806181398880678.kers'
[2026-05-23 14:49:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-273399707353221342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6310806181398880678.kers]
Normalized transition count is 165 out of 166 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 165 rows 164 cols 428 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 14:49:08] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6310806181398880678.kers
Total runtime 2 ms.
[2026-05-23 14:49:08] [INFO ] Implicit Places using invariants in 279 ms returned []
[2026-05-23 14:49:08] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
[2026-05-23 14:49:08] [INFO ] Invariant cache hit.
[2026-05-23 14:49:08] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2026-05-23 14:49:08] [INFO ] Redundant transitions in 8 ms returned []
Running 454 sub problems to find dead transitions.
[2026-05-23 14:49:08] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
[2026-05-23 14:49:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/343 variables, and 240 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 454/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 453/693 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/343 variables, and 693 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 454/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/905 places, 630/1901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60845 ms. Remains : 177/905 places, 630/1901 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 62 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-14 finished in 60956 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(G(((X(p0)&&G(p1))||X((X(p2) U ((p3&&X(p2))||X(G(p2))))))))))'
Support contains 5 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1901/1901 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 887 transition count 1883
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 887 transition count 1883
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 879 transition count 1875
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 879 transition count 1875
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 874 transition count 1870
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 874 transition count 1870
Applied a total of 62 rules in 125 ms. Remains 874 /905 variables (removed 31) and now considering 1870/1901 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1257718984943496730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15848881788926679851.kers'
[2026-05-23 14:50:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1257718984943496730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15848881788926679851.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1870 rows 874 cols 5730 entries
Finished phase 1 with 811 SingleSign rule and 0 generalized
[2026-05-23 14:50:09] [INFO ] Computed 63 invariants in 16 ms
Computed 63 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15848881788926679851.kers
Total runtime 20 ms.
[2026-05-23 14:50:09] [INFO ] Implicit Places using invariants in 827 ms returned []
[2026-05-23 14:50:09] [INFO ] Invariant cache hit.
[2026-05-23 14:50:11] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2392 ms to find 0 implicit places.
Running 1869 sub problems to find dead transitions.
[2026-05-23 14:50:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/2744 variables, and 0 constraints, problems are : Problem set: 0 solved, 1869 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 1869/1868 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1869 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/2744 variables, and 0 constraints, problems are : Problem set: 0 solved, 1869 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 1/1868 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60942ms problems are : Problem set: 0 solved, 1869 unsolved
Search for dead transitions found 0 dead transitions in 60948ms
Starting structural reductions in LTL mode, iteration 1 : 874/905 places, 1870/1901 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63473 ms. Remains : 874/905 places, 1870/1901 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(G((X((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(X(p2)&&G(p3)))))))'
Stuttering acceptance computed with spot in 492 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-15
Product exploration explored 100000 steps with 16640 reset in 348 ms.
Product exploration explored 100000 steps with 16663 reset in 380 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/874 stabilizing places and 65/1870 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (30 resets) in 648 ms. (61 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2026-05-23 14:51:14] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 819/874 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1870/2744 variables, 874/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2744 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2744 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2744/2744 variables, and 937 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 874/874 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 819/874 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1870/2744 variables, 874/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2744 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2744 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2744 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2744/2744 variables, and 938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2564ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 290 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 10 ms.
Knowledge based reduction with 3 factoid took 292 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Knowledge-based reduction took 3786 ms.
Stuttering acceptance computed with spot in 491 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Support contains 5 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 1870/1870 transitions.
Applied a total of 0 rules in 30 ms. Remains 874 /874 variables (removed 0) and now considering 1870/1870 (removed 0) transitions.
[2026-05-23 14:51:18] [INFO ] Invariant cache hit.
[2026-05-23 14:51:18] [INFO ] Implicit Places using invariants in 664 ms returned []
[2026-05-23 14:51:18] [INFO ] Invariant cache hit.
[2026-05-23 14:51:20] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2146 ms. Remains : 874/874 places, 1870/1870 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/874 stabilizing places and 65/1870 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (31 resets) in 479 ms. (83 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2026-05-23 14:51:20] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 819/874 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1870/2744 variables, 874/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2744 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2744 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2744/2744 variables, and 937 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 874/874 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 819/874 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1870/2744 variables, 874/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2744 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2744 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2744 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2744/2744 variables, and 938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2139ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 276 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 466 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Knowledge-based reduction took 3254 ms.
Stuttering acceptance computed with spot in 474 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Stuttering acceptance computed with spot in 473 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), true, (AND (NOT p3) p0)]
Product exploration explored 100000 steps with 16663 reset in 370 ms.
Product exploration explored 100000 steps with 16690 reset in 352 ms.
Spot run failed in 85 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/ltsmin12639265657676249620
[2026-05-23 14:51:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12639265657676249620
Running compilation step : cd /tmp/ltsmin12639265657676249620;'/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/ltsmin12639265657676249620;'/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/ltsmin12639265657676249620;'/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 5 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 1870/1870 transitions.
Applied a total of 0 rules in 32 ms. Remains 874 /874 variables (removed 0) and now considering 1870/1870 (removed 0) transitions.
[2026-05-23 14:51:28] [INFO ] Invariant cache hit.
[2026-05-23 14:51:28] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-05-23 14:51:28] [INFO ] Invariant cache hit.
[2026-05-23 14:51:30] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2107 ms. Remains : 874/874 places, 1870/1870 transitions.
Built C files in :
/tmp/ltsmin1995922291909312461
[2026-05-23 14:51:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1995922291909312461
Running compilation step : cd /tmp/ltsmin1995922291909312461;'/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/ltsmin1995922291909312461;'/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/ltsmin1995922291909312461;'/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)
[2026-05-23 14:51:33] [INFO ] Flatten gal took : 67 ms
[2026-05-23 14:51:33] [INFO ] Flatten gal took : 64 ms
[2026-05-23 14:51:33] [INFO ] Time to serialize gal into /tmp/LTL10609809309703851664.gal : 16 ms
[2026-05-23 14:51:33] [INFO ] Time to serialize properties into /tmp/LTL598503127573135902.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/LTL10609809309703851664.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17151084295600259489.hoa' '-atoms' '/tmp/LTL598503127573135902.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/LTL598503127573135902.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17151084295600259489.hoa
Detected timeout of ITS tools.
[2026-05-23 14:51:48] [INFO ] Flatten gal took : 37 ms
[2026-05-23 14:51:48] [INFO ] Flatten gal took : 35 ms
[2026-05-23 14:51:48] [INFO ] Time to serialize gal into /tmp/LTL8333354081999585519.gal : 8 ms
[2026-05-23 14:51:48] [INFO ] Time to serialize properties into /tmp/LTL862420165837830288.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/LTL8333354081999585519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL862420165837830288.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X((X("(p243!=1)"))U((X(G("(p243!=1)")))||(("(p543!=1)")&&(X("(p243!=1)"))))))||((X("(p1404==0)"))&&(G("((p1195==0)||(p1338==...167
Formula 0 simplified : XXF(X(X!"(p243!=1)" R (XF!"(p243!=1)" & (!"(p543!=1)" | X!"(p243!=1)"))) & (X!"(p1404==0)" | F!"((p1195==0)||(p1338==0))"))
Detected timeout of ITS tools.
[2026-05-23 14:52:03] [INFO ] Flatten gal took : 34 ms
[2026-05-23 14:52:03] [INFO ] Applying decomposition
[2026-05-23 14:52:03] [INFO ] Flatten gal took : 36 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/graph15771964422087337302.txt' '-o' '/tmp/graph15771964422087337302.bin' '-w' '/tmp/graph15771964422087337302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15771964422087337302.bin' '-l' '-1' '-v' '-w' '/tmp/graph15771964422087337302.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:52:04] [INFO ] Decomposing Gal with order
[2026-05-23 14:52:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:52:04] [INFO ] Removed a total of 1940 redundant transitions.
[2026-05-23 14:52:04] [INFO ] Flatten gal took : 106 ms
[2026-05-23 14:52:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 80 ms.
[2026-05-23 14:52:04] [INFO ] Time to serialize gal into /tmp/LTL14135179502278395740.gal : 21 ms
[2026-05-23 14:52:04] [INFO ] Time to serialize properties into /tmp/LTL5185086540598792142.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/LTL14135179502278395740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5185086540598792142.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 : !((X(X(G((X((X("(i0.u52.p243!=1)"))U((X(G("(i0.u52.p243!=1)")))||(("(i19.u115.p543!=1)")&&(X("(i0.u52.p243!=1)"))))))||((X("(i45.i1.i2...242
Formula 0 simplified : XXF(X(X!"(i0.u52.p243!=1)" R (XF!"(i0.u52.p243!=1)" & (!"(i19.u115.p543!=1)" | X!"(i0.u52.p243!=1)"))) & (X!"(i45.i1.i2.u283.p1404==...221
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T1U-LTLFireability-15 finished in 130601 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((F(p0)&&X(F((G(F(((p1&&X(F(p2)))||G(F(p2)))))||(p3&&F(((p1&&X(F(p2)))||G(F(p2)))))))))))'
Spot run failed in 54 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' '!(X(X(G(((X(p0)&&G(p1))||X((X(p2) U ((p3&&X(p2))||X(G(p2))))))))))'
Spot run failed in 49 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-23 14:52:19] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10436882366746780766
[2026-05-23 14:52:19] [INFO ] Too many transitions (1901) to apply POR reductions. Disabling POR matrices.
[2026-05-23 14:52:19] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10436882366746780766
Running compilation step : cd /tmp/ltsmin10436882366746780766;'/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-23 14:52:19] [INFO ] Applying decomposition
[2026-05-23 14:52:19] [INFO ] Flatten gal took : 44 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/graph2720575797938152717.txt' '-o' '/tmp/graph2720575797938152717.bin' '-w' '/tmp/graph2720575797938152717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2720575797938152717.bin' '-l' '-1' '-v' '-w' '/tmp/graph2720575797938152717.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:52:20] [INFO ] Decomposing Gal with order
[2026-05-23 14:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:52:20] [INFO ] Removed a total of 1937 redundant transitions.
[2026-05-23 14:52:20] [INFO ] Flatten gal took : 132 ms
[2026-05-23 14:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 76 ms.
[2026-05-23 14:52:20] [INFO ] Time to serialize gal into /tmp/LTLFireability6661696583730393978.gal : 23 ms
[2026-05-23 14:52:20] [INFO ] Time to serialize properties into /tmp/LTLFireability2315374537803838995.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/LTLFireability6661696583730393978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2315374537803838995.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...276
Read 2 LTL properties
Checking formula 0 : !((X((F("(i38.i1.i1.u251.p1163==0)"))&&(X(F((G(F((("(i41.u276.p1293!=1)")&&(X(F("(i6.u32.p135!=1)"))))||(G(F("(i6.u32.p135!=1)"))))))|...273
Formula 0 simplified : X(G!"(i38.i1.i1.u251.p1163==0)" | XG(FG!"(i6.u32.p135!=1)" & (!"(i17.u95.p420!=1)" | G(FG!"(i6.u32.p135!=1)" & (!"(i41.u276.p1293!=1...186
Compilation finished in 6923 ms.
Running link step : cd /tmp/ltsmin10436882366746780766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin10436882366746780766;'/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((<>((LTLAPp0==true))&&X(<>(([](<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true))))))||((LTLAPp3==true)&&<>((((LTLAPp1==true)&&X(<>((LTLAPp2==true))))||[](<>((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
LTSmin run took 518 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10436882366746780766;'/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((LTLAPp4==true))&&[]((LTLAPp5==true)))||X((X((LTLAPp6==true)) U (((LTLAPp7==true)&&X((LTLAPp6==true)))||X([]((LTLAPp6==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10436882366746780766;'/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((LTLAPp4==true))&&[]((LTLAPp5==true)))||X((X((LTLAPp6==true)) U (((LTLAPp7==true)&&X((LTLAPp6==true)))||X([]((LTLAPp6==true))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10436882366746780766;'/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((LTLAPp4==true))&&[]((LTLAPp5==true)))||X((X((LTLAPp6==true)) U (((LTLAPp7==true)&&X((LTLAPp6==true)))||X([]((LTLAPp6==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 15:18:40] [INFO ] Applying decomposition
[2026-05-23 15:18:40] [INFO ] Flatten gal took : 29 ms
[2026-05-23 15:18:40] [INFO ] Decomposing Gal with order
[2026-05-23 15:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:18:40] [INFO ] Removed a total of 1645 redundant transitions.
[2026-05-23 15:18:40] [INFO ] Flatten gal took : 67 ms
[2026-05-23 15:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 715 labels/synchronizations in 138 ms.
[2026-05-23 15:18:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4747311700981942358.gal : 12 ms
[2026-05-23 15:18:41] [INFO ] Time to serialize properties into /tmp/LTLFireability75462600538806202.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/LTLFireability4747311700981942358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability75462600538806202.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G(((X("(i1.i1.i1.i1.i1.i1.i0.i0.i0.u109.p1404==0)"))&&(G("((i1.i1.i1.i1.i0.i0.i0.u93.p1195==0)||(i1.i1.i1.i1.i1.i0.u103.p1338==...329
Formula 0 simplified : XXF(X(X!"(i0.i0.i0.i0.i0.u23.p243!=1)" R (XF!"(i0.i0.i0.i0.i0.u23.p243!=1)" & (!"(i1.i0.i0.i0.i0.i0.i0.u46.p543!=1)" | X!"(i0.i0.i0....308
Reverse transition relation is NOT exact ! Due to transitions i0.u27.t767, i0.i0.u26.t782, i0.i0.i0.u25.t797, i0.i0.i0.i0.u24.t812, i0.i0.i0.i0.i0.u23.t827...2541
Computing Next relation with stutter on 2.39299e+23 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Champagne-PT-H10T1U"
export BK_EXAMINATION="LTLFireability"
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 Champagne-PT-H10T1U, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901100156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H10T1U.tgz
mv Champagne-PT-H10T1U execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;