About the Execution of ITS-Tools for BusinessProcesses-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 658.336 | 444939.00 | 502316.00 | 3963.30 | FTFTFFFFTTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000451.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 BusinessProcesses-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000451
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779609791764
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 08:03:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:03:12] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2026-05-24 08:03:13] [INFO ] Transformed 200 places.
[2026-05-24 08:03:13] [INFO ] Transformed 178 transitions.
[2026-05-24 08:03:13] [INFO ] Found NUPN structural information;
[2026-05-24 08:03:13] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 175 transition count 155
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 175 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 175 transition count 154
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 56 place count 166 transition count 145
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 166 transition count 145
Applied a total of 65 rules in 49 ms. Remains 166 /199 variables (removed 33) and now considering 145/177 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-888753480850751165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9985821120303603871.kers'
[2026-05-24 08:03:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-888753480850751165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9985821120303603871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 166 cols 419 entries
Finished phase 1 with 122 SingleSign rule and 16 generalized
[2026-05-24 08:03:13] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9985821120303603871.kers
Total runtime 1 ms.
[2026-05-24 08:03:13] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 08:03:13] [INFO ] Invariant cache hit.
[2026-05-24 08:03:13] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-24 08:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 20/48 constraints. Problems are: Problem set: 2 solved, 142 unsolved
Problem TDEAD123 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 20/68 constraints. Problems are: Problem set: 3 solved, 141 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 20/88 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 10/98 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 14/112 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 4/116 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 3/119 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/119 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 145/311 variables, 166/285 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 6/291 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 3/294 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 1/295 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 4/299 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/311 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 299 constraints, problems are : Problem set: 4 solved, 140 unsolved in 23184 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 101/101 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 23/26 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/28 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 101/129 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 4/133 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 2/135 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 6/141 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/141 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 145/311 variables, 166/307 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 140/447 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 3/450 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 5/455 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 4/459 constraints. Problems are: Problem set: 4 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 460 constraints, problems are : Problem set: 4 solved, 140 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 140/144 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 53252ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 53263ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 166/199 places, 141/177 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 141
Applied a total of 2 rules in 6 ms. Remains 164 /166 variables (removed 2) and now considering 141/141 (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-13944779504821819561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18090530950238772920.kers'
[2026-05-24 08:04:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13944779504821819561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18090530950238772920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 164 cols 391 entries
Finished phase 1 with 124 SingleSign rule and 12 generalized
[2026-05-24 08:04:06] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18090530950238772920.kers
Total runtime 1 ms.
[2026-05-24 08:04:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 08:04:07] [INFO ] Invariant cache hit.
[2026-05-24 08:04:07] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/199 places, 141/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53975 ms. Remains : 164/199 places, 141/177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2026-05-24 08:04:07] [INFO ] Invariant cache hit.
[2026-05-24 08:04:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 08:04:07] [INFO ] Invariant cache hit.
[2026-05-24 08:04:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2026-05-24 08:04:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 141/305 variables, 164/266 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/305 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/305 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/305 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/305 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 21 (OVERLAPS) 0/305 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 275 constraints, problems are : Problem set: 0 solved, 140 unsolved in 25840 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 141/305 variables, 164/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 140/413 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/305 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 140 unsolved
SMT process timed out in 55873ms, After SMT, problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 55875ms
Finished structural reductions in LTL mode , in 1 iterations and 56075 ms. Remains : 164/164 places, 141/141 transitions.
Support contains 50 out of 164 places after structural reductions.
[2026-05-24 08:05:03] [INFO ] Flatten gal took : 30 ms
[2026-05-24 08:05:03] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:05:03] [INFO ] Input system was already deterministic with 141 transitions.
Support contains 49 out of 164 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (457 resets) in 1128 ms. (35 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40002 steps (93 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 118 ms. (336 steps per ms) remains 1/2 properties
[2026-05-24 08:05:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/133 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/159 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/297 variables, 159/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/304 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/305 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/305 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 164/164 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/133 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/159 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 138/297 variables, 159/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 304/305 variables, and 194 constraints, problems are : Problem set: 1 solved, 0 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 163/164 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 333ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-01-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 138 stabilizing places and 116 stable transitions
Graph (complete) has 322 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
FORMULA BusinessProcesses-PT-01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (X(!(X(p3)||p2))||F(p4)||p1))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 154 transition count 131
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 154 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 150 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 150 transition count 127
Applied a total of 28 rules in 9 ms. Remains 150 /164 variables (removed 14) and now considering 127/141 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1712656828227242468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16235626591633601203.kers'
[2026-05-24 08:05:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1712656828227242468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16235626591633601203.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 150 cols 363 entries
Finished phase 1 with 110 SingleSign rule and 12 generalized
[2026-05-24 08:05:04] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16235626591633601203.kers
Total runtime 1 ms.
[2026-05-24 08:05:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 08:05:04] [INFO ] Invariant cache hit.
[2026-05-24 08:05:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 08:05:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 127/277 variables, 150/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/277 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 18 (OVERLAPS) 0/277 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 212 constraints, problems are : Problem set: 0 solved, 126 unsolved in 16742 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/277 variables, 150/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 126/336 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 358 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46764ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 46764ms
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 127/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46921 ms. Remains : 150/164 places, 127/141 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (X(!(X(p3)||p2))||F(p4)||p1))))'
Stuttering acceptance computed with spot in 380 ms :[(OR p4 p1 (AND (NOT p2) (NOT p3))), (OR p4 p1 (AND (NOT p2) (NOT p3))), true, p4, (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-00 finished in 47383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 151 transition count 128
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 151 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 144 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 144 transition count 121
Applied a total of 40 rules in 11 ms. Remains 144 /164 variables (removed 20) and now considering 121/141 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-942542576500988953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1657707651515951493.kers'
[2026-05-24 08:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-942542576500988953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1657707651515951493.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:05:52] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1657707651515951493.kers
Total runtime 1 ms.
[2026-05-24 08:05:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:05:52] [INFO ] Invariant cache hit.
[2026-05-24 08:05:52] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2026-05-24 08:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 121/265 variables, 144/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/265 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 221 constraints, problems are : Problem set: 0 solved, 120 unsolved in 15535 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 45/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/218 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 120/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 351 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45556ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 45557ms
Starting structural reductions in LTL mode, iteration 1 : 144/164 places, 121/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45745 ms. Remains : 144/164 places, 121/141 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-01
Product exploration explored 100000 steps with 1347 reset in 218 ms.
Product exploration explored 100000 steps with 1357 reset in 163 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 297 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/144 stabilizing places and 99/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 46 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 881 steps (9 resets) in 7 ms. (110 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 267 ms.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2026-05-24 08:06:38] [INFO ] Invariant cache hit.
[2026-05-24 08:06:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 08:06:38] [INFO ] Invariant cache hit.
[2026-05-24 08:06:38] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 144/144 places, 121/121 transitions.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 297 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/144 stabilizing places and 99/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 58 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 840 steps (8 resets) in 10 ms. (76 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 296 ms.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 1353 reset in 112 ms.
Product exploration explored 100000 steps with 1347 reset in 122 ms.
Spot run failed in 67 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8850923745116808480
[2026-05-24 08:06:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8850923745116808480
Running compilation step : cd /tmp/ltsmin8850923745116808480;'/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 302 ms.
Running link step : cd /tmp/ltsmin8850923745116808480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8850923745116808480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased483176164882199069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2026-05-24 08:06:54] [INFO ] Invariant cache hit.
[2026-05-24 08:06:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 08:06:54] [INFO ] Invariant cache hit.
[2026-05-24 08:06:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 144/144 places, 121/121 transitions.
Built C files in :
/tmp/ltsmin1063322953799037215
[2026-05-24 08:06:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1063322953799037215
Running compilation step : cd /tmp/ltsmin1063322953799037215;'/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 200 ms.
Running link step : cd /tmp/ltsmin1063322953799037215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1063322953799037215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11991735798259988020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:07:10] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:07:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:07:10] [INFO ] Time to serialize gal into /tmp/LTL17296869607025350817.gal : 2 ms
[2026-05-24 08:07:10] [INFO ] Time to serialize properties into /tmp/LTL16902905491067250760.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/LTL17296869607025350817.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3423707308076638391.hoa' '-atoms' '/tmp/LTL16902905491067250760.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/LTL16902905491067250760.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3423707308076638391.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t34, t35, t37, t40, t43, t47, t50, t53, t56, t59, t65, t68, t72, t77, t78, t81, t82, ...310
Computing Next relation with stutter on 105 deadlock states
4 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
754 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.56019,253704,1,0,265,891739,269,127,4207,1.10076e+06,274
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-01-LTLCardinality-01 finished in 86604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(!p0) U ((X(!p0)&&(!p0||G(p1)))||X(G(!p0)))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Graph (trivial) has 88 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 315 edges and 159 vertex of which 158 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 157 transition count 108
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 132 transition count 108
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 132 transition count 82
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 109 place count 101 transition count 82
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 89 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 89 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 133 place count 89 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 87 transition count 68
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 203 place count 53 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 52 transition count 39
Applied a total of 205 rules in 45 ms. Remains 52 /164 variables (removed 112) and now considering 39/141 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11058576330383288925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12987978223128911745.kers'
[2026-05-24 08:07:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11058576330383288925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12987978223128911745.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 51 cols 177 entries
Finished phase 1 with 29 SingleSign rule and 2 generalized
[2026-05-24 08:07:18] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12987978223128911745.kers
Total runtime 0 ms.
[2026-05-24 08:07:18] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 5, 6, 7, 14, 45]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 71 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/164 places, 39/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 45/164 places, 39/141 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(!p0) U (X(G(!p0))||(X(!p0)&&(!p0||G(p1))))))))'
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-05 finished in 254 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(X(X(p0)))) U (p0&&G(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 151 transition count 128
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 151 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 145 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 145 transition count 122
Applied a total of 38 rules in 8 ms. Remains 145 /164 variables (removed 19) and now considering 122/141 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11229695319866143329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17100512880527024210.kers'
[2026-05-24 08:07:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11229695319866143329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17100512880527024210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 145 cols 353 entries
Finished phase 1 with 105 SingleSign rule and 12 generalized
[2026-05-24 08:07:18] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17100512880527024210.kers
Total runtime 1 ms.
[2026-05-24 08:07:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 08:07:18] [INFO ] Invariant cache hit.
[2026-05-24 08:07:19] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 08:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 122/267 variables, 145/209 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 8/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (OVERLAPS) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 220 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12307 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 122/267 variables, 145/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 121/344 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 356 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 42328ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 42329ms
Starting structural reductions in LTL mode, iteration 1 : 145/164 places, 122/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42524 ms. Remains : 145/164 places, 122/141 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(X(X(p0)))) U (G(p1)&&p0)))'
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-07
Product exploration explored 100000 steps with 16599 reset in 94 ms.
Stack based approach found an accepted trace after 555 steps with 91 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-07 finished in 42999 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&&(p1||G(p2))))||X(p0))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 151 transition count 128
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 151 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 146 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 146 transition count 123
Applied a total of 36 rules in 6 ms. Remains 146 /164 variables (removed 18) and now considering 123/141 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13664581910390845586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11260211105593382226.kers'
[2026-05-24 08:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13664581910390845586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11260211105593382226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 146 cols 355 entries
Finished phase 1 with 106 SingleSign rule and 12 generalized
[2026-05-24 08:08:01] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11260211105593382226.kers
Total runtime 1 ms.
[2026-05-24 08:08:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 08:08:01] [INFO ] Invariant cache hit.
[2026-05-24 08:08:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 08:08:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 123/269 variables, 146/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 200 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8988 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/269 variables, 146/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 122/319 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 338 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39010ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 39011ms
Starting structural reductions in LTL mode, iteration 1 : 146/164 places, 123/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39193 ms. Remains : 146/164 places, 123/141 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&&(p1||G(p2))))||X(p0))))'
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 123 stabilizing places and 101 stable transitions
Graph (complete) has 299 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 123 stabilizing places and 101 stable transitions
Detected a total of 123/146 stabilizing places and 101/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 13 ms. Proved property starting from automaton with 6 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-08 finished in 39626 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)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 150 transition count 127
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 150 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 143 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 143 transition count 120
Applied a total of 42 rules in 5 ms. Remains 143 /164 variables (removed 21) and now considering 120/141 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12423559828229061530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17834484347001645582.kers'
[2026-05-24 08:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12423559828229061530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17834484347001645582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 143 cols 349 entries
Finished phase 1 with 103 SingleSign rule and 12 generalized
[2026-05-24 08:08:41] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17834484347001645582.kers
Total runtime 1 ms.
[2026-05-24 08:08:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 08:08:41] [INFO ] Invariant cache hit.
[2026-05-24 08:08:41] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 08:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 120/263 variables, 143/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 119 unsolved in 10786 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 119/318 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 337 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 40802ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 40802ms
Starting structural reductions in LTL mode, iteration 1 : 143/164 places, 120/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40948 ms. Remains : 143/164 places, 120/141 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)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Computed a total of 120 stabilizing places and 98 stable transitions
Graph (complete) has 296 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 120 stabilizing places and 98 stable transitions
Detected a total of 120/143 stabilizing places and 98/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 17 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-09 finished in 41207 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 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Graph (trivial) has 89 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 315 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 158 transition count 110
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 134 transition count 110
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 50 place count 134 transition count 83
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 109 place count 102 transition count 83
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 120 place count 91 transition count 72
Iterating global reduction 2 with 11 rules applied. Total rules applied 131 place count 91 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 131 place count 91 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 89 transition count 70
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 203 place count 54 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 53 transition count 39
Applied a total of 205 rules in 21 ms. Remains 53 /164 variables (removed 111) and now considering 39/141 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17215911185633932759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13518991157040150626.kers'
[2026-05-24 08:09:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17215911185633932759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13518991157040150626.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 53 cols 164 entries
Finished phase 1 with 30 SingleSign rule and 2 generalized
[2026-05-24 08:09:22] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13518991157040150626.kers
Total runtime 0 ms.
[2026-05-24 08:09:22] [INFO ] Implicit Places using invariants in 37 ms returned [2, 3, 8, 9, 10, 11, 15]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 39 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/164 places, 39/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 46/164 places, 39/141 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 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-10 finished in 161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Graph (trivial) has 89 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 315 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 157 transition count 109
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 133 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 132 transition count 108
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 52 place count 132 transition count 81
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 111 place count 100 transition count 81
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 123 place count 88 transition count 69
Iterating global reduction 3 with 12 rules applied. Total rules applied 135 place count 88 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 88 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 86 transition count 67
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 207 place count 51 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 50 transition count 37
Applied a total of 209 rules in 22 ms. Remains 50 /164 variables (removed 114) and now considering 37/141 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7497220204042382019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10909870871680777370.kers'
[2026-05-24 08:09:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7497220204042382019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10909870871680777370.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 36 rows 49 cols 177 entries
Finished phase 1 with 27 SingleSign rule and 2 generalized
[2026-05-24 08:09:22] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10909870871680777370.kers
Total runtime 2 ms.
[2026-05-24 08:09:22] [INFO ] Implicit Places using invariants in 54 ms returned [1, 2, 8, 9, 15, 40]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 55 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/164 places, 37/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 44/164 places, 37/141 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 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-11 finished in 156 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((G(p1)||p0))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Graph (trivial) has 88 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 315 edges and 159 vertex of which 158 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 157 transition count 108
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 132 transition count 108
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 132 transition count 82
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 102 transition count 82
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 119 place count 91 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 91 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 130 place count 91 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 90 transition count 70
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 198 place count 57 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 56 transition count 40
Applied a total of 200 rules in 22 ms. Remains 56 /164 variables (removed 108) and now considering 40/141 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5121187084409953003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10139883412007011311.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5121187084409953003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10139883412007011311.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 39 rows 55 cols 185 entries
Finished phase 1 with 26 SingleSign rule and 6 generalized
[2026-05-24 08:09:23] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10139883412007011311.kers
Total runtime 1 ms.
[2026-05-24 08:09:23] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 3, 8, 9, 10, 19, 51, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 41 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/164 places, 40/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 46/164 places, 40/141 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-13
Product exploration explored 100000 steps with 13349 reset in 141 ms.
Product exploration explored 100000 steps with 13417 reset in 130 ms.
Computed a total of 39 stabilizing places and 33 stable transitions
Computed a total of 39 stabilizing places and 33 stable transitions
Detected a total of 39/46 stabilizing places and 33/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 11 factoid took 48 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (6507 resets) in 529 ms. (75 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (2311 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11304078954691157620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11587269317779733563.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11304078954691157620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11587269317779733563.kers]
Normalized transition count is 39 out of 40 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 39 rows 46 cols 154 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-24 08:09:23] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11587269317779733563.kers
Total runtime 1 ms.
[2026-05-24 08:09:23] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/44 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/83 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/85 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 46/46 constraints, ReadFeed: 3/3 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/44 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/83 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 85/86 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 46/46 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 68 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 420 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-13 finished in 856 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(p1) U p2)&&F(p3)&&G(p4)&&p0)))'
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 152 transition count 129
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 152 transition count 129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 146 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 146 transition count 123
Applied a total of 36 rules in 10 ms. Remains 146 /164 variables (removed 18) and now considering 123/141 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17220101770398821326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4676385671986579426.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17220101770398821326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4676385671986579426.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 146 cols 355 entries
Finished phase 1 with 106 SingleSign rule and 12 generalized
[2026-05-24 08:09:23] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4676385671986579426.kers
Total runtime 2 ms.
[2026-05-24 08:09:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 08:09:23] [INFO ] Invariant cache hit.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 08:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 123/269 variables, 146/229 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/269 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 19 (OVERLAPS) 0/269 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 238 constraints, problems are : Problem set: 0 solved, 122 unsolved in 15987 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 123/269 variables, 146/241 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 122/363 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 368 constraints, problems are : Problem set: 0 solved, 122 unsolved in 17172 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33168ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 33171ms
Starting structural reductions in LTL mode, iteration 1 : 146/164 places, 123/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33331 ms. Remains : 146/164 places, 123/141 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(p1) U p2)&&F(p3)&&G(p4)&&p0)))'
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p4) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p4) (NOT p0) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (NOT p4)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-14 finished in 33643 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))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 141/141 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 150 transition count 127
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 150 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 144 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 144 transition count 121
Applied a total of 40 rules in 7 ms. Remains 144 /164 variables (removed 20) and now considering 121/141 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13597943941041512251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7021767406489053907.kers'
[2026-05-24 08:09:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13597943941041512251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7021767406489053907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 08:09:57] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7021767406489053907.kers
Total runtime 0 ms.
[2026-05-24 08:09:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 08:09:57] [INFO ] Invariant cache hit.
[2026-05-24 08:09:57] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2026-05-24 08:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 144/189 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 198 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8824 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/315 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 336 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 38851ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 38852ms
Starting structural reductions in LTL mode, iteration 1 : 144/164 places, 121/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39018 ms. Remains : 144/164 places, 121/141 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))))'
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-15
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-15 finished in 39155 ms.
All properties solved by simple procedures.
Total runtime 443831 ms.
BK_STOP 1779610236703
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;