About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.407 | 3600000.00 | 4569752.00 | 357142.40 | FFF??FF??FFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800892.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800892
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.9K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779685421983
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 05:03:43] [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-25 05:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:03:43] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2026-05-25 05:03:43] [INFO ] Transformed 1064 places.
[2026-05-25 05:03:43] [INFO ] Transformed 998 transitions.
[2026-05-25 05:03:43] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 126 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8335208768842608578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5407742582359407775.kers'
[2026-05-25 05:03:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8335208768842608578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5407742582359407775.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 998 rows 1060 cols 2810 entries
Finished phase 1 with 898 SingleSign rule and 61 generalized
[2026-05-25 05:03:43] [INFO ] Computed 101 invariants in 117 ms
Computed 101 P flows in 118 ms.
Exported basis to /tmp/petrispot-output-5407742582359407775.kers
Total runtime 121 ms.
[2026-05-25 05:03:44] [INFO ] Implicit Places using invariants in 768 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 800 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1059/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1058 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1058 transition count 997
Applied a total of 2 rules in 170 ms. Remains 1058 /1059 variables (removed 1) and now considering 997/998 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-824159891693210021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-642471022857305062.kers'
[2026-05-25 05:03:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-824159891693210021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-642471022857305062.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 997 rows 1058 cols 2805 entries
Finished phase 1 with 895 SingleSign rule and 63 generalized
[2026-05-25 05:03:44] [INFO ] Computed 100 invariants in 118 ms
Computed 100 P flows in 118 ms.
Exported basis to /tmp/petrispot-output-642471022857305062.kers
Total runtime 122 ms.
[2026-05-25 05:03:45] [INFO ] Implicit Places using invariants in 596 ms returned []
[2026-05-25 05:03:45] [INFO ] Invariant cache hit.
[2026-05-25 05:03:57] [INFO ] Implicit Places using invariants and state equation in 12580 ms returned []
Implicit Place search using SMT with State Equation took 13180 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1058/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14290 ms. Remains : 1058/1064 places, 997/998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 43 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:03:58] [INFO ] Invariant cache hit.
[2026-05-25 05:03:58] [INFO ] Implicit Places using invariants in 391 ms returned []
[2026-05-25 05:03:58] [INFO ] Invariant cache hit.
[2026-05-25 05:04:11] [INFO ] Implicit Places using invariants and state equation in 12589 ms returned []
Implicit Place search using SMT with State Equation took 12984 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
[2026-05-25 05:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1057 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1057/2055 variables, and 94 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 94/98 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1057 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1057 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 60282ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in LTL mode , in 1 iterations and 73363 ms. Remains : 1058/1058 places, 997/997 transitions.
Support contains 56 out of 1058 places after structural reductions.
[2026-05-25 05:05:11] [INFO ] Flatten gal took : 105 ms
[2026-05-25 05:05:11] [INFO ] Flatten gal took : 52 ms
[2026-05-25 05:05:11] [INFO ] Input system was already deterministic with 997 transitions.
RANDOM walk for 40000 steps (1328 resets) in 1471 ms. (27 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (115 resets) in 50 ms. (78 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (99 resets) in 45 ms. (86 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (113 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 44 ms. (88 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (114 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (108 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (113 resets) in 42 ms. (93 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (117 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (108 resets) in 57 ms. (68 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (115 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (118 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (114 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (113 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (111 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (106 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (106 resets) in 50 ms. (78 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (111 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (112 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (112 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (116 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (109 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (103 resets) in 77 ms. (51 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4002 steps (108 resets) in 81 ms. (48 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (117 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (116 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 48 ms. (81 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (114 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (108 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (112 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (108 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 134925 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :1 out of 35
Probabilistic random walk after 134925 steps, saw 67475 distinct states, run finished after 3008 ms. (steps per millisecond=44 ) properties seen :1
[2026-05-25 05:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 768/819 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 6/825 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 108/933 variables, 35/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 971/1904 variables, 933/1034 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 1/1035 constraints. Problems are: Problem set: 0 solved, 34 unsolved
SMT process timed out in 5038ms, After SMT, problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5001 ms.
Support contains 51 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1056 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 187 rules applied. Total rules applied 188 place count 1056 transition count 809
Reduce places removed 186 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 206 rules applied. Total rules applied 394 place count 870 transition count 789
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 414 place count 850 transition count 789
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 414 place count 850 transition count 742
Deduced a syphon composed of 47 places in 6 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 508 place count 803 transition count 742
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 5 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 828 place count 643 transition count 582
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 9 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 894 place count 610 transition count 582
Free-agglomeration rule (complex) applied 70 times.
Iterating global reduction 3 with 70 rules applied. Total rules applied 964 place count 610 transition count 512
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 1034 place count 540 transition count 512
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 1116 place count 540 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1117 place count 539 transition count 511
Applied a total of 1117 rules in 314 ms. Remains 539 /1058 variables (removed 519) and now considering 511/997 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 539/1058 places, 511/997 transitions.
RANDOM walk for 40000 steps (5159 resets) in 422 ms. (94 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (346 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (359 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (327 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (342 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (350 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (346 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (332 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (360 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (332 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (343 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (344 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (342 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (350 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (340 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (347 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (328 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (329 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (343 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (331 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (333 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (317 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (340 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (326 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (335 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (341 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (343 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (334 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (337 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (333 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (332 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (355 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (339 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (332 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (331 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 160144 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 34
Probabilistic random walk after 160144 steps, saw 80103 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15673512659210855348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13331066602190882798.kers'
[2026-05-25 05:05:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15673512659210855348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13331066602190882798.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 511 rows 537 cols 2831 entries
Finished phase 1 with 324 SingleSign rule and 115 generalized
[2026-05-25 05:05:29] [INFO ] Computed 100 invariants in 12 ms
Computed 100 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-13331066602190882798.kers
Total runtime 13 ms.
[2026-05-25 05:05:29] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 417/468 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 10 (OVERLAPS) 67/535 variables, 41/175 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 20/195 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/215 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 20/235 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 20/255 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 20/275 constraints. Problems are: Problem set: 1 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1050 variables, and 275 constraints, problems are : Problem set: 1 solved, 33 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 0/539 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 177/177 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 415/462 variables, 55/55 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 89/144 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 71/533 variables, 42/186 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 87/273 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 2/535 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/275 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 20/295 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 20/315 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 20/335 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/355 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 20/375 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 20/395 constraints. Problems are: Problem set: 1 solved, 33 unsolved
SMT process timed out in 91322ms, After SMT, problems are : Problem set: 1 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 511/511 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 538 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 536 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 535 transition count 508
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 535 transition count 508
Applied a total of 9 rules in 84 ms. Remains 535 /539 variables (removed 4) and now considering 508/511 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 535/539 places, 508/511 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1808 edges and 1058 vertex of which 1056 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1056 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 479 place count 817 transition count 716
Deduced a syphon composed of 40 places in 18 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 559 place count 777 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 925 place count 594 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1001 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 555 transition count 532
Applied a total of 1002 rules in 187 ms. Remains 555 /1058 variables (removed 503) and now considering 532/997 (removed 465) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14442613218068312129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4085779047257728730.kers'
[2026-05-25 05:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14442613218068312129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4085779047257728730.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 532 rows 553 cols 2075 entries
Finished phase 1 with 322 SingleSign rule and 133 generalized
[2026-05-25 05:07:01] [INFO ] Computed 100 invariants in 18 ms
Computed 100 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4085779047257728730.kers
Total runtime 19 ms.
[2026-05-25 05:07:01] [INFO ] Implicit Places using invariants in 360 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1058 places, 532/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 530
Applied a total of 4 rules in 28 ms. Remains 552 /554 variables (removed 2) and now considering 530/532 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15570856747711184622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8978721904007069890.kers'
[2026-05-25 05:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15570856747711184622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8978721904007069890.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 530 rows 550 cols 2067 entries
Finished phase 1 with 316 SingleSign rule and 137 generalized
[2026-05-25 05:07:01] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8978721904007069890.kers
Total runtime 8 ms.
[2026-05-25 05:07:02] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-25 05:07:02] [INFO ] Invariant cache hit.
[2026-05-25 05:07:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 05:07:10] [INFO ] Implicit Places using invariants and state equation in 8283 ms returned []
Implicit Place search using SMT with State Equation took 8596 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1058 places, 530/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9176 ms. Remains : 552/1058 places, 530/997 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 168 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 10 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 9481 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(G((p0||X(X(p0))||G(p1)))))'
Support contains 4 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9010437638896543630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12015186273004688158.kers'
[2026-05-25 05:07:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9010437638896543630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12015186273004688158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 997 rows 1058 cols 2805 entries
Finished phase 1 with 895 SingleSign rule and 63 generalized
[2026-05-25 05:07:10] [INFO ] Computed 100 invariants in 115 ms
Computed 100 P flows in 116 ms.
Exported basis to /tmp/petrispot-output-12015186273004688158.kers
Total runtime 119 ms.
[2026-05-25 05:07:11] [INFO ] Implicit Places using invariants in 499 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 32 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 1057/1058 places, 997/997 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(G((X(X(p0))||G(p1)||p0))))'
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-01 finished in 946 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(((G((p0||F(p1)))&&X(X(X(F(p2))))) U p3)))'
Support contains 7 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:07:11] [INFO ] Invariant cache hit.
[2026-05-25 05:07:12] [INFO ] Implicit Places using invariants in 395 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 1057/1058 places, 997/997 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(((G((p0||F(p1)))&&X(X(X(F(p2))))) U p3)))'
Stuttering acceptance computed with spot in 335 ms :[(NOT p3), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02
Stuttering criterion allowed to conclude after 35 steps with 2 reset in 2 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 866 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 U (p1||G(p0))))))'
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1056 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 479 place count 817 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 559 place count 777 transition count 716
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 919 place count 597 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 993 place count 560 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 994 place count 559 transition count 535
Applied a total of 994 rules in 94 ms. Remains 559 /1058 variables (removed 499) and now considering 535/997 (removed 462) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6505292988380207313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17825555691274406781.kers'
[2026-05-25 05:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6505292988380207313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17825555691274406781.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 535 rows 557 cols 2066 entries
Finished phase 1 with 325 SingleSign rule and 134 generalized
[2026-05-25 05:07:12] [INFO ] Computed 100 invariants in 25 ms
Computed 100 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-17825555691274406781.kers
Total runtime 26 ms.
[2026-05-25 05:07:12] [INFO ] Implicit Places using invariants in 299 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 300 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1058 places, 535/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 533
Applied a total of 4 rules in 23 ms. Remains 556 /558 variables (removed 2) and now considering 533/535 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18092482980184534872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6406411415960199282.kers'
[2026-05-25 05:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18092482980184534872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6406411415960199282.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 533 rows 554 cols 2058 entries
Finished phase 1 with 320 SingleSign rule and 137 generalized
[2026-05-25 05:07:12] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6406411415960199282.kers
Total runtime 7 ms.
[2026-05-25 05:07:13] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-25 05:07:13] [INFO ] Invariant cache hit.
[2026-05-25 05:07:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:07:22] [INFO ] Implicit Places using invariants and state equation in 9038 ms returned []
Implicit Place search using SMT with State Equation took 9318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 556/1058 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9736 ms. Remains : 556/1058 places, 533/997 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 U (G(p0)||p1)))))'
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 13899 reset in 200 ms.
Product exploration explored 100000 steps with 13892 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 58 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (5510 resets) in 132 ms. (300 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3309 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2026-05-25 05:07:22] [INFO ] Invariant cache hit.
[2026-05-25 05:07:22] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 360/363 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/494 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/500 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 523/1023 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 36/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1089 variables, and 682 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 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) 360/363 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/494 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/500 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 523/1023 variables, 500/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 36/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1023 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1089 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 3412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6979 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1660 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 555 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 478 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 237 place count 478 transition count 455
Applied a total of 237 rules in 43 ms. Remains 478 /556 variables (removed 78) and now considering 455/533 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 478/556 places, 455/533 transitions.
RANDOM walk for 40000 steps (5113 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 381798 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 381798 steps, saw 190983 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13040347328575127639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5583899332137835652.kers'
[2026-05-25 05:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13040347328575127639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5583899332137835652.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 455 rows 476 cols 3885 entries
Finished phase 1 with 261 SingleSign rule and 118 generalized
[2026-05-25 05:07:36] [INFO ] Computed 99 invariants in 18 ms
Computed 99 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-5583899332137835652.kers
Total runtime 21 ms.
[2026-05-25 05:07:36] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/379 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/473 variables, 63/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 455/928 variables, 473/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 78/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/928 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/933 variables, 5/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 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) 376/379 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 94/473 variables, 63/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 26/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 455/928 variables, 473/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 78/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/933 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/933 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/933 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/933 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 302 ms.
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 15 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2026-05-25 05:07:52] [INFO ] Invariant cache hit.
[2026-05-25 05:08:05] [INFO ] Implicit Places using invariants in 12975 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 285, 290, 310, 315, 336, 341, 362, 368, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2026-05-25 05:08:05] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12982 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 475 transition count 454
Applied a total of 2 rules in 26 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17708439326907464047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4952256624803584631.kers'
[2026-05-25 05:08:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17708439326907464047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4952256624803584631.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 454 rows 473 cols 3782 entries
Finished phase 1 with 264 SingleSign rule and 114 generalized
[2026-05-25 05:08:05] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4952256624803584631.kers
Total runtime 7 ms.
[2026-05-25 05:08:16] [INFO ] Implicit Places using invariants in 11557 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 282, 287, 307, 312, 333, 338, 359, 365, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2026-05-25 05:08:16] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11565 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 453
Applied a total of 2 rules in 23 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3827186230579301467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9034316371043933740.kers'
[2026-05-25 05:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3827186230579301467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9034316371043933740.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 453 rows 470 cols 3687 entries
Finished phase 1 with 271 SingleSign rule and 106 generalized
[2026-05-25 05:08:16] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9034316371043933740.kers
Total runtime 7 ms.
[2026-05-25 05:08:26] [INFO ] Implicit Places using invariants in 9304 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 282, 287, 307, 312, 333, 338, 359, 365, 387, 392, 412, 418, 440, 445, 464, 470]
[2026-05-25 05:08:26] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9308 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 452
Applied a total of 2 rules in 23 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16347589052499827554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2497790406871926356.kers'
[2026-05-25 05:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16347589052499827554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2497790406871926356.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 452 rows 467 cols 3598 entries
Finished phase 1 with 260 SingleSign rule and 116 generalized
[2026-05-25 05:08:26] [INFO ] Computed 93 invariants in 8 ms
Computed 93 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2497790406871926356.kers
Total runtime 9 ms.
[2026-05-25 05:08:34] [INFO ] Implicit Places using invariants in 8727 ms returned [65, 70, 91, 96, 116, 122, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 279, 284, 304, 309, 330, 335, 356, 362, 384, 389, 409, 415, 437, 442, 461, 467]
[2026-05-25 05:08:34] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8733 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 451
Applied a total of 2 rules in 24 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2587785023612405945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11401612573115973484.kers'
[2026-05-25 05:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2587785023612405945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11401612573115973484.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 451 rows 464 cols 3514 entries
Finished phase 1 with 259 SingleSign rule and 116 generalized
[2026-05-25 05:08:34] [INFO ] Computed 91 invariants in 8 ms
Computed 91 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11401612573115973484.kers
Total runtime 9 ms.
[2026-05-25 05:08:42] [INFO ] Implicit Places using invariants in 7783 ms returned [88, 93, 113, 119, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 276, 281, 301, 306, 327, 332, 353, 359, 381, 386, 406, 412, 434, 439, 458, 464]
[2026-05-25 05:08:42] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 7785 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 450
Applied a total of 2 rules in 23 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3826011311855804890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13359442875272523274.kers'
[2026-05-25 05:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3826011311855804890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13359442875272523274.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 450 rows 461 cols 3435 entries
Finished phase 1 with 259 SingleSign rule and 115 generalized
[2026-05-25 05:08:42] [INFO ] Computed 89 invariants in 15 ms
Computed 89 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13359442875272523274.kers
Total runtime 16 ms.
[2026-05-25 05:08:49] [INFO ] Implicit Places using invariants in 6484 ms returned [110, 116, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 273, 278, 298, 303, 324, 329, 350, 356, 378, 383, 403, 409, 431, 436, 455, 461]
[2026-05-25 05:08:49] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6489 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 449
Applied a total of 2 rules in 29 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11579696770332282867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9425979046577390744.kers'
[2026-05-25 05:08:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11579696770332282867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9425979046577390744.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 449 rows 458 cols 3361 entries
Finished phase 1 with 259 SingleSign rule and 114 generalized
[2026-05-25 05:08:49] [INFO ] Computed 87 invariants in 5 ms
Computed 87 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9425979046577390744.kers
Total runtime 12 ms.
[2026-05-25 05:08:54] [INFO ] Implicit Places using invariants in 5655 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 270, 275, 295, 300, 321, 326, 347, 353, 375, 380, 400, 406, 428, 433, 452, 458]
[2026-05-25 05:08:54] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5659 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 448
Applied a total of 2 rules in 20 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15649492840354504655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4572605755346083603.kers'
[2026-05-25 05:08:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15649492840354504655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4572605755346083603.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 448 rows 455 cols 3292 entries
Finished phase 1 with 259 SingleSign rule and 113 generalized
[2026-05-25 05:08:54] [INFO ] Computed 85 invariants in 5 ms
Computed 85 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4572605755346083603.kers
Total runtime 7 ms.
[2026-05-25 05:08:59] [INFO ] Implicit Places using invariants in 4962 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 267, 272, 292, 297, 318, 323, 344, 350, 372, 377, 397, 403, 425, 430, 449, 455]
[2026-05-25 05:08:59] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4970 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 447
Applied a total of 2 rules in 24 ms. Remains 454 /455 variables (removed 1) and now considering 447/448 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14061079249927221632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12391759544236899870.kers'
[2026-05-25 05:08:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14061079249927221632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12391759544236899870.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 447 rows 452 cols 3228 entries
Finished phase 1 with 259 SingleSign rule and 112 generalized
[2026-05-25 05:08:59] [INFO ] Computed 83 invariants in 5 ms
Computed 83 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12391759544236899870.kers
Total runtime 6 ms.
[2026-05-25 05:09:04] [INFO ] Implicit Places using invariants in 4164 ms returned [181, 187, 206, 211, 234, 240, 264, 269, 289, 294, 315, 320, 341, 347, 369, 374, 394, 400, 422, 427, 446, 452]
[2026-05-25 05:09:04] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 26 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3425820775226420621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7876348236517983479.kers'
[2026-05-25 05:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3425820775226420621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7876348236517983479.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 446 rows 449 cols 3169 entries
Finished phase 1 with 259 SingleSign rule and 111 generalized
[2026-05-25 05:09:04] [INFO ] Computed 81 invariants in 6 ms
Computed 81 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7876348236517983479.kers
Total runtime 8 ms.
[2026-05-25 05:09:08] [INFO ] Implicit Places using invariants in 3892 ms returned [203, 208, 231, 237, 261, 266, 286, 291, 312, 317, 338, 344, 366, 371, 391, 397, 419, 424, 443, 449]
[2026-05-25 05:09:08] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3894 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10608567333374259884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9508477193159621929.kers'
[2026-05-25 05:09:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10608567333374259884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9508477193159621929.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 445 rows 446 cols 3115 entries
Finished phase 1 with 259 SingleSign rule and 110 generalized
[2026-05-25 05:09:08] [INFO ] Computed 79 invariants in 11 ms
Computed 79 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9508477193159621929.kers
Total runtime 12 ms.
[2026-05-25 05:09:11] [INFO ] Implicit Places using invariants in 3624 ms returned [228, 234, 258, 263, 283, 288, 309, 314, 335, 341, 363, 368, 388, 394, 416, 421, 440, 446]
[2026-05-25 05:09:11] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3635 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 22 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1579876176071930140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3500447462935415852.kers'
[2026-05-25 05:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1579876176071930140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3500447462935415852.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 444 rows 443 cols 3066 entries
Finished phase 1 with 259 SingleSign rule and 109 generalized
[2026-05-25 05:09:11] [INFO ] Computed 77 invariants in 5 ms
Computed 77 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3500447462935415852.kers
Total runtime 7 ms.
[2026-05-25 05:09:14] [INFO ] Implicit Places using invariants in 3270 ms returned [255, 260, 280, 285, 306, 311, 332, 338, 360, 365, 385, 391, 413, 418, 437, 443]
[2026-05-25 05:09:14] [INFO ] Actually due to overlaps returned [260, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3275 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 16 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9976418866134360373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10526323908551329517.kers'
[2026-05-25 05:09:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9976418866134360373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10526323908551329517.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 443 rows 440 cols 3022 entries
Finished phase 1 with 259 SingleSign rule and 108 generalized
[2026-05-25 05:09:15] [INFO ] Computed 75 invariants in 10 ms
Computed 75 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10526323908551329517.kers
Total runtime 13 ms.
[2026-05-25 05:09:17] [INFO ] Implicit Places using invariants in 2981 ms returned [277, 282, 303, 308, 329, 335, 357, 362, 382, 388, 410, 415, 434, 440]
[2026-05-25 05:09:18] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2996 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 30 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14262916269302772141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16462043420116043386.kers'
[2026-05-25 05:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14262916269302772141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16462043420116043386.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 442 rows 437 cols 2983 entries
Finished phase 1 with 258 SingleSign rule and 108 generalized
[2026-05-25 05:09:18] [INFO ] Computed 73 invariants in 6 ms
Computed 73 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16462043420116043386.kers
Total runtime 7 ms.
[2026-05-25 05:09:21] [INFO ] Implicit Places using invariants in 3005 ms returned [300, 305, 326, 332, 354, 359, 379, 385, 407, 412, 431, 437]
[2026-05-25 05:09:21] [INFO ] Actually due to overlaps returned [305, 300]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3007 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 19 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15855226105345640590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2149595966849230203.kers'
[2026-05-25 05:09:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15855226105345640590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2149595966849230203.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 441 rows 434 cols 2949 entries
Finished phase 1 with 258 SingleSign rule and 107 generalized
[2026-05-25 05:09:21] [INFO ] Computed 71 invariants in 9 ms
Computed 71 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-2149595966849230203.kers
Total runtime 11 ms.
[2026-05-25 05:09:23] [INFO ] Implicit Places using invariants in 2746 ms returned [323, 329, 351, 356, 376, 382, 404, 409, 428, 434]
[2026-05-25 05:09:23] [INFO ] Actually due to overlaps returned [329, 323]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2748 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 18 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1427308104561386752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16384341321718140522.kers'
[2026-05-25 05:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1427308104561386752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16384341321718140522.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 431 cols 2920 entries
Finished phase 1 with 258 SingleSign rule and 106 generalized
[2026-05-25 05:09:23] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16384341321718140522.kers
Total runtime 7 ms.
[2026-05-25 05:09:26] [INFO ] Implicit Places using invariants in 2474 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2026-05-25 05:09:26] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2476 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 19 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14889121966181236511.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11730434009671651663.kers'
[2026-05-25 05:09:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14889121966181236511.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11730434009671651663.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 439 rows 428 cols 2896 entries
Finished phase 1 with 258 SingleSign rule and 105 generalized
[2026-05-25 05:09:26] [INFO ] Computed 67 invariants in 5 ms
Computed 67 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11730434009671651663.kers
Total runtime 7 ms.
[2026-05-25 05:09:28] [INFO ] Implicit Places using invariants in 2451 ms returned [370, 376, 398, 403, 422, 428]
[2026-05-25 05:09:28] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2453 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 25 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12978139466280505665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16947734266408985873.kers'
[2026-05-25 05:09:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12978139466280505665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16947734266408985873.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 438 rows 425 cols 2877 entries
Finished phase 1 with 258 SingleSign rule and 104 generalized
[2026-05-25 05:09:28] [INFO ] Computed 65 invariants in 14 ms
Computed 65 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-16947734266408985873.kers
Total runtime 16 ms.
[2026-05-25 05:09:31] [INFO ] Implicit Places using invariants in 2340 ms returned [395, 400, 419, 425]
[2026-05-25 05:09:31] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 21 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3579337426908452229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15551874791199146455.kers'
[2026-05-25 05:09:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3579337426908452229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15551874791199146455.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 437 rows 422 cols 2863 entries
Finished phase 1 with 258 SingleSign rule and 103 generalized
[2026-05-25 05:09:31] [INFO ] Computed 63 invariants in 5 ms
Computed 63 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15551874791199146455.kers
Total runtime 6 ms.
[2026-05-25 05:09:33] [INFO ] Implicit Places using invariants in 2181 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/478 places, 437/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 436
Applied a total of 2 rules in 18 ms. Remains 421 /422 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10967734963836976187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17596295245925435560.kers'
[2026-05-25 05:09:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10967734963836976187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17596295245925435560.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 436 rows 419 cols 2854 entries
Finished phase 1 with 257 SingleSign rule and 103 generalized
[2026-05-25 05:09:33] [INFO ] Computed 61 invariants in 14 ms
Computed 61 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17596295245925435560.kers
Total runtime 15 ms.
[2026-05-25 05:09:35] [INFO ] Implicit Places using invariants in 2180 ms returned []
[2026-05-25 05:09:35] [INFO ] Invariant cache hit.
[2026-05-25 05:09:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:09:45] [INFO ] Implicit Places using invariants and state equation in 9811 ms returned []
Implicit Place search using SMT with State Equation took 11993 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/478 places, 436/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 113103 ms. Remains : 421/478 places, 436/455 transitions.
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 142814 ms.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 16 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5558323148215477668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14026908404919902024.kers'
[2026-05-25 05:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5558323148215477668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14026908404919902024.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 533 rows 554 cols 2058 entries
Finished phase 1 with 320 SingleSign rule and 137 generalized
[2026-05-25 05:09:45] [INFO ] Computed 99 invariants in 16 ms
Computed 99 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14026908404919902024.kers
Total runtime 17 ms.
[2026-05-25 05:09:45] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-25 05:09:45] [INFO ] Invariant cache hit.
[2026-05-25 05:09:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:09:54] [INFO ] Implicit Places using invariants and state equation in 8955 ms returned []
Implicit Place search using SMT with State Equation took 9240 ms to find 0 implicit places.
[2026-05-25 05:09:54] [INFO ] Redundant transitions in 39 ms returned []
Running 532 sub problems to find dead transitions.
[2026-05-25 05:09:54] [INFO ] Invariant cache hit.
[2026-05-25 05:09:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1089 variables, and 692 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 555/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 529/1221 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1089 variables, and 1221 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 555/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69419 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 65 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (5529 resets) in 236 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3248 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2026-05-25 05:10:55] [INFO ] Invariant cache hit.
[2026-05-25 05:10:55] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 360/363 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/494 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/500 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 523/1023 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 36/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1089 variables, and 682 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 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) 360/363 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/494 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/500 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 523/1023 variables, 500/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 36/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1023 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1089 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 3210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6688 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1660 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 555 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 478 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 237 place count 478 transition count 455
Applied a total of 237 rules in 33 ms. Remains 478 /556 variables (removed 78) and now considering 455/533 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 478/556 places, 455/533 transitions.
RANDOM walk for 40000 steps (5107 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3437 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 390518 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390518 steps, saw 195371 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7412543245219128476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5224217686901563104.kers'
[2026-05-25 05:11:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7412543245219128476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5224217686901563104.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 455 rows 476 cols 3885 entries
Finished phase 1 with 261 SingleSign rule and 118 generalized
[2026-05-25 05:11:08] [INFO ] Computed 99 invariants in 16 ms
Computed 99 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-5224217686901563104.kers
Total runtime 20 ms.
[2026-05-25 05:11:08] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/379 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/473 variables, 63/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 455/928 variables, 473/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 78/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/928 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/933 variables, 5/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 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) 376/379 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 94/473 variables, 63/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 26/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 455/928 variables, 473/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 78/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/933 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/933 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/933 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/933 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2026-05-25 05:11:23] [INFO ] Invariant cache hit.
[2026-05-25 05:11:36] [INFO ] Implicit Places using invariants in 12624 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 285, 290, 310, 315, 336, 341, 362, 368, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2026-05-25 05:11:36] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12629 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 475 transition count 454
Applied a total of 2 rules in 26 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13993207231166392703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3854136279617557038.kers'
[2026-05-25 05:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13993207231166392703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3854136279617557038.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 454 rows 473 cols 3782 entries
Finished phase 1 with 264 SingleSign rule and 114 generalized
[2026-05-25 05:11:36] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3854136279617557038.kers
Total runtime 7 ms.
[2026-05-25 05:11:47] [INFO ] Implicit Places using invariants in 11489 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 282, 287, 307, 312, 333, 338, 359, 365, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2026-05-25 05:11:47] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 453
Applied a total of 2 rules in 22 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6908912505337546535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10228893293105561690.kers'
[2026-05-25 05:11:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6908912505337546535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10228893293105561690.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 453 rows 470 cols 3687 entries
Finished phase 1 with 271 SingleSign rule and 106 generalized
[2026-05-25 05:11:47] [INFO ] Computed 95 invariants in 13 ms
Computed 95 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-10228893293105561690.kers
Total runtime 16 ms.
[2026-05-25 05:11:56] [INFO ] Implicit Places using invariants in 9123 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 282, 287, 307, 312, 333, 338, 359, 365, 387, 392, 412, 418, 440, 445, 464, 470]
[2026-05-25 05:11:56] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9126 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 452
Applied a total of 2 rules in 18 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15658167541090584868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17227491954422913643.kers'
[2026-05-25 05:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15658167541090584868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17227491954422913643.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 452 rows 467 cols 3598 entries
Finished phase 1 with 260 SingleSign rule and 116 generalized
[2026-05-25 05:11:56] [INFO ] Computed 93 invariants in 6 ms
Computed 93 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17227491954422913643.kers
Total runtime 9 ms.
[2026-05-25 05:12:05] [INFO ] Implicit Places using invariants in 8583 ms returned [65, 70, 91, 96, 116, 122, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 279, 284, 304, 309, 330, 335, 356, 362, 384, 389, 409, 415, 437, 442, 461, 467]
[2026-05-25 05:12:05] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8587 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 451
Applied a total of 2 rules in 25 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7710057355132269930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9520409290629521589.kers'
[2026-05-25 05:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7710057355132269930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9520409290629521589.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 451 rows 464 cols 3514 entries
Finished phase 1 with 259 SingleSign rule and 116 generalized
[2026-05-25 05:12:05] [INFO ] Computed 91 invariants in 13 ms
Computed 91 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-9520409290629521589.kers
Total runtime 16 ms.
[2026-05-25 05:12:13] [INFO ] Implicit Places using invariants in 7675 ms returned [88, 93, 113, 119, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 276, 281, 301, 306, 327, 332, 353, 359, 381, 386, 406, 412, 434, 439, 458, 464]
[2026-05-25 05:12:13] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 7679 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 450
Applied a total of 2 rules in 28 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12189493172034564966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13170707299813289569.kers'
[2026-05-25 05:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12189493172034564966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13170707299813289569.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 450 rows 461 cols 3435 entries
Finished phase 1 with 259 SingleSign rule and 115 generalized
[2026-05-25 05:12:13] [INFO ] Computed 89 invariants in 15 ms
Computed 89 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13170707299813289569.kers
Total runtime 16 ms.
[2026-05-25 05:12:19] [INFO ] Implicit Places using invariants in 6383 ms returned [110, 116, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 273, 278, 298, 303, 324, 329, 350, 356, 378, 383, 403, 409, 431, 436, 455, 461]
[2026-05-25 05:12:19] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6386 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 449
Applied a total of 2 rules in 24 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2526497734027884183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17884050674858124970.kers'
[2026-05-25 05:12:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2526497734027884183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17884050674858124970.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 449 rows 458 cols 3361 entries
Finished phase 1 with 259 SingleSign rule and 114 generalized
[2026-05-25 05:12:19] [INFO ] Computed 87 invariants in 12 ms
Computed 87 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-17884050674858124970.kers
Total runtime 15 ms.
[2026-05-25 05:12:25] [INFO ] Implicit Places using invariants in 5623 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 270, 275, 295, 300, 321, 326, 347, 353, 375, 380, 400, 406, 428, 433, 452, 458]
[2026-05-25 05:12:25] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5627 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 448
Applied a total of 2 rules in 20 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5197518799504129368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8376366709434099177.kers'
[2026-05-25 05:12:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5197518799504129368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8376366709434099177.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 448 rows 455 cols 3292 entries
Finished phase 1 with 259 SingleSign rule and 113 generalized
[2026-05-25 05:12:25] [INFO ] Computed 85 invariants in 13 ms
Computed 85 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8376366709434099177.kers
Total runtime 16 ms.
[2026-05-25 05:12:29] [INFO ] Implicit Places using invariants in 4850 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 267, 272, 292, 297, 318, 323, 344, 350, 372, 377, 397, 403, 425, 430, 449, 455]
[2026-05-25 05:12:30] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4853 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 447
Applied a total of 2 rules in 27 ms. Remains 454 /455 variables (removed 1) and now considering 447/448 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-442908353771973218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2520406402763090990.kers'
[2026-05-25 05:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-442908353771973218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2520406402763090990.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 447 rows 452 cols 3228 entries
Finished phase 1 with 259 SingleSign rule and 112 generalized
[2026-05-25 05:12:30] [INFO ] Computed 83 invariants in 5 ms
Computed 83 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2520406402763090990.kers
Total runtime 8 ms.
[2026-05-25 05:12:34] [INFO ] Implicit Places using invariants in 4230 ms returned [181, 187, 206, 211, 234, 240, 264, 269, 289, 294, 315, 320, 341, 347, 369, 374, 394, 400, 422, 427, 446, 452]
[2026-05-25 05:12:34] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4232 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 19 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17759443519725670465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11002079820233959630.kers'
[2026-05-25 05:12:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17759443519725670465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11002079820233959630.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 446 rows 449 cols 3169 entries
Finished phase 1 with 259 SingleSign rule and 111 generalized
[2026-05-25 05:12:34] [INFO ] Computed 81 invariants in 15 ms
Computed 81 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11002079820233959630.kers
Total runtime 16 ms.
[2026-05-25 05:12:38] [INFO ] Implicit Places using invariants in 3792 ms returned [203, 208, 231, 237, 261, 266, 286, 291, 312, 317, 338, 344, 366, 371, 391, 397, 419, 424, 443, 449]
[2026-05-25 05:12:38] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3796 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 27 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5185200663571879977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1580574120184976926.kers'
[2026-05-25 05:12:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5185200663571879977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1580574120184976926.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 445 rows 446 cols 3115 entries
Finished phase 1 with 259 SingleSign rule and 110 generalized
[2026-05-25 05:12:38] [INFO ] Computed 79 invariants in 13 ms
Computed 79 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1580574120184976926.kers
Total runtime 15 ms.
[2026-05-25 05:12:41] [INFO ] Implicit Places using invariants in 3684 ms returned [228, 234, 258, 263, 283, 288, 309, 314, 335, 341, 363, 368, 388, 394, 416, 421, 440, 446]
[2026-05-25 05:12:41] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3686 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 24 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10714487898919367338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3323621146432452591.kers'
[2026-05-25 05:12:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10714487898919367338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3323621146432452591.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 444 rows 443 cols 3066 entries
Finished phase 1 with 259 SingleSign rule and 109 generalized
[2026-05-25 05:12:41] [INFO ] Computed 77 invariants in 11 ms
Computed 77 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3323621146432452591.kers
Total runtime 13 ms.
[2026-05-25 05:12:45] [INFO ] Implicit Places using invariants in 3260 ms returned [255, 260, 280, 285, 306, 311, 332, 338, 360, 365, 385, 391, 413, 418, 437, 443]
[2026-05-25 05:12:45] [INFO ] Actually due to overlaps returned [260, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3261 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 19 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5152114132556885320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14947986377510659763.kers'
[2026-05-25 05:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5152114132556885320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14947986377510659763.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 443 rows 440 cols 3022 entries
Finished phase 1 with 259 SingleSign rule and 108 generalized
[2026-05-25 05:12:45] [INFO ] Computed 75 invariants in 13 ms
Computed 75 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14947986377510659763.kers
Total runtime 14 ms.
[2026-05-25 05:12:48] [INFO ] Implicit Places using invariants in 3006 ms returned [277, 282, 303, 308, 329, 335, 357, 362, 382, 388, 410, 415, 434, 440]
[2026-05-25 05:12:48] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3009 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 17 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17318970715806089165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18337550370600107260.kers'
[2026-05-25 05:12:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17318970715806089165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18337550370600107260.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 442 rows 437 cols 2983 entries
Finished phase 1 with 258 SingleSign rule and 108 generalized
[2026-05-25 05:12:48] [INFO ] Computed 73 invariants in 5 ms
Computed 73 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18337550370600107260.kers
Total runtime 6 ms.
[2026-05-25 05:12:51] [INFO ] Implicit Places using invariants in 2947 ms returned [300, 305, 326, 332, 354, 359, 379, 385, 407, 412, 431, 437]
[2026-05-25 05:12:51] [INFO ] Actually due to overlaps returned [305, 300]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2949 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 19 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2743485702673612780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10395498616477855871.kers'
[2026-05-25 05:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2743485702673612780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10395498616477855871.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 441 rows 434 cols 2949 entries
Finished phase 1 with 258 SingleSign rule and 107 generalized
[2026-05-25 05:12:51] [INFO ] Computed 71 invariants in 5 ms
Computed 71 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10395498616477855871.kers
Total runtime 7 ms.
[2026-05-25 05:12:53] [INFO ] Implicit Places using invariants in 2757 ms returned [323, 329, 351, 356, 376, 382, 404, 409, 428, 434]
[2026-05-25 05:12:53] [INFO ] Actually due to overlaps returned [329, 323]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2759 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 18 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12049533958282727970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7161387214700257284.kers'
[2026-05-25 05:12:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12049533958282727970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7161387214700257284.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 431 cols 2920 entries
Finished phase 1 with 258 SingleSign rule and 106 generalized
[2026-05-25 05:12:53] [INFO ] Computed 69 invariants in 7 ms
Computed 69 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7161387214700257284.kers
Total runtime 9 ms.
[2026-05-25 05:12:56] [INFO ] Implicit Places using invariants in 2460 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2026-05-25 05:12:56] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 23 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10575664389369641681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9179206875145313541.kers'
[2026-05-25 05:12:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10575664389369641681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9179206875145313541.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 439 rows 428 cols 2896 entries
Finished phase 1 with 258 SingleSign rule and 105 generalized
[2026-05-25 05:12:56] [INFO ] Computed 67 invariants in 9 ms
Computed 67 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9179206875145313541.kers
Total runtime 11 ms.
[2026-05-25 05:12:58] [INFO ] Implicit Places using invariants in 2460 ms returned [370, 376, 398, 403, 422, 428]
[2026-05-25 05:12:58] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 23 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11344359954388819796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9885052994061208798.kers'
[2026-05-25 05:12:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11344359954388819796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9885052994061208798.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 438 rows 425 cols 2877 entries
Finished phase 1 with 258 SingleSign rule and 104 generalized
[2026-05-25 05:12:58] [INFO ] Computed 65 invariants in 5 ms
Computed 65 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9885052994061208798.kers
Total runtime 6 ms.
[2026-05-25 05:13:01] [INFO ] Implicit Places using invariants in 2358 ms returned [395, 400, 419, 425]
[2026-05-25 05:13:01] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2360 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 22 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5544124592917204218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6304551099120003641.kers'
[2026-05-25 05:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5544124592917204218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6304551099120003641.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 437 rows 422 cols 2863 entries
Finished phase 1 with 258 SingleSign rule and 103 generalized
[2026-05-25 05:13:01] [INFO ] Computed 63 invariants in 5 ms
Computed 63 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6304551099120003641.kers
Total runtime 7 ms.
[2026-05-25 05:13:03] [INFO ] Implicit Places using invariants in 2155 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/478 places, 437/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 436
Applied a total of 2 rules in 17 ms. Remains 421 /422 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-187743289220730783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8167433979395485285.kers'
[2026-05-25 05:13:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-187743289220730783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8167433979395485285.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 436 rows 419 cols 2854 entries
Finished phase 1 with 257 SingleSign rule and 103 generalized
[2026-05-25 05:13:03] [INFO ] Computed 61 invariants in 5 ms
Computed 61 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8167433979395485285.kers
Total runtime 6 ms.
[2026-05-25 05:13:05] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2026-05-25 05:13:05] [INFO ] Invariant cache hit.
[2026-05-25 05:13:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:13:15] [INFO ] Implicit Places using invariants and state equation in 9868 ms returned []
Implicit Place search using SMT with State Equation took 12031 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/478 places, 436/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 111975 ms. Remains : 421/478 places, 436/455 transitions.
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 140565 ms.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13857 reset in 178 ms.
Product exploration explored 100000 steps with 13884 reset in 141 ms.
Built C files in :
/tmp/ltsmin9401938570397881208
[2026-05-25 05:13:16] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2026-05-25 05:13:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:16] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2026-05-25 05:13:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:16] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2026-05-25 05:13:16] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:16] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9401938570397881208
Running compilation step : cd /tmp/ltsmin9401938570397881208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1441 ms.
Running link step : cd /tmp/ltsmin9401938570397881208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9401938570397881208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2241419587619002660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 9 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15741533204224496698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9272403130746936017.kers'
[2026-05-25 05:13:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15741533204224496698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9272403130746936017.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 533 rows 554 cols 2058 entries
Finished phase 1 with 320 SingleSign rule and 137 generalized
[2026-05-25 05:13:31] [INFO ] Computed 99 invariants in 16 ms
Computed 99 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-9272403130746936017.kers
Total runtime 17 ms.
[2026-05-25 05:13:31] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-25 05:13:31] [INFO ] Invariant cache hit.
[2026-05-25 05:13:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:13:40] [INFO ] Implicit Places using invariants and state equation in 9088 ms returned []
Implicit Place search using SMT with State Equation took 9374 ms to find 0 implicit places.
[2026-05-25 05:13:40] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9399 ms. Remains : 556/556 places, 533/533 transitions.
Built C files in :
/tmp/ltsmin4786438144052831582
[2026-05-25 05:13:40] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2026-05-25 05:13:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:40] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2026-05-25 05:13:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:40] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2026-05-25 05:13:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:13:40] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4786438144052831582
Running compilation step : cd /tmp/ltsmin4786438144052831582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1333 ms.
Running link step : cd /tmp/ltsmin4786438144052831582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4786438144052831582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13282363728346513451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 05:13:55] [INFO ] Flatten gal took : 24 ms
[2026-05-25 05:13:55] [INFO ] Flatten gal took : 25 ms
[2026-05-25 05:13:55] [INFO ] Time to serialize gal into /tmp/LTL6604909486350706471.gal : 6 ms
[2026-05-25 05:13:55] [INFO ] Time to serialize properties into /tmp/LTL12872677000746048158.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/LTL6604909486350706471.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18300670298106266458.hoa' '-atoms' '/tmp/LTL12872677000746048158.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/LTL12872677000746048158.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18300670298106266458.hoa
Detected timeout of ITS tools.
[2026-05-25 05:14:10] [INFO ] Flatten gal took : 39 ms
[2026-05-25 05:14:10] [INFO ] Flatten gal took : 23 ms
[2026-05-25 05:14:10] [INFO ] Time to serialize gal into /tmp/LTL11976651289812647253.gal : 14 ms
[2026-05-25 05:14:10] [INFO ] Time to serialize properties into /tmp/LTL7602220527645123725.ltl : 2 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/LTL11976651289812647253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7602220527645123725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p80<1)")U((G("(p80<1)"))||("((p80<1)&&(!((p339>=1)||(p597>=1))))"))))))
Formula 0 simplified : FG(!"(p80<1)" M !"((p80<1)&&(!((p339>=1)||(p597>=1))))")
Detected timeout of ITS tools.
[2026-05-25 05:14:25] [INFO ] Flatten gal took : 21 ms
[2026-05-25 05:14:25] [INFO ] Applying decomposition
[2026-05-25 05:14:25] [INFO ] Flatten gal took : 25 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/graph11102571816399071639.txt' '-o' '/tmp/graph11102571816399071639.bin' '-w' '/tmp/graph11102571816399071639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11102571816399071639.bin' '-l' '-1' '-v' '-w' '/tmp/graph11102571816399071639.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:14:26] [INFO ] Decomposing Gal with order
[2026-05-25 05:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:14:26] [INFO ] Removed a total of 389 redundant transitions.
[2026-05-25 05:14:26] [INFO ] Flatten gal took : 112 ms
[2026-05-25 05:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 25 ms.
[2026-05-25 05:14:26] [INFO ] Time to serialize gal into /tmp/LTL4590669374709554054.gal : 12 ms
[2026-05-25 05:14:26] [INFO ] Time to serialize properties into /tmp/LTL13382224081692252087.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/LTL4590669374709554054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13382224081692252087.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i2.i4.u154.p80<1)")U((G("(i2.i4.u154.p80<1)"))||("((i2.i4.u154.p80<1)&&(!((i4.i0.u55.p339>=1)||(i6.i1.u110.p597>=1))))")))))...156
Formula 0 simplified : FG(!"(i2.i4.u154.p80<1)" M !"((i2.i4.u154.p80<1)&&(!((i4.i0.u55.p339>=1)||(i6.i1.u110.p597>=1))))")
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 448942 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)))'
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1056 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 479 place count 817 transition count 715
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 561 place count 776 transition count 715
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 923 place count 595 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 999 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1000 place count 556 transition count 533
Applied a total of 1000 rules in 73 ms. Remains 556 /1058 variables (removed 502) and now considering 533/997 (removed 464) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7547522611430894969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4177051604110407828.kers'
[2026-05-25 05:14:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7547522611430894969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4177051604110407828.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 533 rows 554 cols 2071 entries
Finished phase 1 with 322 SingleSign rule and 134 generalized
[2026-05-25 05:14:41] [INFO ] Computed 100 invariants in 8 ms
Computed 100 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4177051604110407828.kers
Total runtime 9 ms.
[2026-05-25 05:14:41] [INFO ] Implicit Places using invariants in 276 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1058 places, 533/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 553 transition count 531
Applied a total of 4 rules in 15 ms. Remains 553 /555 variables (removed 2) and now considering 531/533 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7540747995255243880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8296755023964753692.kers'
[2026-05-25 05:14:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7540747995255243880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8296755023964753692.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 531 rows 551 cols 2063 entries
Finished phase 1 with 317 SingleSign rule and 137 generalized
[2026-05-25 05:14:41] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8296755023964753692.kers
Total runtime 8 ms.
[2026-05-25 05:14:42] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-25 05:14:42] [INFO ] Invariant cache hit.
[2026-05-25 05:14:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:15:11] [INFO ] Implicit Places using invariants and state equation in 29263 ms returned []
Implicit Place search using SMT with State Equation took 29524 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1058 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29893 ms. Remains : 553/1058 places, 531/997 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)))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04
Product exploration explored 100000 steps with 13833 reset in 187 ms.
Product exploration explored 100000 steps with 13802 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5547 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3273 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3471 steps, run visited all 1 properties in 29 ms. (steps per millisecond=119 )
Probabilistic random walk after 3471 steps, saw 1761 distinct states, run finished after 32 ms. (steps per millisecond=108 ) properties seen :1
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 298 ms.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 14 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2026-05-25 05:15:12] [INFO ] Invariant cache hit.
[2026-05-25 05:15:12] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-25 05:15:12] [INFO ] Invariant cache hit.
[2026-05-25 05:15:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:15:41] [INFO ] Implicit Places using invariants and state equation in 29226 ms returned []
Implicit Place search using SMT with State Equation took 29476 ms to find 0 implicit places.
[2026-05-25 05:15:41] [INFO ] Redundant transitions in 6 ms returned []
Running 530 sub problems to find dead transitions.
[2026-05-25 05:15:41] [INFO ] Invariant cache hit.
[2026-05-25 05:15:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89666 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5501 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3264 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3471 steps, run visited all 1 properties in 29 ms. (steps per millisecond=119 )
Probabilistic random walk after 3471 steps, saw 1761 distinct states, run finished after 29 ms. (steps per millisecond=119 ) properties seen :1
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 279 ms.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13928 reset in 98 ms.
Product exploration explored 100000 steps with 13886 reset in 109 ms.
Built C files in :
/tmp/ltsmin11352745005024694316
[2026-05-25 05:16:42] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2026-05-25 05:16:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:16:42] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2026-05-25 05:16:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:16:42] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2026-05-25 05:16:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:16:42] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11352745005024694316
Running compilation step : cd /tmp/ltsmin11352745005024694316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1294 ms.
Running link step : cd /tmp/ltsmin11352745005024694316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11352745005024694316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14726657800840722987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 19 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2026-05-25 05:16:57] [INFO ] Invariant cache hit.
[2026-05-25 05:16:57] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 05:16:57] [INFO ] Invariant cache hit.
[2026-05-25 05:16:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:17:26] [INFO ] Implicit Places using invariants and state equation in 28988 ms returned []
Implicit Place search using SMT with State Equation took 29247 ms to find 0 implicit places.
[2026-05-25 05:17:26] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29278 ms. Remains : 553/553 places, 531/531 transitions.
Built C files in :
/tmp/ltsmin160733347882154861
[2026-05-25 05:17:26] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2026-05-25 05:17:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:17:26] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2026-05-25 05:17:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:17:26] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2026-05-25 05:17:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:17:26] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin160733347882154861
Running compilation step : cd /tmp/ltsmin160733347882154861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1289 ms.
Running link step : cd /tmp/ltsmin160733347882154861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin160733347882154861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1402889608893275519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 05:17:41] [INFO ] Flatten gal took : 17 ms
[2026-05-25 05:17:41] [INFO ] Flatten gal took : 14 ms
[2026-05-25 05:17:41] [INFO ] Time to serialize gal into /tmp/LTL12695084817154700550.gal : 5 ms
[2026-05-25 05:17:41] [INFO ] Time to serialize properties into /tmp/LTL10321694735193399254.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/LTL12695084817154700550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8389943426217826672.hoa' '-atoms' '/tmp/LTL10321694735193399254.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/LTL10321694735193399254.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8389943426217826672.hoa
Detected timeout of ITS tools.
[2026-05-25 05:17:56] [INFO ] Flatten gal took : 12 ms
[2026-05-25 05:17:56] [INFO ] Flatten gal took : 11 ms
[2026-05-25 05:17:56] [INFO ] Time to serialize gal into /tmp/LTL759239650725478675.gal : 4 ms
[2026-05-25 05:17:56] [INFO ] Time to serialize properties into /tmp/LTL2404950900954608236.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/LTL759239650725478675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2404950900954608236.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 : !((G(F("((p110<1)||(p134<1))"))))
Formula 0 simplified : FG!"((p110<1)||(p134<1))"
Detected timeout of ITS tools.
[2026-05-25 05:18:11] [INFO ] Flatten gal took : 17 ms
[2026-05-25 05:18:11] [INFO ] Applying decomposition
[2026-05-25 05:18:11] [INFO ] Flatten gal took : 12 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/graph6006263775927159396.txt' '-o' '/tmp/graph6006263775927159396.bin' '-w' '/tmp/graph6006263775927159396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6006263775927159396.bin' '-l' '-1' '-v' '-w' '/tmp/graph6006263775927159396.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:18:12] [INFO ] Decomposing Gal with order
[2026-05-25 05:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:18:12] [INFO ] Removed a total of 406 redundant transitions.
[2026-05-25 05:18:12] [INFO ] Flatten gal took : 36 ms
[2026-05-25 05:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 11 ms.
[2026-05-25 05:18:12] [INFO ] Time to serialize gal into /tmp/LTL2474040969230917018.gal : 8 ms
[2026-05-25 05:18:12] [INFO ] Time to serialize properties into /tmp/LTL5146210265759077487.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/LTL2474040969230917018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5146210265759077487.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u13.p110<1)||(i1.u13.p134<1))"))))
Formula 0 simplified : FG!"((i1.u13.p110<1)||(i1.u13.p134<1))"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 225744 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))&&F(((p1&&X(p2))||G(p2))))))'
Support contains 4 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15050425961483515015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7041893813572655342.kers'
[2026-05-25 05:18:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15050425961483515015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7041893813572655342.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 997 rows 1058 cols 2805 entries
Finished phase 1 with 895 SingleSign rule and 63 generalized
[2026-05-25 05:18:27] [INFO ] Computed 100 invariants in 125 ms
Computed 100 P flows in 126 ms.
Exported basis to /tmp/petrispot-output-7041893813572655342.kers
Total runtime 130 ms.
[2026-05-25 05:18:27] [INFO ] Implicit Places using invariants in 506 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 571 ms. Remains : 1057/1058 places, 997/997 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))&&F(((p1&&X(p2))||G(p2))))))'
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 31 steps with 3 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-05 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(G((p1||X(p2)))))))))'
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:18:27] [INFO ] Invariant cache hit.
[2026-05-25 05:18:28] [INFO ] Implicit Places using invariants in 371 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 372 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 436 ms. Remains : 1057/1058 places, 997/997 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(G((p1||X(p2)))))))))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-06
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-06 finished in 704 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))'
Support contains 1 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1056 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 479 place count 817 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 559 place count 777 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 925 place count 594 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1001 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 555 transition count 532
Applied a total of 1002 rules in 67 ms. Remains 555 /1058 variables (removed 503) and now considering 532/997 (removed 465) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1885294916588370375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8147709235652845455.kers'
[2026-05-25 05:18:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1885294916588370375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8147709235652845455.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 532 rows 553 cols 2072 entries
Finished phase 1 with 321 SingleSign rule and 134 generalized
[2026-05-25 05:18:28] [INFO ] Computed 100 invariants in 18 ms
Computed 100 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-8147709235652845455.kers
Total runtime 22 ms.
[2026-05-25 05:18:29] [INFO ] Implicit Places using invariants in 293 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1058 places, 532/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 530
Applied a total of 4 rules in 20 ms. Remains 552 /554 variables (removed 2) and now considering 530/532 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-700842081907966598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8303736895964208074.kers'
[2026-05-25 05:18:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-700842081907966598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8303736895964208074.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 316 SingleSign rule and 137 generalized
[2026-05-25 05:18:29] [INFO ] Computed 99 invariants in 11 ms
Computed 99 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8303736895964208074.kers
Total runtime 13 ms.
[2026-05-25 05:18:29] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-25 05:18:29] [INFO ] Invariant cache hit.
[2026-05-25 05:18:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:18:37] [INFO ] Implicit Places using invariants and state equation in 7789 ms returned []
Implicit Place search using SMT with State Equation took 8095 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1058 places, 530/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8477 ms. Remains : 552/1058 places, 530/997 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))'
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 13943 reset in 109 ms.
Product exploration explored 100000 steps with 13964 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5520 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3267 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 358364 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 358364 steps, saw 179235 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-25 05:18:40] [INFO ] Invariant cache hit.
[2026-05-25 05:18:40] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 167/489 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1016 variables, 496/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1016 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1082 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 547/552 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 167/489 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1016 variables, 496/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1016 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1082 variables, and 681 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 547/552 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2748ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Graph (complete) has 1661 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 551 transition count 529
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 551 transition count 452
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 474 transition count 452
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 235 place count 474 transition count 452
Applied a total of 235 rules in 40 ms. Remains 474 /552 variables (removed 78) and now considering 452/530 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 474/552 places, 452/530 transitions.
RANDOM walk for 40000 steps (5148 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3357 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 395056 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 395056 steps, saw 197655 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9306503257967814474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4017880554672591963.kers'
[2026-05-25 05:18:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9306503257967814474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4017880554672591963.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 452 rows 472 cols 3883 entries
Finished phase 1 with 254 SingleSign rule and 121 generalized
[2026-05-25 05:18:46] [INFO ] Computed 99 invariants in 18 ms
Computed 99 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-4017880554672591963.kers
Total runtime 22 ms.
[2026-05-25 05:18:46] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/463 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/469 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 452/921 variables, 469/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 78/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/926 variables, 5/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/926 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 926/926 variables, and 652 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 474/474 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/463 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/469 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 452/921 variables, 469/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 78/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/926 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/926 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/926 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/926 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 926/926 variables, and 656 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 474/474 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 474/474 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2026-05-25 05:19:20] [INFO ] Invariant cache hit.
[2026-05-25 05:19:32] [INFO ] Implicit Places using invariants in 12097 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2026-05-25 05:19:32] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12103 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/474 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 451
Applied a total of 2 rules in 27 ms. Remains 471 /472 variables (removed 1) and now considering 451/452 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3550489840057172591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2325602625412817833.kers'
[2026-05-25 05:19:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3550489840057172591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2325602625412817833.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 451 rows 469 cols 3780 entries
Finished phase 1 with 257 SingleSign rule and 117 generalized
[2026-05-25 05:19:32] [INFO ] Computed 97 invariants in 13 ms
Computed 97 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2325602625412817833.kers
Total runtime 17 ms.
[2026-05-25 05:19:43] [INFO ] Implicit Places using invariants in 10271 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2026-05-25 05:19:43] [INFO ] Actually due to overlaps returned [446, 385]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10277 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 469/474 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 450
Applied a total of 2 rules in 25 ms. Remains 468 /469 variables (removed 1) and now considering 450/451 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12295901406435647167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10638168493813721258.kers'
[2026-05-25 05:19:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12295901406435647167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10638168493813721258.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 450 rows 466 cols 3685 entries
Finished phase 1 with 267 SingleSign rule and 106 generalized
[2026-05-25 05:19:43] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10638168493813721258.kers
Total runtime 9 ms.
[2026-05-25 05:19:51] [INFO ] Implicit Places using invariants in 8130 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 383, 388, 408, 414, 436, 441, 460, 466]
[2026-05-25 05:19:51] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8132 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 466/474 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 449
Applied a total of 2 rules in 17 ms. Remains 465 /466 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15931647556541525002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6100949490227171989.kers'
[2026-05-25 05:19:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15931647556541525002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6100949490227171989.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 449 rows 463 cols 3596 entries
Finished phase 1 with 256 SingleSign rule and 116 generalized
[2026-05-25 05:19:51] [INFO ] Computed 93 invariants in 6 ms
Computed 93 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6100949490227171989.kers
Total runtime 8 ms.
[2026-05-25 05:19:59] [INFO ] Implicit Places using invariants in 8100 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 358, 380, 385, 405, 411, 433, 438, 457, 463]
[2026-05-25 05:19:59] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8102 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 463/474 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 448
Applied a total of 2 rules in 27 ms. Remains 462 /463 variables (removed 1) and now considering 448/449 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6822864239782345770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7191727480049023129.kers'
[2026-05-25 05:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6822864239782345770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7191727480049023129.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 448 rows 460 cols 3512 entries
Finished phase 1 with 255 SingleSign rule and 116 generalized
[2026-05-25 05:19:59] [INFO ] Computed 91 invariants in 6 ms
Computed 91 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7191727480049023129.kers
Total runtime 8 ms.
[2026-05-25 05:20:06] [INFO ] Implicit Places using invariants in 6584 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 377, 382, 402, 408, 430, 435, 454, 460]
[2026-05-25 05:20:06] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6586 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 460/474 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 447
Applied a total of 2 rules in 26 ms. Remains 459 /460 variables (removed 1) and now considering 447/448 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4878088025242962899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2904341229343310458.kers'
[2026-05-25 05:20:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4878088025242962899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2904341229343310458.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 447 rows 457 cols 3433 entries
Finished phase 1 with 255 SingleSign rule and 115 generalized
[2026-05-25 05:20:06] [INFO ] Computed 89 invariants in 15 ms
Computed 89 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2904341229343310458.kers
Total runtime 17 ms.
[2026-05-25 05:20:12] [INFO ] Implicit Places using invariants in 6301 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 374, 379, 399, 405, 427, 432, 451, 457]
[2026-05-25 05:20:12] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6304 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 457/474 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 446
Applied a total of 2 rules in 18 ms. Remains 456 /457 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1137714116909714144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16716913271883325370.kers'
[2026-05-25 05:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1137714116909714144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16716913271883325370.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 446 rows 454 cols 3359 entries
Finished phase 1 with 255 SingleSign rule and 114 generalized
[2026-05-25 05:20:12] [INFO ] Computed 87 invariants in 10 ms
Computed 87 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16716913271883325370.kers
Total runtime 12 ms.
[2026-05-25 05:20:18] [INFO ] Implicit Places using invariants in 5590 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 371, 376, 396, 402, 424, 429, 448, 454]
[2026-05-25 05:20:18] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5592 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 454/474 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 445
Applied a total of 2 rules in 19 ms. Remains 453 /454 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2866789313970661538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14970263592178362160.kers'
[2026-05-25 05:20:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2866789313970661538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14970263592178362160.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 445 rows 451 cols 3290 entries
Finished phase 1 with 255 SingleSign rule and 113 generalized
[2026-05-25 05:20:18] [INFO ] Computed 85 invariants in 10 ms
Computed 85 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-14970263592178362160.kers
Total runtime 13 ms.
[2026-05-25 05:20:22] [INFO ] Implicit Places using invariants in 4821 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 368, 373, 393, 399, 421, 426, 445, 451]
[2026-05-25 05:20:22] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4825 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 451/474 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 444
Applied a total of 2 rules in 27 ms. Remains 450 /451 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1209949444468503762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17759514355820604750.kers'
[2026-05-25 05:20:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1209949444468503762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17759514355820604750.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 444 rows 448 cols 3226 entries
Finished phase 1 with 255 SingleSign rule and 112 generalized
[2026-05-25 05:20:22] [INFO ] Computed 83 invariants in 6 ms
Computed 83 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17759514355820604750.kers
Total runtime 8 ms.
[2026-05-25 05:20:27] [INFO ] Implicit Places using invariants in 4346 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 365, 370, 390, 396, 418, 423, 442, 448]
[2026-05-25 05:20:27] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4348 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 448/474 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 443
Applied a total of 2 rules in 18 ms. Remains 447 /448 variables (removed 1) and now considering 443/444 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3933883801816377375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5712311919166817937.kers'
[2026-05-25 05:20:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3933883801816377375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5712311919166817937.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 443 rows 445 cols 3167 entries
Finished phase 1 with 255 SingleSign rule and 111 generalized
[2026-05-25 05:20:27] [INFO ] Computed 81 invariants in 5 ms
Computed 81 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5712311919166817937.kers
Total runtime 8 ms.
[2026-05-25 05:20:31] [INFO ] Implicit Places using invariants in 3925 ms returned [201, 206, 229, 235, 257, 262, 282, 287, 308, 313, 334, 340, 362, 367, 387, 393, 415, 420, 439, 445]
[2026-05-25 05:20:31] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3928 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 445/474 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 442
Applied a total of 2 rules in 19 ms. Remains 444 /445 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3542701054361916951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12536129128461570860.kers'
[2026-05-25 05:20:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3542701054361916951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12536129128461570860.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 442 rows 442 cols 3113 entries
Finished phase 1 with 255 SingleSign rule and 110 generalized
[2026-05-25 05:20:31] [INFO ] Computed 79 invariants in 16 ms
Computed 79 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12536129128461570860.kers
Total runtime 18 ms.
[2026-05-25 05:20:34] [INFO ] Implicit Places using invariants in 3502 ms returned [226, 232, 254, 259, 279, 284, 305, 310, 331, 337, 359, 364, 384, 390, 412, 417, 436, 442]
[2026-05-25 05:20:34] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3504 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 442/474 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 441
Applied a total of 2 rules in 19 ms. Remains 441 /442 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5126715653191034505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8339085296561485189.kers'
[2026-05-25 05:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5126715653191034505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8339085296561485189.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 441 rows 439 cols 3064 entries
Finished phase 1 with 255 SingleSign rule and 109 generalized
[2026-05-25 05:20:34] [INFO ] Computed 77 invariants in 6 ms
Computed 77 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8339085296561485189.kers
Total runtime 8 ms.
[2026-05-25 05:20:38] [INFO ] Implicit Places using invariants in 3372 ms returned [251, 256, 276, 281, 302, 307, 328, 334, 356, 361, 381, 387, 409, 414, 433, 439]
[2026-05-25 05:20:38] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3375 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 439/474 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 440
Applied a total of 2 rules in 19 ms. Remains 438 /439 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10511514528958922361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1881410053260190909.kers'
[2026-05-25 05:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10511514528958922361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1881410053260190909.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 436 cols 3020 entries
Finished phase 1 with 255 SingleSign rule and 108 generalized
[2026-05-25 05:20:38] [INFO ] Computed 75 invariants in 6 ms
Computed 75 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1881410053260190909.kers
Total runtime 8 ms.
[2026-05-25 05:20:41] [INFO ] Implicit Places using invariants in 3084 ms returned [273, 278, 299, 304, 325, 331, 353, 358, 378, 384, 406, 411, 430, 436]
[2026-05-25 05:20:41] [INFO ] Actually due to overlaps returned [278, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3089 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 436/474 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 439
Applied a total of 2 rules in 20 ms. Remains 435 /436 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2769028621246834976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11775207965570151021.kers'
[2026-05-25 05:20:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2769028621246834976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11775207965570151021.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 439 rows 433 cols 2981 entries
Finished phase 1 with 255 SingleSign rule and 107 generalized
[2026-05-25 05:20:41] [INFO ] Computed 73 invariants in 16 ms
Computed 73 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11775207965570151021.kers
Total runtime 17 ms.
[2026-05-25 05:20:43] [INFO ] Implicit Places using invariants in 2635 ms returned [296, 301, 322, 328, 350, 355, 375, 381, 403, 408, 427, 433]
[2026-05-25 05:20:43] [INFO ] Actually due to overlaps returned [301, 296]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2637 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 433/474 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 438
Applied a total of 2 rules in 18 ms. Remains 432 /433 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3348149425432826307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13664782050898040658.kers'
[2026-05-25 05:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3348149425432826307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13664782050898040658.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 438 rows 430 cols 2947 entries
Finished phase 1 with 255 SingleSign rule and 106 generalized
[2026-05-25 05:20:43] [INFO ] Computed 71 invariants in 9 ms
Computed 71 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13664782050898040658.kers
Total runtime 12 ms.
[2026-05-25 05:20:46] [INFO ] Implicit Places using invariants in 2454 ms returned [319, 325, 347, 352, 372, 378, 400, 405, 424, 430]
[2026-05-25 05:20:46] [INFO ] Actually due to overlaps returned [325, 319]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2456 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 430/474 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 437
Applied a total of 2 rules in 17 ms. Remains 429 /430 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1564871291144107296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14375915995447635165.kers'
[2026-05-25 05:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1564871291144107296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14375915995447635165.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 437 rows 427 cols 2918 entries
Finished phase 1 with 254 SingleSign rule and 106 generalized
[2026-05-25 05:20:46] [INFO ] Computed 69 invariants in 10 ms
Computed 69 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-14375915995447635165.kers
Total runtime 14 ms.
[2026-05-25 05:20:48] [INFO ] Implicit Places using invariants in 2544 ms returned [344, 349, 369, 375, 397, 402, 421, 427]
[2026-05-25 05:20:48] [INFO ] Actually due to overlaps returned [349, 344]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2546 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 427/474 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 436
Applied a total of 2 rules in 22 ms. Remains 426 /427 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7654123498937800896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13314040475447856323.kers'
[2026-05-25 05:20:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7654123498937800896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13314040475447856323.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 436 rows 424 cols 2894 entries
Finished phase 1 with 254 SingleSign rule and 105 generalized
[2026-05-25 05:20:48] [INFO ] Computed 67 invariants in 15 ms
Computed 67 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13314040475447856323.kers
Total runtime 17 ms.
[2026-05-25 05:20:51] [INFO ] Implicit Places using invariants in 2381 ms returned [366, 372, 394, 399, 418, 424]
[2026-05-25 05:20:51] [INFO ] Actually due to overlaps returned [372, 366]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2388 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 424/474 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 435
Applied a total of 2 rules in 22 ms. Remains 423 /424 variables (removed 1) and now considering 435/436 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14703911263314465776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1572416840293972245.kers'
[2026-05-25 05:20:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14703911263314465776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1572416840293972245.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 435 rows 421 cols 2875 entries
Finished phase 1 with 254 SingleSign rule and 104 generalized
[2026-05-25 05:20:51] [INFO ] Computed 65 invariants in 14 ms
Computed 65 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1572416840293972245.kers
Total runtime 17 ms.
[2026-05-25 05:20:53] [INFO ] Implicit Places using invariants in 2257 ms returned [391, 396, 415, 421]
[2026-05-25 05:20:53] [INFO ] Actually due to overlaps returned [396, 391]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2260 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 421/474 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 434
Applied a total of 2 rules in 26 ms. Remains 420 /421 variables (removed 1) and now considering 434/435 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17330990766372134317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2400955323208126993.kers'
[2026-05-25 05:20:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17330990766372134317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2400955323208126993.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 434 rows 418 cols 2861 entries
Finished phase 1 with 254 SingleSign rule and 103 generalized
[2026-05-25 05:20:53] [INFO ] Computed 63 invariants in 10 ms
Computed 63 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2400955323208126993.kers
Total runtime 12 ms.
[2026-05-25 05:20:55] [INFO ] Implicit Places using invariants in 2283 ms returned [412, 418]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2285 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 418/474 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 417 transition count 433
Applied a total of 2 rules in 23 ms. Remains 417 /418 variables (removed 1) and now considering 433/434 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3012825811062861697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10822089833284743071.kers'
[2026-05-25 05:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3012825811062861697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10822089833284743071.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 433 rows 415 cols 2852 entries
Finished phase 1 with 253 SingleSign rule and 103 generalized
[2026-05-25 05:20:55] [INFO ] Computed 61 invariants in 15 ms
Computed 61 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10822089833284743071.kers
Total runtime 16 ms.
[2026-05-25 05:20:58] [INFO ] Implicit Places using invariants in 2022 ms returned []
[2026-05-25 05:20:58] [INFO ] Invariant cache hit.
[2026-05-25 05:20:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:21:09] [INFO ] Implicit Places using invariants and state equation in 11535 ms returned []
Implicit Place search using SMT with State Equation took 13560 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 417/474 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 108723 ms. Remains : 417/474 places, 433/452 transitions.
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Knowledge-based reduction took 152179 ms.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 530/530 transitions.
Applied a total of 0 rules in 13 ms. Remains 552 /552 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1082190711341925356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17023473264961766532.kers'
[2026-05-25 05:21:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1082190711341925356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17023473264961766532.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 316 SingleSign rule and 137 generalized
[2026-05-25 05:21:09] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17023473264961766532.kers
Total runtime 8 ms.
[2026-05-25 05:21:10] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-25 05:21:10] [INFO ] Invariant cache hit.
[2026-05-25 05:21:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:21:17] [INFO ] Implicit Places using invariants and state equation in 7857 ms returned []
Implicit Place search using SMT with State Equation took 8135 ms to find 0 implicit places.
[2026-05-25 05:21:17] [INFO ] Redundant transitions in 2 ms returned []
Running 529 sub problems to find dead transitions.
[2026-05-25 05:21:17] [INFO ] Invariant cache hit.
[2026-05-25 05:21:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (OVERLAPS) 530/1081 variables, 551/650 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1081 variables, 38/688 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1082 variables, and 688 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 551/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (OVERLAPS) 530/1081 variables, 551/650 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1081 variables, 38/688 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 526/1214 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1082 variables, and 1214 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 551/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 526/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68273 ms. Remains : 552/552 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5566 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3227 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 343513 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 343513 steps, saw 171806 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
[2026-05-25 05:22:21] [INFO ] Invariant cache hit.
[2026-05-25 05:22:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 167/489 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1016 variables, 496/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1016 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1082 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1395 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 547/552 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 167/489 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1016 variables, 496/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1016 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1082 variables, and 681 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 547/552 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2781ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Graph (complete) has 1661 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 551 transition count 529
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 551 transition count 452
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 474 transition count 452
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 235 place count 474 transition count 452
Applied a total of 235 rules in 39 ms. Remains 474 /552 variables (removed 78) and now considering 452/530 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 474/552 places, 452/530 transitions.
RANDOM walk for 40000 steps (5156 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3369 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 378554 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 378554 steps, saw 189406 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4445598412459068600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7089555787679798038.kers'
[2026-05-25 05:22:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4445598412459068600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7089555787679798038.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 452 rows 472 cols 3883 entries
Finished phase 1 with 254 SingleSign rule and 121 generalized
[2026-05-25 05:22:26] [INFO ] Computed 99 invariants in 17 ms
Computed 99 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-7089555787679798038.kers
Total runtime 21 ms.
[2026-05-25 05:22:27] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/463 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/469 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 452/921 variables, 469/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 78/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/926 variables, 5/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/926 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 926/926 variables, and 652 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 474/474 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/463 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/469 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 452/921 variables, 469/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 78/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/926 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/926 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/926 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/926 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 926/926 variables, and 656 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 474/474 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 452/452 transitions.
Applied a total of 0 rules in 12 ms. Remains 474 /474 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 474/474 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2026-05-25 05:23:01] [INFO ] Invariant cache hit.
[2026-05-25 05:23:13] [INFO ] Implicit Places using invariants in 12158 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2026-05-25 05:23:13] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/474 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 451
Applied a total of 2 rules in 22 ms. Remains 471 /472 variables (removed 1) and now considering 451/452 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12014404506280561428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11939266766961316620.kers'
[2026-05-25 05:23:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12014404506280561428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11939266766961316620.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 451 rows 469 cols 3780 entries
Finished phase 1 with 257 SingleSign rule and 117 generalized
[2026-05-25 05:23:13] [INFO ] Computed 97 invariants in 16 ms
Computed 97 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-11939266766961316620.kers
Total runtime 18 ms.
[2026-05-25 05:23:24] [INFO ] Implicit Places using invariants in 10550 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2026-05-25 05:23:24] [INFO ] Actually due to overlaps returned [446, 385]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10555 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 469/474 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 450
Applied a total of 2 rules in 25 ms. Remains 468 /469 variables (removed 1) and now considering 450/451 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10950666389173292024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2878573387503013149.kers'
[2026-05-25 05:23:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10950666389173292024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2878573387503013149.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 450 rows 466 cols 3685 entries
Finished phase 1 with 267 SingleSign rule and 106 generalized
[2026-05-25 05:23:24] [INFO ] Computed 95 invariants in 12 ms
Computed 95 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-2878573387503013149.kers
Total runtime 14 ms.
[2026-05-25 05:23:32] [INFO ] Implicit Places using invariants in 8409 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 383, 388, 408, 414, 436, 441, 460, 466]
[2026-05-25 05:23:32] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8411 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 466/474 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 449
Applied a total of 2 rules in 22 ms. Remains 465 /466 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14371428279260639354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2154327602292086731.kers'
[2026-05-25 05:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14371428279260639354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2154327602292086731.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 449 rows 463 cols 3596 entries
Finished phase 1 with 256 SingleSign rule and 116 generalized
[2026-05-25 05:23:32] [INFO ] Computed 93 invariants in 18 ms
Computed 93 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2154327602292086731.kers
Total runtime 20 ms.
[2026-05-25 05:23:40] [INFO ] Implicit Places using invariants in 8118 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 358, 380, 385, 405, 411, 433, 438, 457, 463]
[2026-05-25 05:23:40] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8121 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 463/474 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 448
Applied a total of 2 rules in 20 ms. Remains 462 /463 variables (removed 1) and now considering 448/449 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3258276668025117538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8794696653436020531.kers'
[2026-05-25 05:23:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3258276668025117538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8794696653436020531.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 448 rows 460 cols 3512 entries
Finished phase 1 with 255 SingleSign rule and 116 generalized
[2026-05-25 05:23:41] [INFO ] Computed 91 invariants in 7 ms
Computed 91 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8794696653436020531.kers
Total runtime 10 ms.
[2026-05-25 05:23:47] [INFO ] Implicit Places using invariants in 6603 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 377, 382, 402, 408, 430, 435, 454, 460]
[2026-05-25 05:23:47] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6605 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 460/474 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 447
Applied a total of 2 rules in 22 ms. Remains 459 /460 variables (removed 1) and now considering 447/448 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7282049644020537694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1203863325282354843.kers'
[2026-05-25 05:23:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7282049644020537694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1203863325282354843.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 447 rows 457 cols 3433 entries
Finished phase 1 with 255 SingleSign rule and 115 generalized
[2026-05-25 05:23:47] [INFO ] Computed 89 invariants in 16 ms
Computed 89 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1203863325282354843.kers
Total runtime 18 ms.
[2026-05-25 05:23:53] [INFO ] Implicit Places using invariants in 6359 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 374, 379, 399, 405, 427, 432, 451, 457]
[2026-05-25 05:23:53] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6364 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 457/474 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 446
Applied a total of 2 rules in 19 ms. Remains 456 /457 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4532619975040846939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15386355375986063672.kers'
[2026-05-25 05:23:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4532619975040846939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15386355375986063672.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 446 rows 454 cols 3359 entries
Finished phase 1 with 255 SingleSign rule and 114 generalized
[2026-05-25 05:23:54] [INFO ] Computed 87 invariants in 15 ms
Computed 87 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15386355375986063672.kers
Total runtime 18 ms.
[2026-05-25 05:23:59] [INFO ] Implicit Places using invariants in 5582 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 371, 376, 396, 402, 424, 429, 448, 454]
[2026-05-25 05:23:59] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5589 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 454/474 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 445
Applied a total of 2 rules in 16 ms. Remains 453 /454 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14360503163008099957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1817516702078295739.kers'
[2026-05-25 05:23:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14360503163008099957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1817516702078295739.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 445 rows 451 cols 3290 entries
Finished phase 1 with 255 SingleSign rule and 113 generalized
[2026-05-25 05:23:59] [INFO ] Computed 85 invariants in 6 ms
Computed 85 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1817516702078295739.kers
Total runtime 8 ms.
[2026-05-25 05:24:04] [INFO ] Implicit Places using invariants in 4857 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 368, 373, 393, 399, 421, 426, 445, 451]
[2026-05-25 05:24:04] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4860 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 451/474 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 444
Applied a total of 2 rules in 28 ms. Remains 450 /451 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7170489812245179485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17764663842945243042.kers'
[2026-05-25 05:24:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7170489812245179485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17764663842945243042.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 444 rows 448 cols 3226 entries
Finished phase 1 with 255 SingleSign rule and 112 generalized
[2026-05-25 05:24:04] [INFO ] Computed 83 invariants in 16 ms
Computed 83 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-17764663842945243042.kers
Total runtime 18 ms.
[2026-05-25 05:24:08] [INFO ] Implicit Places using invariants in 4452 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 365, 370, 390, 396, 418, 423, 442, 448]
[2026-05-25 05:24:08] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4456 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 448/474 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 443
Applied a total of 2 rules in 19 ms. Remains 447 /448 variables (removed 1) and now considering 443/444 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17150049537081843658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17520633051871989933.kers'
[2026-05-25 05:24:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17150049537081843658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17520633051871989933.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 443 rows 445 cols 3167 entries
Finished phase 1 with 255 SingleSign rule and 111 generalized
[2026-05-25 05:24:08] [INFO ] Computed 81 invariants in 17 ms
Computed 81 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17520633051871989933.kers
Total runtime 19 ms.
[2026-05-25 05:24:12] [INFO ] Implicit Places using invariants in 3932 ms returned [201, 206, 229, 235, 257, 262, 282, 287, 308, 313, 334, 340, 362, 367, 387, 393, 415, 420, 439, 445]
[2026-05-25 05:24:12] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3935 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 445/474 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 442
Applied a total of 2 rules in 20 ms. Remains 444 /445 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5104307521477354303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15146219361676348716.kers'
[2026-05-25 05:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5104307521477354303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15146219361676348716.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 442 rows 442 cols 3113 entries
Finished phase 1 with 255 SingleSign rule and 110 generalized
[2026-05-25 05:24:12] [INFO ] Computed 79 invariants in 11 ms
Computed 79 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15146219361676348716.kers
Total runtime 13 ms.
[2026-05-25 05:24:16] [INFO ] Implicit Places using invariants in 3539 ms returned [226, 232, 254, 259, 279, 284, 305, 310, 331, 337, 359, 364, 384, 390, 412, 417, 436, 442]
[2026-05-25 05:24:16] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3541 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 442/474 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 441
Applied a total of 2 rules in 19 ms. Remains 441 /442 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14626630583342550683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9382369994307677436.kers'
[2026-05-25 05:24:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14626630583342550683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9382369994307677436.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 441 rows 439 cols 3064 entries
Finished phase 1 with 255 SingleSign rule and 109 generalized
[2026-05-25 05:24:16] [INFO ] Computed 77 invariants in 15 ms
Computed 77 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-9382369994307677436.kers
Total runtime 17 ms.
[2026-05-25 05:24:19] [INFO ] Implicit Places using invariants in 3395 ms returned [251, 256, 276, 281, 302, 307, 328, 334, 356, 361, 381, 387, 409, 414, 433, 439]
[2026-05-25 05:24:19] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3397 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 439/474 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 440
Applied a total of 2 rules in 21 ms. Remains 438 /439 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14394285149025868981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1311889788211344855.kers'
[2026-05-25 05:24:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14394285149025868981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1311889788211344855.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 440 rows 436 cols 3020 entries
Finished phase 1 with 255 SingleSign rule and 108 generalized
[2026-05-25 05:24:19] [INFO ] Computed 75 invariants in 15 ms
Computed 75 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1311889788211344855.kers
Total runtime 17 ms.
[2026-05-25 05:24:22] [INFO ] Implicit Places using invariants in 3091 ms returned [273, 278, 299, 304, 325, 331, 353, 358, 378, 384, 406, 411, 430, 436]
[2026-05-25 05:24:22] [INFO ] Actually due to overlaps returned [278, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3094 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 436/474 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 439
Applied a total of 2 rules in 23 ms. Remains 435 /436 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-100148313818328144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9205233389613731734.kers'
[2026-05-25 05:24:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-100148313818328144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9205233389613731734.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 439 rows 433 cols 2981 entries
Finished phase 1 with 255 SingleSign rule and 107 generalized
[2026-05-25 05:24:23] [INFO ] Computed 73 invariants in 15 ms
Computed 73 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-9205233389613731734.kers
Total runtime 17 ms.
[2026-05-25 05:24:25] [INFO ] Implicit Places using invariants in 2588 ms returned [296, 301, 322, 328, 350, 355, 375, 381, 403, 408, 427, 433]
[2026-05-25 05:24:25] [INFO ] Actually due to overlaps returned [301, 296]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2590 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 433/474 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 438
Applied a total of 2 rules in 20 ms. Remains 432 /433 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3691859992598156600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1064240589958971314.kers'
[2026-05-25 05:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3691859992598156600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1064240589958971314.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 438 rows 430 cols 2947 entries
Finished phase 1 with 255 SingleSign rule and 106 generalized
[2026-05-25 05:24:25] [INFO ] Computed 71 invariants in 10 ms
Computed 71 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1064240589958971314.kers
Total runtime 13 ms.
[2026-05-25 05:24:28] [INFO ] Implicit Places using invariants in 2449 ms returned [319, 325, 347, 352, 372, 378, 400, 405, 424, 430]
[2026-05-25 05:24:28] [INFO ] Actually due to overlaps returned [325, 319]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2453 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 430/474 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 437
Applied a total of 2 rules in 18 ms. Remains 429 /430 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7581000474380528954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6632233326055462429.kers'
[2026-05-25 05:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7581000474380528954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6632233326055462429.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 437 rows 427 cols 2918 entries
Finished phase 1 with 254 SingleSign rule and 106 generalized
[2026-05-25 05:24:28] [INFO ] Computed 69 invariants in 15 ms
Computed 69 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6632233326055462429.kers
Total runtime 16 ms.
[2026-05-25 05:24:30] [INFO ] Implicit Places using invariants in 2535 ms returned [344, 349, 369, 375, 397, 402, 421, 427]
[2026-05-25 05:24:30] [INFO ] Actually due to overlaps returned [349, 344]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2538 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 427/474 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 436
Applied a total of 2 rules in 24 ms. Remains 426 /427 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10201309844868896065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12232475015170955635.kers'
[2026-05-25 05:24:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10201309844868896065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12232475015170955635.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 436 rows 424 cols 2894 entries
Finished phase 1 with 254 SingleSign rule and 105 generalized
[2026-05-25 05:24:30] [INFO ] Computed 67 invariants in 6 ms
Computed 67 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12232475015170955635.kers
Total runtime 7 ms.
[2026-05-25 05:24:33] [INFO ] Implicit Places using invariants in 2394 ms returned [366, 372, 394, 399, 418, 424]
[2026-05-25 05:24:33] [INFO ] Actually due to overlaps returned [372, 366]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2397 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 424/474 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 435
Applied a total of 2 rules in 24 ms. Remains 423 /424 variables (removed 1) and now considering 435/436 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18148019942860085739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10642513228227398922.kers'
[2026-05-25 05:24:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18148019942860085739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10642513228227398922.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 435 rows 421 cols 2875 entries
Finished phase 1 with 254 SingleSign rule and 104 generalized
[2026-05-25 05:24:33] [INFO ] Computed 65 invariants in 15 ms
Computed 65 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-10642513228227398922.kers
Total runtime 17 ms.
[2026-05-25 05:24:35] [INFO ] Implicit Places using invariants in 2247 ms returned [391, 396, 415, 421]
[2026-05-25 05:24:35] [INFO ] Actually due to overlaps returned [396, 391]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2250 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 421/474 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 434
Applied a total of 2 rules in 19 ms. Remains 420 /421 variables (removed 1) and now considering 434/435 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-964394879371989364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17814524726263826429.kers'
[2026-05-25 05:24:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-964394879371989364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17814524726263826429.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 434 rows 418 cols 2861 entries
Finished phase 1 with 254 SingleSign rule and 103 generalized
[2026-05-25 05:24:35] [INFO ] Computed 63 invariants in 15 ms
Computed 63 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17814524726263826429.kers
Total runtime 17 ms.
[2026-05-25 05:24:37] [INFO ] Implicit Places using invariants in 2251 ms returned [412, 418]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2254 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 418/474 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 417 transition count 433
Applied a total of 2 rules in 23 ms. Remains 417 /418 variables (removed 1) and now considering 433/434 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2829569563112186759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7359855235054729116.kers'
[2026-05-25 05:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2829569563112186759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7359855235054729116.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 433 rows 415 cols 2852 entries
Finished phase 1 with 253 SingleSign rule and 103 generalized
[2026-05-25 05:24:37] [INFO ] Computed 61 invariants in 8 ms
Computed 61 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7359855235054729116.kers
Total runtime 11 ms.
[2026-05-25 05:24:39] [INFO ] Implicit Places using invariants in 2005 ms returned []
[2026-05-25 05:24:39] [INFO ] Invariant cache hit.
[2026-05-25 05:24:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:24:51] [INFO ] Implicit Places using invariants and state equation in 11452 ms returned []
Implicit Place search using SMT with State Equation took 13458 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 417/474 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 109450 ms. Remains : 417/474 places, 433/452 transitions.
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Knowledge-based reduction took 153201 ms.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13862 reset in 123 ms.
Product exploration explored 100000 steps with 13839 reset in 121 ms.
Built C files in :
/tmp/ltsmin7947117193594970348
[2026-05-25 05:24:51] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2026-05-25 05:24:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:24:51] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2026-05-25 05:24:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:24:51] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2026-05-25 05:24:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:24:51] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7947117193594970348
Running compilation step : cd /tmp/ltsmin7947117193594970348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1328 ms.
Running link step : cd /tmp/ltsmin7947117193594970348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7947117193594970348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased555962344582124215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 530/530 transitions.
Applied a total of 0 rules in 21 ms. Remains 552 /552 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1819818685113026628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12152834532697496707.kers'
[2026-05-25 05:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1819818685113026628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12152834532697496707.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 316 SingleSign rule and 137 generalized
[2026-05-25 05:25:06] [INFO ] Computed 99 invariants in 14 ms
Computed 99 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-12152834532697496707.kers
Total runtime 16 ms.
[2026-05-25 05:25:06] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-25 05:25:06] [INFO ] Invariant cache hit.
[2026-05-25 05:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:25:14] [INFO ] Implicit Places using invariants and state equation in 7983 ms returned []
Implicit Place search using SMT with State Equation took 8256 ms to find 0 implicit places.
[2026-05-25 05:25:14] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8291 ms. Remains : 552/552 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin9176038989687402862
[2026-05-25 05:25:14] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2026-05-25 05:25:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:25:14] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2026-05-25 05:25:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:25:14] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2026-05-25 05:25:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:25:14] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9176038989687402862
Running compilation step : cd /tmp/ltsmin9176038989687402862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin9176038989687402862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9176038989687402862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3987092352834946085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 05:25:29] [INFO ] Flatten gal took : 11 ms
[2026-05-25 05:25:29] [INFO ] Flatten gal took : 11 ms
[2026-05-25 05:25:29] [INFO ] Time to serialize gal into /tmp/LTL1876807299247335233.gal : 4 ms
[2026-05-25 05:25:29] [INFO ] Time to serialize properties into /tmp/LTL2723125810539112291.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/LTL1876807299247335233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut788942309312251212.hoa' '-atoms' '/tmp/LTL2723125810539112291.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...316
Loading property file /tmp/LTL2723125810539112291.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut788942309312251212.hoa
Detected timeout of ITS tools.
[2026-05-25 05:25:45] [INFO ] Flatten gal took : 11 ms
[2026-05-25 05:25:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 05:25:45] [INFO ] Time to serialize gal into /tmp/LTL10604978452464309810.gal : 3 ms
[2026-05-25 05:25:45] [INFO ] Time to serialize properties into /tmp/LTL8143726694017425711.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/LTL10604978452464309810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8143726694017425711.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("(p791<1)")))
Formula 0 simplified : F!"(p791<1)"
Detected timeout of ITS tools.
[2026-05-25 05:26:00] [INFO ] Flatten gal took : 14 ms
[2026-05-25 05:26:00] [INFO ] Applying decomposition
[2026-05-25 05:26:00] [INFO ] Flatten gal took : 10 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/graph8739211246526044764.txt' '-o' '/tmp/graph8739211246526044764.bin' '-w' '/tmp/graph8739211246526044764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8739211246526044764.bin' '-l' '-1' '-v' '-w' '/tmp/graph8739211246526044764.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:26:00] [INFO ] Decomposing Gal with order
[2026-05-25 05:26:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:26:00] [INFO ] Removed a total of 384 redundant transitions.
[2026-05-25 05:26:00] [INFO ] Flatten gal took : 31 ms
[2026-05-25 05:26:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 18 ms.
[2026-05-25 05:26:00] [INFO ] Time to serialize gal into /tmp/LTL8009531228061010737.gal : 9 ms
[2026-05-25 05:26:00] [INFO ] Time to serialize properties into /tmp/LTL13978925444389134342.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/LTL8009531228061010737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13978925444389134342.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G("(i6.i2.u144.p791<1)")))
Formula 0 simplified : F!"(i6.i2.u144.p791<1)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 466640 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))'
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1056 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 479 place count 817 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 559 place count 777 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 925 place count 594 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 555 transition count 532
Applied a total of 1002 rules in 85 ms. Remains 555 /1058 variables (removed 503) and now considering 532/997 (removed 465) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10648750134177143488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14125772523386016096.kers'
[2026-05-25 05:26:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10648750134177143488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14125772523386016096.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 532 rows 553 cols 2072 entries
Finished phase 1 with 323 SingleSign rule and 132 generalized
[2026-05-25 05:26:15] [INFO ] Computed 100 invariants in 7 ms
Computed 100 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14125772523386016096.kers
Total runtime 9 ms.
[2026-05-25 05:26:15] [INFO ] Implicit Places using invariants in 260 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1058 places, 532/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 530
Applied a total of 4 rules in 18 ms. Remains 552 /554 variables (removed 2) and now considering 530/532 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8845946259632652752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17384721626283207942.kers'
[2026-05-25 05:26:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8845946259632652752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17384721626283207942.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 317 SingleSign rule and 136 generalized
[2026-05-25 05:26:15] [INFO ] Computed 99 invariants in 9 ms
Computed 99 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17384721626283207942.kers
Total runtime 10 ms.
[2026-05-25 05:26:15] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-25 05:26:15] [INFO ] Invariant cache hit.
[2026-05-25 05:26:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:26:23] [INFO ] Implicit Places using invariants and state equation in 7723 ms returned []
Implicit Place search using SMT with State Equation took 7993 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1058 places, 530/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8358 ms. Remains : 552/1058 places, 530/997 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))'
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08
Product exploration explored 100000 steps with 13897 reset in 121 ms.
Product exploration explored 100000 steps with 13894 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5532 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3272 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355093 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355093 steps, saw 177608 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2026-05-25 05:26:27] [INFO ] Invariant cache hit.
[2026-05-25 05:26:27] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/441 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/491 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/495 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1015 variables, 495/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1015 variables, 36/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 61/1076 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1076 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1076 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1076 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1078 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1078 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1078 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1082 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1082 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1082 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1082 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/441 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/491 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/495 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 520/1015 variables, 495/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 61/1076 variables, 52/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1076 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1076 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1076 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1076 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1078 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1078 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1078 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/1082 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1082 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1082 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1082 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 13/13 constraints]
After SMT, in 3238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Graph (complete) has 1664 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 551 transition count 529
Free-agglomeration rule (complex) applied 74 times.
Iterating global reduction 1 with 74 rules applied. Total rules applied 76 place count 551 transition count 455
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 231 place count 477 transition count 455
Applied a total of 231 rules in 27 ms. Remains 477 /552 variables (removed 75) and now considering 455/530 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 477/552 places, 455/530 transitions.
RANDOM walk for 40000 steps (5099 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3387 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 379843 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 379843 steps, saw 190040 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8917605311390536428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1974264594325666026.kers'
[2026-05-25 05:27:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8917605311390536428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1974264594325666026.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 455 rows 475 cols 3059 entries
Finished phase 1 with 262 SingleSign rule and 116 generalized
[2026-05-25 05:27:03] [INFO ] Computed 99 invariants in 15 ms
Computed 99 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1974264594325666026.kers
Total runtime 18 ms.
[2026-05-25 05:27:03] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 146/469 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/472 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 455/927 variables, 472/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 78/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/932 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/932 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 662 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2509 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 146/469 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/472 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 455/927 variables, 472/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 78/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/932 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/932 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/932 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26109 ms.
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2026-05-25 05:27:33] [INFO ] Invariant cache hit.
[2026-05-25 05:27:40] [INFO ] Implicit Places using invariants in 7140 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 307, 335, 340, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2026-05-25 05:27:40] [INFO ] Actually due to overlaps returned [211, 340, 151, 335]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7141 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 453
Applied a total of 4 rules in 17 ms. Remains 471 /473 variables (removed 2) and now considering 453/455 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8027387680478769443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14550707855455866276.kers'
[2026-05-25 05:27:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8027387680478769443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14550707855455866276.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 453 rows 469 cols 2954 entries
Finished phase 1 with 264 SingleSign rule and 112 generalized
[2026-05-25 05:27:40] [INFO ] Computed 95 invariants in 16 ms
Computed 95 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14550707855455866276.kers
Total runtime 17 ms.
[2026-05-25 05:27:46] [INFO ] Implicit Places using invariants in 5761 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2026-05-25 05:27:46] [INFO ] Actually due to overlaps returned [446, 362, 356, 385]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5764 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 467/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 451
Applied a total of 4 rules in 18 ms. Remains 465 /467 variables (removed 2) and now considering 451/453 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17839450313978063465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10965395070504667318.kers'
[2026-05-25 05:27:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17839450313978063465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10965395070504667318.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 451 rows 463 cols 2862 entries
Finished phase 1 with 269 SingleSign rule and 105 generalized
[2026-05-25 05:27:46] [INFO ] Computed 91 invariants in 15 ms
Computed 91 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10965395070504667318.kers
Total runtime 17 ms.
[2026-05-25 05:27:51] [INFO ] Implicit Places using invariants in 4985 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 380, 385, 405, 411, 433, 438, 457, 463]
[2026-05-25 05:27:51] [INFO ] Actually due to overlaps returned [48, 385, 42, 380]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4988 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 461/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 461 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 449
Applied a total of 4 rules in 24 ms. Remains 459 /461 variables (removed 2) and now considering 449/451 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14559321235292850213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14659984290928485623.kers'
[2026-05-25 05:27:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14559321235292850213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14659984290928485623.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 449 rows 457 cols 2781 entries
Finished phase 1 with 258 SingleSign rule and 114 generalized
[2026-05-25 05:27:51] [INFO ] Computed 87 invariants in 15 ms
Computed 87 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-14659984290928485623.kers
Total runtime 16 ms.
[2026-05-25 05:27:55] [INFO ] Implicit Places using invariants in 4070 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 399, 405, 427, 432, 451, 457]
[2026-05-25 05:27:55] [INFO ] Actually due to overlaps returned [70, 405, 65, 399]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4071 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 447
Applied a total of 4 rules in 20 ms. Remains 453 /455 variables (removed 2) and now considering 447/449 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9626671985689844027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6708566274291695613.kers'
[2026-05-25 05:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9626671985689844027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6708566274291695613.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 447 rows 451 cols 2710 entries
Finished phase 1 with 258 SingleSign rule and 112 generalized
[2026-05-25 05:27:55] [INFO ] Computed 83 invariants in 5 ms
Computed 83 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6708566274291695613.kers
Total runtime 7 ms.
[2026-05-25 05:27:58] [INFO ] Implicit Places using invariants in 3478 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 298, 421, 426, 445, 451]
[2026-05-25 05:27:58] [INFO ] Actually due to overlaps returned [93, 426, 88, 421]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3480 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 449 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 447 transition count 445
Applied a total of 4 rules in 19 ms. Remains 447 /449 variables (removed 2) and now considering 445/447 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3295770573245763993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10118639887203663402.kers'
[2026-05-25 05:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3295770573245763993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10118639887203663402.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 445 rows 445 cols 2649 entries
Finished phase 1 with 258 SingleSign rule and 110 generalized
[2026-05-25 05:27:58] [INFO ] Computed 79 invariants in 13 ms
Computed 79 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-10118639887203663402.kers
Total runtime 14 ms.
[2026-05-25 05:28:01] [INFO ] Implicit Places using invariants in 3022 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 295, 439, 445]
[2026-05-25 05:28:01] [INFO ] Actually due to overlaps returned [116, 110, 439, 445]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3033 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 443 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 441 transition count 443
Applied a total of 4 rules in 15 ms. Remains 441 /443 variables (removed 2) and now considering 443/445 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15293125592142271156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12736610339000200979.kers'
[2026-05-25 05:28:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15293125592142271156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12736610339000200979.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 443 rows 439 cols 2598 entries
Finished phase 1 with 257 SingleSign rule and 109 generalized
[2026-05-25 05:28:01] [INFO ] Computed 75 invariants in 5 ms
Computed 75 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12736610339000200979.kers
Total runtime 6 ms.
[2026-05-25 05:28:04] [INFO ] Implicit Places using invariants in 2403 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 292]
[2026-05-25 05:28:04] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 439/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 442
Applied a total of 2 rules in 22 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17794925509882543312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7304929191154024312.kers'
[2026-05-25 05:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17794925509882543312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7304929191154024312.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 442 rows 436 cols 2561 entries
Finished phase 1 with 257 SingleSign rule and 108 generalized
[2026-05-25 05:28:04] [INFO ] Computed 73 invariants in 8 ms
Computed 73 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7304929191154024312.kers
Total runtime 11 ms.
[2026-05-25 05:28:06] [INFO ] Implicit Places using invariants in 2526 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 289]
[2026-05-25 05:28:06] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2529 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 436/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 441
Applied a total of 2 rules in 18 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5203493933226483885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3344482904915746041.kers'
[2026-05-25 05:28:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5203493933226483885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3344482904915746041.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 441 rows 433 cols 2529 entries
Finished phase 1 with 257 SingleSign rule and 107 generalized
[2026-05-25 05:28:06] [INFO ] Computed 71 invariants in 8 ms
Computed 71 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3344482904915746041.kers
Total runtime 10 ms.
[2026-05-25 05:28:08] [INFO ] Implicit Places using invariants in 2138 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 286]
[2026-05-25 05:28:08] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 433/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 21 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9023481062457467907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2974297225460502622.kers'
[2026-05-25 05:28:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9023481062457467907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2974297225460502622.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 440 rows 430 cols 2502 entries
Finished phase 1 with 257 SingleSign rule and 106 generalized
[2026-05-25 05:28:08] [INFO ] Computed 69 invariants in 8 ms
Computed 69 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2974297225460502622.kers
Total runtime 10 ms.
[2026-05-25 05:28:10] [INFO ] Implicit Places using invariants in 2021 ms returned [201, 206, 229, 235, 257, 262, 283]
[2026-05-25 05:28:10] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2023 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 430/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 439
Applied a total of 2 rules in 22 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4446014189550378028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1681043034965428181.kers'
[2026-05-25 05:28:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4446014189550378028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1681043034965428181.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 439 rows 427 cols 2480 entries
Finished phase 1 with 257 SingleSign rule and 105 generalized
[2026-05-25 05:28:10] [INFO ] Computed 67 invariants in 13 ms
Computed 67 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1681043034965428181.kers
Total runtime 14 ms.
[2026-05-25 05:28:12] [INFO ] Implicit Places using invariants in 1850 ms returned [226, 232, 254, 259, 280]
[2026-05-25 05:28:12] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 427/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 438
Applied a total of 2 rules in 21 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6118803880654250269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7778207726933731040.kers'
[2026-05-25 05:28:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6118803880654250269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7778207726933731040.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 438 rows 424 cols 2463 entries
Finished phase 1 with 257 SingleSign rule and 104 generalized
[2026-05-25 05:28:12] [INFO ] Computed 65 invariants in 4 ms
Computed 65 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7778207726933731040.kers
Total runtime 6 ms.
[2026-05-25 05:28:14] [INFO ] Implicit Places using invariants in 1566 ms returned [251, 256, 277]
[2026-05-25 05:28:14] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1569 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 424/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 437
Applied a total of 2 rules in 23 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10641095014266862940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12220958068230575352.kers'
[2026-05-25 05:28:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10641095014266862940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12220958068230575352.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 437 rows 421 cols 2451 entries
Finished phase 1 with 257 SingleSign rule and 103 generalized
[2026-05-25 05:28:14] [INFO ] Computed 63 invariants in 11 ms
Computed 63 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12220958068230575352.kers
Total runtime 13 ms.
[2026-05-25 05:28:15] [INFO ] Implicit Places using invariants in 1269 ms returned [274]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1271 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 422/477 places, 437/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Applied a total of 1 rules in 17 ms. Remains 422 /422 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11662257576394552922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4465073801864530299.kers'
[2026-05-25 05:28:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11662257576394552922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4465073801864530299.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 437 rows 420 cols 2448 entries
Finished phase 1 with 258 SingleSign rule and 102 generalized
[2026-05-25 05:28:15] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4465073801864530299.kers
Total runtime 6 ms.
[2026-05-25 05:28:17] [INFO ] Implicit Places using invariants in 1493 ms returned []
[2026-05-25 05:28:17] [INFO ] Invariant cache hit.
[2026-05-25 05:28:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:28:31] [INFO ] Implicit Places using invariants and state equation in 13834 ms returned []
Implicit Place search using SMT with State Equation took 15333 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 422/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 14 iterations and 57875 ms. Remains : 422/477 places, 437/455 transitions.
Knowledge based reduction with 3 factoid took 42 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Knowledge-based reduction took 127178 ms.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 530/530 transitions.
Applied a total of 0 rules in 14 ms. Remains 552 /552 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13092884735963052296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-264418497509272510.kers'
[2026-05-25 05:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13092884735963052296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-264418497509272510.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 317 SingleSign rule and 136 generalized
[2026-05-25 05:28:31] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-264418497509272510.kers
Total runtime 7 ms.
[2026-05-25 05:28:31] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-25 05:28:31] [INFO ] Invariant cache hit.
[2026-05-25 05:28:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:28:39] [INFO ] Implicit Places using invariants and state equation in 7636 ms returned []
Implicit Place search using SMT with State Equation took 7892 ms to find 0 implicit places.
[2026-05-25 05:28:39] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7927 ms. Remains : 552/552 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5574 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3193 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351030 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 351030 steps, saw 175562 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2026-05-25 05:28:42] [INFO ] Invariant cache hit.
[2026-05-25 05:28:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/441 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/491 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/495 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 520/1015 variables, 495/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1015 variables, 36/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 61/1076 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1076 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1076 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1076 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1078 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1078 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1078 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1082 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1082 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1082 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1082 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/441 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/491 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/495 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 520/1015 variables, 495/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 61/1076 variables, 52/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1076 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1076 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1076 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1076 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1078 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1078 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1078 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/1082 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1082 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1082 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1082 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/552 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 13/13 constraints]
After SMT, in 3508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Graph (complete) has 1664 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 551 transition count 529
Free-agglomeration rule (complex) applied 74 times.
Iterating global reduction 1 with 74 rules applied. Total rules applied 76 place count 551 transition count 455
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 231 place count 477 transition count 455
Applied a total of 231 rules in 27 ms. Remains 477 /552 variables (removed 75) and now considering 455/530 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 477/552 places, 455/530 transitions.
RANDOM walk for 40000 steps (5059 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3309 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 377577 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 377577 steps, saw 188907 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11686773804117776379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17793088790813652567.kers'
[2026-05-25 05:29:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11686773804117776379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17793088790813652567.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 455 rows 475 cols 3059 entries
Finished phase 1 with 262 SingleSign rule and 116 generalized
[2026-05-25 05:29:18] [INFO ] Computed 99 invariants in 16 ms
Computed 99 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17793088790813652567.kers
Total runtime 19 ms.
[2026-05-25 05:29:18] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 146/469 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/472 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 455/927 variables, 472/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 78/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/932 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/932 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 662 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 146/469 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/472 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 455/927 variables, 472/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 78/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/932 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/932 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/932 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26521 ms.
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2026-05-25 05:29:49] [INFO ] Invariant cache hit.
[2026-05-25 05:29:56] [INFO ] Implicit Places using invariants in 7128 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 307, 335, 340, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2026-05-25 05:29:56] [INFO ] Actually due to overlaps returned [211, 340, 151, 335]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7131 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 453
Applied a total of 4 rules in 20 ms. Remains 471 /473 variables (removed 2) and now considering 453/455 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3524374772789764279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2313131246016479330.kers'
[2026-05-25 05:29:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3524374772789764279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2313131246016479330.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 453 rows 469 cols 2954 entries
Finished phase 1 with 264 SingleSign rule and 112 generalized
[2026-05-25 05:29:56] [INFO ] Computed 95 invariants in 15 ms
Computed 95 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2313131246016479330.kers
Total runtime 18 ms.
[2026-05-25 05:30:02] [INFO ] Implicit Places using invariants in 5984 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2026-05-25 05:30:02] [INFO ] Actually due to overlaps returned [446, 362, 356, 385]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5986 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 467/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 451
Applied a total of 4 rules in 17 ms. Remains 465 /467 variables (removed 2) and now considering 451/453 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1304456488437087455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1200217337847774679.kers'
[2026-05-25 05:30:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1304456488437087455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1200217337847774679.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 451 rows 463 cols 2862 entries
Finished phase 1 with 269 SingleSign rule and 105 generalized
[2026-05-25 05:30:02] [INFO ] Computed 91 invariants in 17 ms
Computed 91 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-1200217337847774679.kers
Total runtime 18 ms.
[2026-05-25 05:30:07] [INFO ] Implicit Places using invariants in 4881 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 380, 385, 405, 411, 433, 438, 457, 463]
[2026-05-25 05:30:07] [INFO ] Actually due to overlaps returned [48, 385, 42, 380]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4884 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 461/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 461 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 449
Applied a total of 4 rules in 24 ms. Remains 459 /461 variables (removed 2) and now considering 449/451 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4613548202010033088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18050524101117794796.kers'
[2026-05-25 05:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4613548202010033088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18050524101117794796.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 449 rows 457 cols 2781 entries
Finished phase 1 with 258 SingleSign rule and 114 generalized
[2026-05-25 05:30:07] [INFO ] Computed 87 invariants in 6 ms
Computed 87 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18050524101117794796.kers
Total runtime 8 ms.
[2026-05-25 05:30:11] [INFO ] Implicit Places using invariants in 4184 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 399, 405, 427, 432, 451, 457]
[2026-05-25 05:30:11] [INFO ] Actually due to overlaps returned [70, 405, 65, 399]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4187 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 447
Applied a total of 4 rules in 26 ms. Remains 453 /455 variables (removed 2) and now considering 447/449 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14053987731588355384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1760503080537650598.kers'
[2026-05-25 05:30:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14053987731588355384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1760503080537650598.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 447 rows 451 cols 2710 entries
Finished phase 1 with 258 SingleSign rule and 112 generalized
[2026-05-25 05:30:11] [INFO ] Computed 83 invariants in 15 ms
Computed 83 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1760503080537650598.kers
Total runtime 17 ms.
[2026-05-25 05:30:14] [INFO ] Implicit Places using invariants in 3501 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 298, 421, 426, 445, 451]
[2026-05-25 05:30:14] [INFO ] Actually due to overlaps returned [93, 426, 88, 421]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3503 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 449 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 447 transition count 445
Applied a total of 4 rules in 18 ms. Remains 447 /449 variables (removed 2) and now considering 445/447 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16099193005206780797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4694043365666150256.kers'
[2026-05-25 05:30:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16099193005206780797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4694043365666150256.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 445 rows 445 cols 2649 entries
Finished phase 1 with 258 SingleSign rule and 110 generalized
[2026-05-25 05:30:14] [INFO ] Computed 79 invariants in 9 ms
Computed 79 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4694043365666150256.kers
Total runtime 11 ms.
[2026-05-25 05:30:17] [INFO ] Implicit Places using invariants in 3019 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 295, 439, 445]
[2026-05-25 05:30:17] [INFO ] Actually due to overlaps returned [116, 110, 439, 445]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3021 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 443 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 441 transition count 443
Applied a total of 4 rules in 20 ms. Remains 441 /443 variables (removed 2) and now considering 443/445 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17428017672125528502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8576245484598763417.kers'
[2026-05-25 05:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17428017672125528502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8576245484598763417.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 443 rows 439 cols 2598 entries
Finished phase 1 with 257 SingleSign rule and 109 generalized
[2026-05-25 05:30:17] [INFO ] Computed 75 invariants in 9 ms
Computed 75 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8576245484598763417.kers
Total runtime 11 ms.
[2026-05-25 05:30:20] [INFO ] Implicit Places using invariants in 2452 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 292]
[2026-05-25 05:30:20] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2453 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 439/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 442
Applied a total of 2 rules in 22 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-351625543490395502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8388426979822392668.kers'
[2026-05-25 05:30:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-351625543490395502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8388426979822392668.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 442 rows 436 cols 2561 entries
Finished phase 1 with 257 SingleSign rule and 108 generalized
[2026-05-25 05:30:20] [INFO ] Computed 73 invariants in 5 ms
Computed 73 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8388426979822392668.kers
Total runtime 6 ms.
[2026-05-25 05:30:22] [INFO ] Implicit Places using invariants in 2520 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 289]
[2026-05-25 05:30:22] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2522 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 436/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 441
Applied a total of 2 rules in 17 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16331390587197404586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14715115898585377450.kers'
[2026-05-25 05:30:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16331390587197404586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14715115898585377450.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 441 rows 433 cols 2529 entries
Finished phase 1 with 257 SingleSign rule and 107 generalized
[2026-05-25 05:30:22] [INFO ] Computed 71 invariants in 13 ms
Computed 71 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14715115898585377450.kers
Total runtime 14 ms.
[2026-05-25 05:30:25] [INFO ] Implicit Places using invariants in 2135 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 286]
[2026-05-25 05:30:25] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2137 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 433/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 22 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9325414617722871414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15488604461278984352.kers'
[2026-05-25 05:30:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9325414617722871414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15488604461278984352.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 440 rows 430 cols 2502 entries
Finished phase 1 with 257 SingleSign rule and 106 generalized
[2026-05-25 05:30:25] [INFO ] Computed 69 invariants in 12 ms
Computed 69 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15488604461278984352.kers
Total runtime 13 ms.
[2026-05-25 05:30:27] [INFO ] Implicit Places using invariants in 2017 ms returned [201, 206, 229, 235, 257, 262, 283]
[2026-05-25 05:30:27] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2019 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 430/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 439
Applied a total of 2 rules in 24 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18028198303328583493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13429008549776389834.kers'
[2026-05-25 05:30:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18028198303328583493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13429008549776389834.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 439 rows 427 cols 2480 entries
Finished phase 1 with 257 SingleSign rule and 105 generalized
[2026-05-25 05:30:27] [INFO ] Computed 67 invariants in 10 ms
Computed 67 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13429008549776389834.kers
Total runtime 12 ms.
[2026-05-25 05:30:28] [INFO ] Implicit Places using invariants in 1805 ms returned [226, 232, 254, 259, 280]
[2026-05-25 05:30:28] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1808 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 427/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 438
Applied a total of 2 rules in 22 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2842889946528995246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1371286133100236114.kers'
[2026-05-25 05:30:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2842889946528995246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1371286133100236114.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 438 rows 424 cols 2463 entries
Finished phase 1 with 257 SingleSign rule and 104 generalized
[2026-05-25 05:30:28] [INFO ] Computed 65 invariants in 4 ms
Computed 65 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1371286133100236114.kers
Total runtime 5 ms.
[2026-05-25 05:30:30] [INFO ] Implicit Places using invariants in 1559 ms returned [251, 256, 277]
[2026-05-25 05:30:30] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1561 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 424/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 437
Applied a total of 2 rules in 23 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13320971116716854889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1561806257722579574.kers'
[2026-05-25 05:30:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13320971116716854889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1561806257722579574.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 437 rows 421 cols 2451 entries
Finished phase 1 with 257 SingleSign rule and 103 generalized
[2026-05-25 05:30:30] [INFO ] Computed 63 invariants in 14 ms
Computed 63 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1561806257722579574.kers
Total runtime 16 ms.
[2026-05-25 05:30:31] [INFO ] Implicit Places using invariants in 1273 ms returned [274]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1274 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 422/477 places, 437/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Applied a total of 1 rules in 16 ms. Remains 422 /422 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10906545395814157662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6162416096290828775.kers'
[2026-05-25 05:30:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10906545395814157662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6162416096290828775.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 437 rows 420 cols 2448 entries
Finished phase 1 with 258 SingleSign rule and 102 generalized
[2026-05-25 05:30:31] [INFO ] Computed 62 invariants in 12 ms
Computed 62 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6162416096290828775.kers
Total runtime 14 ms.
[2026-05-25 05:30:33] [INFO ] Implicit Places using invariants in 1473 ms returned []
[2026-05-25 05:30:33] [INFO ] Invariant cache hit.
[2026-05-25 05:30:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 05:30:47] [INFO ] Implicit Places using invariants and state equation in 13858 ms returned []
Implicit Place search using SMT with State Equation took 15334 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 422/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 14 iterations and 58112 ms. Remains : 422/477 places, 437/455 transitions.
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Knowledge-based reduction took 128119 ms.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13892 reset in 106 ms.
Product exploration explored 100000 steps with 13830 reset in 111 ms.
Built C files in :
/tmp/ltsmin4640128273910160526
[2026-05-25 05:30:47] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2026-05-25 05:30:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:30:47] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2026-05-25 05:30:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:30:47] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2026-05-25 05:30:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:30:47] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4640128273910160526
Running compilation step : cd /tmp/ltsmin4640128273910160526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1316 ms.
Running link step : cd /tmp/ltsmin4640128273910160526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4640128273910160526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4811164029962813639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 530/530 transitions.
Applied a total of 0 rules in 9 ms. Remains 552 /552 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11232648653467847882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3624978466622223978.kers'
[2026-05-25 05:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11232648653467847882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3624978466622223978.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 530 rows 550 cols 2064 entries
Finished phase 1 with 317 SingleSign rule and 136 generalized
[2026-05-25 05:31:02] [INFO ] Computed 99 invariants in 11 ms
Computed 99 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3624978466622223978.kers
Total runtime 14 ms.
[2026-05-25 05:31:02] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-25 05:31:02] [INFO ] Invariant cache hit.
[2026-05-25 05:31:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 05:31:10] [INFO ] Implicit Places using invariants and state equation in 7822 ms returned []
Implicit Place search using SMT with State Equation took 8094 ms to find 0 implicit places.
[2026-05-25 05:31:10] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8113 ms. Remains : 552/552 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin10985589490128487579
[2026-05-25 05:31:10] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2026-05-25 05:31:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:31:10] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2026-05-25 05:31:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:31:10] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2026-05-25 05:31:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:31:10] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10985589490128487579
Running compilation step : cd /tmp/ltsmin10985589490128487579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1310 ms.
Running link step : cd /tmp/ltsmin10985589490128487579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10985589490128487579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13441510855745417784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 05:31:25] [INFO ] Flatten gal took : 10 ms
[2026-05-25 05:31:25] [INFO ] Flatten gal took : 9 ms
[2026-05-25 05:31:25] [INFO ] Time to serialize gal into /tmp/LTL14961752640233720768.gal : 2 ms
[2026-05-25 05:31:25] [INFO ] Time to serialize properties into /tmp/LTL13677540671336097030.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/LTL14961752640233720768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10189069847894649454.hoa' '-atoms' '/tmp/LTL13677540671336097030.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...320
Loading property file /tmp/LTL13677540671336097030.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10189069847894649454.hoa
Detected timeout of ITS tools.
[2026-05-25 05:31:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 05:31:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 05:31:40] [INFO ] Time to serialize gal into /tmp/LTL15497050077695937993.gal : 3 ms
[2026-05-25 05:31:40] [INFO ] Time to serialize properties into /tmp/LTL7737736878006950823.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/LTL15497050077695937993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7737736878006950823.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("((p654<1)||(p679<1))")))
Formula 0 simplified : F!"((p654<1)||(p679<1))"
Detected timeout of ITS tools.
[2026-05-25 05:31:55] [INFO ] Flatten gal took : 13 ms
[2026-05-25 05:31:55] [INFO ] Applying decomposition
[2026-05-25 05:31:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14913476690768983576.txt' '-o' '/tmp/graph14913476690768983576.bin' '-w' '/tmp/graph14913476690768983576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14913476690768983576.bin' '-l' '-1' '-v' '-w' '/tmp/graph14913476690768983576.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:31:55] [INFO ] Decomposing Gal with order
[2026-05-25 05:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:31:56] [INFO ] Removed a total of 421 redundant transitions.
[2026-05-25 05:31:56] [INFO ] Flatten gal took : 29 ms
[2026-05-25 05:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 15 ms.
[2026-05-25 05:31:56] [INFO ] Time to serialize gal into /tmp/LTL13177864588974812150.gal : 6 ms
[2026-05-25 05:31:56] [INFO ] Time to serialize properties into /tmp/LTL14936416636941669401.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/LTL13177864588974812150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14936416636941669401.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...256
Read 1 LTL properties
Checking formula 0 : !((G("((i5.u133.p654<1)||(i5.u139.p679<1))")))
Formula 0 simplified : F!"((i5.u133.p654<1)||(i5.u139.p679<1))"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 355819 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(p1) U p2)&&G(p3))||p0)))'
Support contains 4 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-731585334353874878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4463883635003614441.kers'
[2026-05-25 05:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-731585334353874878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4463883635003614441.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 997 rows 1058 cols 2805 entries
Finished phase 1 with 895 SingleSign rule and 63 generalized
[2026-05-25 05:32:11] [INFO ] Computed 100 invariants in 125 ms
Computed 100 P flows in 125 ms.
Exported basis to /tmp/petrispot-output-4463883635003614441.kers
Total runtime 129 ms.
[2026-05-25 05:32:11] [INFO ] Implicit Places using invariants in 511 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 514 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 28 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 581 ms. Remains : 1057/1058 places, 997/997 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(p1) U p2)&&G(p3))||p0)))'
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-09 finished in 826 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((G(p1)&&p0)))'
Support contains 4 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:32:11] [INFO ] Invariant cache hit.
[2026-05-25 05:32:12] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-25 05:32:12] [INFO ] Invariant cache hit.
[2026-05-25 05:32:28] [INFO ] Implicit Places using invariants and state equation in 16299 ms returned []
Implicit Place search using SMT with State Equation took 16666 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
[2026-05-25 05:32:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1057 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 996 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 Real declared 1057/2055 variables, and 94 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 94/98 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1057 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1057 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (OVERLAPS) 1/1058 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1058 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2055 variables, and 100 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/996 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in LTL mode , in 1 iterations and 76837 ms. Remains : 1058/1058 places, 997/997 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((G(p1)&&p0)))'
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 77006 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(p1)))) U (X(p2)&&(!p0 U (p3||G(!p0))))))'
Support contains 6 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:33:28] [INFO ] Invariant cache hit.
[2026-05-25 05:33:29] [INFO ] Implicit Places using invariants in 362 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 1057/1058 places, 997/997 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(p1)))) U (X(p2)&&(!p0 U (p3||G(!p0))))))'
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND p0 (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p2), (AND p0 (NOT p3)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 673 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)))&&F((p1&&(p2 U p3)))))'
Support contains 6 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Applied a total of 0 rules in 28 ms. Remains 1058 /1058 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2026-05-25 05:33:29] [INFO ] Invariant cache hit.
[2026-05-25 05:33:30] [INFO ] Implicit Places using invariants in 370 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 371 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1057/1058 places, 997/997 transitions.
Applied a total of 0 rules in 28 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 428 ms. Remains : 1057/1058 places, 997/997 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)))&&F((p1&&(p2 U p3)))))'
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 666 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((F(p0) U ((p1 U (X(p2)&&G(p1))) U X(p3))))))'
Support contains 7 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 997/997 transitions.
Graph (complete) has 1808 edges and 1058 vertex of which 1057 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 231 place count 1056 transition count 765
Reduce places removed 230 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 235 rules applied. Total rules applied 466 place count 826 transition count 760
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 471 place count 821 transition count 760
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 471 place count 821 transition count 719
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 553 place count 780 transition count 719
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 915 place count 599 transition count 538
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 991 place count 561 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 992 place count 560 transition count 537
Applied a total of 992 rules in 70 ms. Remains 560 /1058 variables (removed 498) and now considering 537/997 (removed 460) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14660877683475818959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-312824222560022164.kers'
[2026-05-25 05:33:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14660877683475818959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-312824222560022164.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 537 rows 558 cols 2081 entries
Finished phase 1 with 327 SingleSign rule and 133 generalized
[2026-05-25 05:33:30] [INFO ] Computed 100 invariants in 16 ms
Computed 100 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-312824222560022164.kers
Total runtime 18 ms.
[2026-05-25 05:33:30] [INFO ] Implicit Places using invariants in 300 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1058 places, 537/997 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 557 transition count 535
Applied a total of 4 rules in 15 ms. Remains 557 /559 variables (removed 2) and now considering 535/537 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5596948064489603588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18441307245723363014.kers'
[2026-05-25 05:33:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5596948064489603588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18441307245723363014.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 535 rows 555 cols 2073 entries
Finished phase 1 with 322 SingleSign rule and 136 generalized
[2026-05-25 05:33:30] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-18441307245723363014.kers
Total runtime 8 ms.
[2026-05-25 05:33:30] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-25 05:33:30] [INFO ] Invariant cache hit.
[2026-05-25 05:33:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 05:33:38] [INFO ] Implicit Places using invariants and state equation in 7792 ms returned []
Implicit Place search using SMT with State Equation took 8048 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 557/1058 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8443 ms. Remains : 557/1058 places, 535/997 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((F(p0) U ((p1 U (X(p2)&&G(p1))) U X(p3))))))'
Stuttering acceptance computed with spot in 351 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-15 finished in 8886 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 U (p1||G(p0))))))'
Spot run failed in 73 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' '!(G(F(p0)))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/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' '!(G(p0))'
Spot run failed in 40 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-25 05:33:39] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5921409136744863654
[2026-05-25 05:33:39] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2026-05-25 05:33:39] [INFO ] Applying decomposition
[2026-05-25 05:33:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:33:39] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2026-05-25 05:33:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:33:39] [INFO ] Flatten gal took : 14 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/graph15350254143226380501.txt' '-o' '/tmp/graph15350254143226380501.bin' '-w' '/tmp/graph15350254143226380501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15350254143226380501.bin' '-l' '-1' '-v' '-w' '/tmp/graph15350254143226380501.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:33:39] [INFO ] Decomposing Gal with order
[2026-05-25 05:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:33:39] [INFO ] Removed a total of 287 redundant transitions.
[2026-05-25 05:33:39] [INFO ] Flatten gal took : 36 ms
[2026-05-25 05:33:39] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
[2026-05-25 05:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2026-05-25 05:33:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 05:33:39] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5921409136744863654
[2026-05-25 05:33:39] [INFO ] Time to serialize gal into /tmp/LTLFireability3129353321709767711.gal : 9 ms
Running compilation step : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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-25 05:33:39] [INFO ] Time to serialize properties into /tmp/LTLFireability6020141130994101536.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/LTLFireability3129353321709767711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6020141130994101536.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 4 LTL properties
Checking formula 0 : !((G(F(("(i0.u366.p80<1)")U(("((i0.u366.p80<1)&&(!((i2.u142.p339>=1)||(i7.u266.p597>=1))))")||(G("(i0.u366.p80<1)")))))))
Formula 0 simplified : FG(!"(i0.u366.p80<1)" M !"((i0.u366.p80<1)&&(!((i2.u142.p339>=1)||(i7.u266.p597>=1))))")
Compilation finished in 3007 ms.
Running link step : cd /tmp/ltsmin5921409136744863654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp3==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp3==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin5921409136744863654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r098-tall-177955695800892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 ;