About the Execution of ITS-Tools for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4414.707 | 1706145.00 | 1950747.00 | 16091.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800877.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800877
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 17 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 67K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779677965512
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 02:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:59:26] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2026-05-25 02:59:26] [INFO ] Transformed 216 places.
[2026-05-25 02:59:26] [INFO ] Transformed 198 transitions.
[2026-05-25 02:59:26] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12540561930380274496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16304488133384069030.kers'
[2026-05-25 02:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12540561930380274496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16304488133384069030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 216 cols 558 entries
Finished phase 1 with 179 SingleSign rule and 13 generalized
[2026-05-25 02:59:26] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16304488133384069030.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (325 resets) in 39 ms. (250 steps per ms)
FORMULA DoubleExponent-PT-004-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130005 steps (3667 resets) in 202 ms. (640 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 02:59:27] [INFO ] Invariant cache hit.
[2026-05-25 02:59:27] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-25 02:59:27] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 8 ms returned sat
[2026-05-25 02:59:27] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-25 02:59:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-25 02:59:27] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-25 02:59:27] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2026-05-25 02:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-25 02:59:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 23 ms.
[2026-05-25 02:59:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1531 ms
[2026-05-25 02:59:30] [INFO ] Added : 189 causal constraints over 39 iterations in 2481 ms. Result :sat
Minimization took 296 ms.
[2026-05-25 02:59:31] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 02:59:31] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-25 02:59:31] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 02:59:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:31] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-25 02:59:31] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 02:59:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 445 ms
[2026-05-25 02:59:31] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 02:59:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2026-05-25 02:59:32] [INFO ] Added : 191 causal constraints over 39 iterations in 957 ms. Result :sat
Minimization took 336 ms.
[2026-05-25 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-25 02:59:33] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:33] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-25 02:59:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:33] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:33] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-25 02:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-25 02:59:33] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 02:59:34] [INFO ] Added : 192 causal constraints over 39 iterations in 937 ms. Result :sat
Minimization took 287 ms.
[2026-05-25 02:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-25 02:59:34] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 5 ms returned unsat
[2026-05-25 02:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:34] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:34] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-25 02:59:34] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 02:59:35] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 7 ms returned sat
[2026-05-25 02:59:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 02:59:35] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-25 02:59:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2026-05-25 02:59:36] [INFO ] Added : 187 causal constraints over 39 iterations in 1241 ms. Result :sat
Minimization took 251 ms.
[2026-05-25 02:59:36] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:36] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:36] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-25 02:59:36] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 02:59:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:36] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:36] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 02:59:36] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 02:59:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2026-05-25 02:59:37] [INFO ] Added : 162 causal constraints over 33 iterations in 812 ms. Result :sat
Minimization took 257 ms.
[2026-05-25 02:59:38] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:38] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:38] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 02:59:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:38] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:38] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 02:59:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2026-05-25 02:59:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 02:59:39] [INFO ] Added : 191 causal constraints over 39 iterations in 790 ms. Result :sat
Minimization took 251 ms.
[2026-05-25 02:59:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:39] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-25 02:59:39] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-25 02:59:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 02:59:39] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-25 02:59:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 02:59:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2026-05-25 02:59:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:40] [INFO ] Added : 155 causal constraints over 31 iterations in 610 ms. Result :sat
Minimization took 264 ms.
[2026-05-25 02:59:40] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:40] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:41] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 02:59:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:41] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:41] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-25 02:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2026-05-25 02:59:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:41] [INFO ] Added : 115 causal constraints over 23 iterations in 401 ms. Result :sat
Minimization took 225 ms.
[2026-05-25 02:59:42] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:42] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:42] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 02:59:42] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-25 02:59:42] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:42] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 02:59:42] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:43] [INFO ] Added : 191 causal constraints over 39 iterations in 796 ms. Result :sat
Minimization took 266 ms.
[2026-05-25 02:59:43] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-25 02:59:43] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:43] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 02:59:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:43] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-25 02:59:43] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-25 02:59:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2026-05-25 02:59:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:44] [INFO ] Added : 191 causal constraints over 39 iterations in 747 ms. Result :sat
Minimization took 236 ms.
[2026-05-25 02:59:44] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:44] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:45] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 02:59:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:45] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:45] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 02:59:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 02:59:45] [INFO ] Added : 104 causal constraints over 21 iterations in 368 ms. Result :sat
Minimization took 232 ms.
[2026-05-25 02:59:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:45] [INFO ] [Real]Absence check using 5 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-25 02:59:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 02:59:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 02:59:46] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:46] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-25 02:59:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 02:59:46] [INFO ] Added : 95 causal constraints over 19 iterations in 337 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 209 transition count 155
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 168 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 166 transition count 153
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 90 place count 166 transition count 145
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 106 place count 158 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 182 place count 120 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 194 place count 114 transition count 107
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 209 place count 114 transition count 92
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 224 place count 99 transition count 92
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 236 place count 99 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 98 transition count 91
Applied a total of 237 rules in 82 ms. Remains 98 /216 variables (removed 118) and now considering 91/198 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 98/216 places, 91/198 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7817581268148235365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3940375541369162609.kers'
[2026-05-25 02:59:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7817581268148235365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3940375541369162609.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 91 rows 96 cols 425 entries
Finished phase 1 with 57 SingleSign rule and 21 generalized
[2026-05-25 02:59:47] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3940375541369162609.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (128307 resets) in 975 ms. (1024 steps per ms)
BEST_FIRST walk for 9000001 steps (762527 resets) in 5158 ms. (1744 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 02:59:53] [INFO ] Invariant cache hit.
[2026-05-25 02:59:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:53] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-25 02:59:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 02:59:53] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2026-05-25 02:59:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 02:59:53] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 2 ms returned sat
[2026-05-25 02:59:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 02:59:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:59:53] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 12 ms.
[2026-05-25 02:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2026-05-25 02:59:54] [INFO ] Added : 58 causal constraints over 12 iterations in 242 ms. Result :sat
Minimization took 86 ms.
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:59:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2026-05-25 02:59:54] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 9 ms.
[2026-05-25 02:59:54] [INFO ] Added : 67 causal constraints over 14 iterations in 180 ms. Result :sat
Minimization took 88 ms.
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Real]Added 12 Read/Feed constraints in 6 ms returned sat
[2026-05-25 02:59:54] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 5 ms.
[2026-05-25 02:59:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 02:59:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2026-05-25 02:59:54] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 6 ms.
[2026-05-25 02:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2026-05-25 02:59:55] [INFO ] Added : 67 causal constraints over 14 iterations in 267 ms. Result :sat
Minimization took 97 ms.
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2026-05-25 02:59:55] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 7 ms.
[2026-05-25 02:59:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:59:55] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 5 ms.
[2026-05-25 02:59:55] [INFO ] Added : 77 causal constraints over 16 iterations in 264 ms. Result :sat
Minimization took 139 ms.
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:59:55] [INFO ] [Real]Added 12 Read/Feed constraints in 6 ms returned sat
[2026-05-25 02:59:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 2 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Added 12 Read/Feed constraints in 16 ms returned sat
[2026-05-25 02:59:56] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 6 ms.
[2026-05-25 02:59:56] [INFO ] Added : 76 causal constraints over 16 iterations in 223 ms. Result :sat
Minimization took 94 ms.
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 02:59:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:59:56] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 7 ms.
[2026-05-25 02:59:56] [INFO ] Added : 46 causal constraints over 11 iterations in 129 ms. Result :sat
Minimization took 77 ms.
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 2 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-25 02:59:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2026-05-25 02:59:56] [INFO ] [Nat]Added 12 Read/Feed constraints in 17 ms returned sat
[2026-05-25 02:59:56] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 5 ms.
[2026-05-25 02:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2026-05-25 02:59:57] [INFO ] Added : 79 causal constraints over 17 iterations in 409 ms. Result :sat
Minimization took 89 ms.
[2026-05-25 02:59:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Real]Added 12 Read/Feed constraints in 14 ms returned sat
[2026-05-25 02:59:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2026-05-25 02:59:57] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 7 ms.
[2026-05-25 02:59:57] [INFO ] Added : 69 causal constraints over 15 iterations in 199 ms. Result :sat
Minimization took 127 ms.
[2026-05-25 02:59:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 02:59:57] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 02:59:58] [INFO ] [Real]Added 12 Read/Feed constraints in 12 ms returned sat
[2026-05-25 02:59:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:59:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 02:59:58] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-25 02:59:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-25 02:59:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 14 ms returned sat
[2026-05-25 02:59:58] [INFO ] Computed and/alt/rep : 82/397/82 causal constraints (skipped 8 transitions) in 5 ms.
[2026-05-25 02:59:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2026-05-25 02:59:58] [INFO ] Added : 63 causal constraints over 13 iterations in 325 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-25 02:59:58] [INFO ] Invariant cache hit.
[2026-05-25 02:59:58] [INFO ] Implicit Places using invariants in 112 ms returned [22, 29, 45, 52, 66, 71, 89, 95]
[2026-05-25 02:59:58] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/98 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 90
Applied a total of 2 rules in 8 ms. Remains 95 /96 variables (removed 1) and now considering 90/91 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12262374681722733485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7416709390795715957.kers'
[2026-05-25 02:59:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12262374681722733485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7416709390795715957.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 90 rows 93 cols 402 entries
Finished phase 1 with 61 SingleSign rule and 16 generalized
[2026-05-25 02:59:58] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7416709390795715957.kers
Total runtime 1 ms.
[2026-05-25 02:59:59] [INFO ] Implicit Places using invariants in 89 ms returned [22, 29, 45, 52, 86, 92]
[2026-05-25 02:59:59] [INFO ] Actually due to overlaps returned [92, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/98 places, 90/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 89
Applied a total of 2 rules in 9 ms. Remains 92 /93 variables (removed 1) and now considering 89/90 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1525820037327848656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3667405132093273213.kers'
[2026-05-25 02:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1525820037327848656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3667405132093273213.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 89 rows 90 cols 387 entries
Finished phase 1 with 68 SingleSign rule and 8 generalized
[2026-05-25 02:59:59] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3667405132093273213.kers
Total runtime 1 ms.
[2026-05-25 02:59:59] [INFO ] Implicit Places using invariants in 81 ms returned [22, 29, 45, 52]
[2026-05-25 02:59:59] [INFO ] Actually due to overlaps returned [22, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 90/98 places, 89/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 88
Applied a total of 2 rules in 7 ms. Remains 89 /90 variables (removed 1) and now considering 88/89 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14688383369510546136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9444697366381782193.kers'
[2026-05-25 02:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14688383369510546136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9444697366381782193.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 88 rows 87 cols 378 entries
Finished phase 1 with 69 SingleSign rule and 6 generalized
[2026-05-25 02:59:59] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9444697366381782193.kers
Total runtime 1 ms.
[2026-05-25 02:59:59] [INFO ] Implicit Places using invariants in 63 ms returned [42, 49]
[2026-05-25 02:59:59] [INFO ] Actually due to overlaps returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 88/98 places, 88/91 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 87
Applied a total of 2 rules in 9 ms. Remains 87 /88 variables (removed 1) and now considering 87/88 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2919627815821409347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9269898966519824752.kers'
[2026-05-25 02:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2919627815821409347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9269898966519824752.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 85 cols 371 entries
Finished phase 1 with 67 SingleSign rule and 7 generalized
[2026-05-25 02:59:59] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9269898966519824752.kers
Total runtime 1 ms.
[2026-05-25 02:59:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 02:59:59] [INFO ] Invariant cache hit.
[2026-05-25 02:59:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 02:59:59] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 87/98 places, 87/91 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 672 ms. Remains : 87/98 places, 87/91 transitions.
[2026-05-25 02:59:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (144181 resets) in 726 ms. (1375 steps per ms)
BEST_FIRST walk for 9000002 steps (822334 resets) in 4620 ms. (1947 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 03:00:04] [INFO ] Invariant cache hit.
[2026-05-25 03:00:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:04] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 1 ms returned sat
[2026-05-25 03:00:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 03:00:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:00:04] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:00:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:00:04] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:00:04] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-25 03:00:04] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 4 ms.
[2026-05-25 03:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-25 03:00:05] [INFO ] Added : 65 causal constraints over 13 iterations in 245 ms. Result :sat
Minimization took 76 ms.
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Added 12 Read/Feed constraints in 11 ms returned sat
[2026-05-25 03:00:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 14 ms returned sat
[2026-05-25 03:00:05] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 03:00:05] [INFO ] Added : 81 causal constraints over 17 iterations in 268 ms. Result :sat
Minimization took 89 ms.
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Real]Added 12 Read/Feed constraints in 14 ms returned sat
[2026-05-25 03:00:05] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-25 03:00:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 03:00:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 17 ms returned sat
[2026-05-25 03:00:06] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 8 ms.
[2026-05-25 03:00:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2026-05-25 03:00:06] [INFO ] Added : 83 causal constraints over 17 iterations in 439 ms. Result :sat
Minimization took 97 ms.
[2026-05-25 03:00:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 1 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Real]Added 12 Read/Feed constraints in 12 ms returned sat
[2026-05-25 03:00:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 03:00:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2026-05-25 03:00:06] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 03:00:06] [INFO ] Added : 80 causal constraints over 16 iterations in 268 ms. Result :sat
Minimization took 80 ms.
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 03:00:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:00:07] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-25 03:00:07] [INFO ] Added : 71 causal constraints over 15 iterations in 242 ms. Result :sat
Minimization took 80 ms.
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 03:00:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2026-05-25 03:00:07] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 03:00:07] [INFO ] Added : 45 causal constraints over 9 iterations in 114 ms. Result :sat
Minimization took 61 ms.
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 03:00:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 03:00:07] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 03:00:08] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 03:00:08] [INFO ] Added : 65 causal constraints over 13 iterations in 154 ms. Result :sat
Minimization took 72 ms.
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Added 12 Read/Feed constraints in 14 ms returned sat
[2026-05-25 03:00:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Nat]Added 12 Read/Feed constraints in 21 ms returned sat
[2026-05-25 03:00:08] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 4 ms.
[2026-05-25 03:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 03:00:08] [INFO ] Added : 79 causal constraints over 18 iterations in 376 ms. Result :sat
Minimization took 93 ms.
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 03:00:08] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:00:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:00:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 03:00:09] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:00:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 03:00:09] [INFO ] [Nat]Added 12 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:00:09] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-25 03:00:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2026-05-25 03:00:09] [INFO ] Added : 80 causal constraints over 16 iterations in 490 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2026-05-25 03:00:10] [INFO ] Invariant cache hit.
[2026-05-25 03:00:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 03:00:10] [INFO ] Invariant cache hit.
[2026-05-25 03:00:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:00:10] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2026-05-25 03:00:10] [INFO ] Redundant transitions in 3 ms returned []
Running 86 sub problems to find dead transitions.
[2026-05-25 03:00:10] [INFO ] Invariant cache hit.
[2026-05-25 03:00:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 87/174 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 128 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 87/174 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 86/224 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 237 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15874ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 15881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16216 ms. Remains : 87/87 places, 87/87 transitions.
RANDOM walk for 40000 steps (5800 resets) in 925 ms. (43 steps per ms) remains 18/18 properties
[2026-05-25 03:00:26] [INFO ] Flatten gal took : 39 ms
[2026-05-25 03:00:26] [INFO ] Flatten gal took : 17 ms
BEST_FIRST walk for 4001 steps (371 resets) in 109 ms. (36 steps per ms) remains 18/18 properties
[2026-05-25 03:00:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3076261889407078569.gal : 8 ms
[2026-05-25 03:00:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17005070099777294151.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3076261889407078569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17005070099777294151.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4004 steps (339 resets) in 84 ms. (47 steps per ms) remains 18/18 properties
Loading property file /tmp/ReachabilityCardinality17005070099777294151.prop.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :91 after 288
BEST_FIRST walk for 4000 steps (368 resets) in 71 ms. (55 steps per ms) remains 18/18 properties
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :288 after 816
BEST_FIRST walk for 4002 steps (363 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (370 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :816 after 4690
BEST_FIRST walk for 4002 steps (351 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (382 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4690 after 15443
BEST_FIRST walk for 4002 steps (357 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (362 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (355 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (364 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :15443 after 48910
BEST_FIRST walk for 4002 steps (382 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (366 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (346 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
SDD proceeding with computation,12 properties remain. new max is 4096
BEST_FIRST walk for 4002 steps (369 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
SDD size :48910 after 111625
BEST_FIRST walk for 4002 steps (360 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (341 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (378 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :111625 after 232661
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :232661 after 497485
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :853656 after 899936
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.18463e+06 after 8.47245e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.23732e+08 after 1.27336e+08
Interrupted probabilistic random walk after 212558 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :6 out of 18
Probabilistic random walk after 212558 steps, saw 106285 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) properties seen :6
[2026-05-25 03:00:29] [INFO ] Invariant cache hit.
[2026-05-25 03:00:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/80 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/82 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/80 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/82 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/174 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/174 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 83 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 81 transition count 81
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 81 transition count 81
Applied a total of 16 rules in 8 ms. Remains 81 /87 variables (removed 6) and now considering 81/87 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/87 places, 81/87 transitions.
RANDOM walk for 40000 steps (5748 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3708 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :7.12585e+08 after 7.39647e+08
Interrupted probabilistic random walk after 623336 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 2
Probabilistic random walk after 623336 steps, saw 311923 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10977135529709728516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6836769712206788668.kers'
[2026-05-25 03:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10977135529709728516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6836769712206788668.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 81 rows 79 cols 366 entries
Finished phase 1 with 62 SingleSign rule and 6 generalized
[2026-05-25 03:00:33] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6836769712206788668.kers
Total runtime 3 ms.
[2026-05-25 03:00:33] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/76 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 81/157 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/76 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 81/157 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/162 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-05-25 03:00:34] [INFO ] Invariant cache hit.
[2026-05-25 03:00:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 03:00:34] [INFO ] Invariant cache hit.
[2026-05-25 03:00:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 03:00:34] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2026-05-25 03:00:34] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2026-05-25 03:00:34] [INFO ] Invariant cache hit.
[2026-05-25 03:00:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.32104e+09 after 3.3249e+09
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 201 constraints, problems are : Problem set: 0 solved, 80 unsolved in 13379 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 15570ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 15571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15811 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 24 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17979229083982963713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6642296731466045055.kers'
[2026-05-25 03:00:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17979229083982963713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6642296731466045055.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 68 cols 335 entries
Finished phase 1 with 42 SingleSign rule and 15 generalized
[2026-05-25 03:00:50] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6642296731466045055.kers
Total runtime 1 ms.
[2026-05-25 03:00:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 03:00:50] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 03:00:50] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-25 03:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 03:00:50] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:00:50] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-25 03:00:50] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-25 03:00:50] [INFO ] Flatten gal took : 18 ms
[2026-05-25 03:00:50] [INFO ] Flatten gal took : 16 ms
[2026-05-25 03:00:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1479686960901446472.gal : 3 ms
[2026-05-25 03:00:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13849455662824387679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1479686960901446472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13849455662824387679.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13849455662824387679.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 152
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :152 after 256
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :256 after 568
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :568 after 1402
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1402 after 3173
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3173 after 6734
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6734 after 13848
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13848 after 28045
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :28045 after 56429
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :56429 after 113213
Detected timeout of ITS tools.
[2026-05-25 03:01:05] [INFO ] Flatten gal took : 16 ms
[2026-05-25 03:01:05] [INFO ] Applying decomposition
[2026-05-25 03:01:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13000022364974114939.txt' '-o' '/tmp/graph13000022364974114939.bin' '-w' '/tmp/graph13000022364974114939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13000022364974114939.bin' '-l' '-1' '-v' '-w' '/tmp/graph13000022364974114939.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:01:05] [INFO ] Decomposing Gal with order
[2026-05-25 03:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:01:05] [INFO ] Removed a total of 40 redundant transitions.
[2026-05-25 03:01:05] [INFO ] Flatten gal took : 70 ms
[2026-05-25 03:01:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2026-05-25 03:01:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3473828020597883196.gal : 8 ms
[2026-05-25 03:01:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5754494352251686669.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3473828020597883196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5754494352251686669.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5754494352251686669.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 44
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :83 after 135
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2728 after 6551
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48629 after 49482
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :99455 after 101421
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.24561e+06 after 2.26753e+06
Detected timeout of ITS tools.
[2026-05-25 03:01:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:01:16] [INFO ] Applying decomposition
[2026-05-25 03:01:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16312118118202907408.txt' '-o' '/tmp/graph16312118118202907408.bin' '-w' '/tmp/graph16312118118202907408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16312118118202907408.bin' '-l' '-1' '-v' '-w' '/tmp/graph16312118118202907408.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:01:16] [INFO ] Decomposing Gal with order
[2026-05-25 03:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:01:16] [INFO ] Removed a total of 41 redundant transitions.
[2026-05-25 03:01:16] [INFO ] Flatten gal took : 29 ms
[2026-05-25 03:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2026-05-25 03:01:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12713370457377995851.gal : 2 ms
[2026-05-25 03:01:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1519842754622815997.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12713370457377995851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1519842754622815997.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1519842754622815997.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :60 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1161
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1161 after 1436
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1436 after 2326
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :45036 after 45124
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :45124 after 46439
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :88950 after 89965
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :132916 after 134570
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :221319 after 222052
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30537 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DoubleExponent-PT-004-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4798040388800833569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7901186491710076941.kers'
[2026-05-25 03:01:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4798040388800833569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7901186491710076941.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 85 cols 371 entries
Finished phase 1 with 67 SingleSign rule and 7 generalized
[2026-05-25 03:01:20] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7901186491710076941.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144164 resets) in 651 ms. (1533 steps per ms)
BEST_FIRST walk for 1000000 steps (91641 resets) in 461 ms. (2164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:01:21] [INFO ] Invariant cache hit.
[2026-05-25 03:01:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:21] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 03:01:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:01:21] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-25 03:01:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:01:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:21] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 03:01:21] [INFO ] [Nat]Added 12 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:01:21] [INFO ] Computed and/alt/rep : 84/432/84 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 03:01:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2026-05-25 03:01:22] [INFO ] Added : 80 causal constraints over 16 iterations in 435 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 87 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p193) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 83 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 81 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 81 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 80 transition count 79
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 80 transition count 79
Applied a total of 17 rules in 11 ms. Remains 80 /87 variables (removed 7) and now considering 79/86 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 80/87 places, 79/86 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8007522155083525002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12872078867568534467.kers'
[2026-05-25 03:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8007522155083525002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12872078867568534467.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 79 rows 78 cols 360 entries
Finished phase 1 with 61 SingleSign rule and 6 generalized
[2026-05-25 03:01:22] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12872078867568534467.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144454 resets) in 672 ms. (1485 steps per ms)
BEST_FIRST walk for 1000001 steps (91593 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:01:23] [INFO ] Invariant cache hit.
[2026-05-25 03:01:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:23] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2026-05-25 03:01:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 03:01:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 03:01:23] [INFO ] [Real]Added 13 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:01:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:01:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:23] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 03:01:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:01:23] [INFO ] Computed and/alt/rep : 75/432/75 causal constraints (skipped 3 transitions) in 6 ms.
[2026-05-25 03:01:24] [INFO ] Added : 72 causal constraints over 15 iterations in 284 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 80/80 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2026-05-25 03:01:24] [INFO ] Invariant cache hit.
[2026-05-25 03:01:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 03:01:24] [INFO ] Invariant cache hit.
[2026-05-25 03:01:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 03:01:24] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 320 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/80 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 325 ms. Remains : 79/80 places, 79/79 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14358317515611444632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4840324880077990333.kers'
[2026-05-25 03:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14358317515611444632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4840324880077990333.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 79 rows 77 cols 355 entries
Finished phase 1 with 61 SingleSign rule and 6 generalized
[2026-05-25 03:01:24] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4840324880077990333.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144438 resets) in 642 ms. (1555 steps per ms)
BEST_FIRST walk for 1000000 steps (91645 resets) in 463 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:01:25] [INFO ] Invariant cache hit.
[2026-05-25 03:01:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:25] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 03:01:25] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-25 03:01:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 03:01:25] [INFO ] [Real]Added 13 Read/Feed constraints in 3 ms returned sat
[2026-05-25 03:01:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:01:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-25 03:01:25] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 03:01:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2026-05-25 03:01:25] [INFO ] Computed and/alt/rep : 76/439/76 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 03:01:25] [INFO ] Added : 60 causal constraints over 12 iterations in 157 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2026-05-25 03:01:26] [INFO ] Invariant cache hit.
[2026-05-25 03:01:26] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 03:01:26] [INFO ] Invariant cache hit.
[2026-05-25 03:01:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 03:01:26] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-05-25 03:01:26] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-25 03:01:26] [INFO ] Invariant cache hit.
[2026-05-25 03:01:26] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 1 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 13/104 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 104 constraints, problems are : Problem set: 1 solved, 77 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 79/79 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 13/104 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 77/181 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 6/187 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 188 constraints, problems are : Problem set: 1 solved, 77 unsolved in 7802 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 79/79 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 77/78 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9397ms problems are : Problem set: 1 solved, 77 unsolved
Search for dead transitions found 1 dead transitions in 9398ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/79 places, 78/79 transitions.
Applied a total of 0 rules in 14 ms. Remains 79 /79 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:01:35] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9706 ms. Remains : 79/79 places, 78/79 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9766441050517206385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13200462266538434552.kers'
[2026-05-25 03:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9766441050517206385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13200462266538434552.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 77 cols 352 entries
Finished phase 1 with 60 SingleSign rule and 6 generalized
[2026-05-25 03:01:35] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13200462266538434552.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144061 resets) in 636 ms. (1569 steps per ms)
BEST_FIRST walk for 1000001 steps (91323 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:01:36] [INFO ] Invariant cache hit.
[2026-05-25 03:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:36] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 03:01:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:01:36] [INFO ] [Real]Added 12 Read/Feed constraints in 3 ms returned sat
[2026-05-25 03:01:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:36] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 03:01:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2026-05-25 03:01:37] [INFO ] Computed and/alt/rep : 75/431/75 causal constraints (skipped 2 transitions) in 4 ms.
[2026-05-25 03:01:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
[2026-05-25 03:01:38] [INFO ] Added : 73 causal constraints over 16 iterations in 1200 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:01:38] [INFO ] Invariant cache hit.
[2026-05-25 03:01:38] [INFO ] Implicit Places using invariants in 82 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/79 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87 ms. Remains : 78/79 places, 78/78 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14911710724561747982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18347201568233326549.kers'
[2026-05-25 03:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14911710724561747982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18347201568233326549.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 76 cols 350 entries
Finished phase 1 with 60 SingleSign rule and 6 generalized
[2026-05-25 03:01:38] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18347201568233326549.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144063 resets) in 631 ms. (1582 steps per ms)
BEST_FIRST walk for 1000000 steps (91368 resets) in 455 ms. (2192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:01:39] [INFO ] Invariant cache hit.
[2026-05-25 03:01:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:39] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 03:01:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:01:39] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:01:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:01:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:01:39] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:01:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 03:01:39] [INFO ] [Nat]Added 12 Read/Feed constraints in 16 ms returned sat
[2026-05-25 03:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2026-05-25 03:01:39] [INFO ] Computed and/alt/rep : 75/430/75 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 03:01:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 149 ms
[2026-05-25 03:01:40] [INFO ] Added : 70 causal constraints over 15 iterations in 390 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:01:40] [INFO ] Invariant cache hit.
[2026-05-25 03:01:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 03:01:40] [INFO ] Invariant cache hit.
[2026-05-25 03:01:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:01:40] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2026-05-25 03:01:40] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 03:01:40] [INFO ] Invariant cache hit.
[2026-05-25 03:01:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/156 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 102 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/156 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 77/179 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 204 constraints, problems are : Problem set: 0 solved, 77 unsolved in 8226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9857ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10166 ms. Remains : 78/78 places, 78/78 transitions.
[2026-05-25 03:01:50] [INFO ] Flatten gal took : 22 ms
[2026-05-25 03:01:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 03:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5834887596808862022.gal : 1 ms
[2026-05-25 03:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7934997917177367820.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5834887596808862022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7934997917177367820.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7934997917177367820.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,2 properties remain. new max is 512
RANDOM walk for 40000 steps (5762 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
SDD size :91 after 275
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :275 after 816
BEST_FIRST walk for 40000 steps (3636 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :816 after 6221
BEST_FIRST walk for 40003 steps (3644 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6221 after 45817
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :45817 after 223968
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :223968 after 597273
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748076 after 1.1302e+07
Interrupted probabilistic random walk after 517942 steps, run timeout after 3003 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 517942 steps, saw 259142 distinct states, run finished after 3016 ms. (steps per millisecond=171 ) properties seen :0
[2026-05-25 03:01:53] [INFO ] Invariant cache hit.
[2026-05-25 03:01:53] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.1302e+07 after 4.03243e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 78/151 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/156 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/151 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/156 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4831ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 9 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 78/78 places, 78/78 transitions.
RANDOM walk for 40000 steps (5718 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3650 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3699 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.03243e+08 after 2.34149e+09
Interrupted probabilistic random walk after 429245 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 429245 steps, saw 214782 distinct states, run finished after 3007 ms. (steps per millisecond=142 ) properties seen :0
[2026-05-25 03:02:01] [INFO ] Invariant cache hit.
[2026-05-25 03:02:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 78/151 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/156 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/151 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/156 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6345ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:02:08] [INFO ] Invariant cache hit.
[2026-05-25 03:02:08] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-25 03:02:08] [INFO ] Invariant cache hit.
[2026-05-25 03:02:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:02:08] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2026-05-25 03:02:08] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 78/78 places, 78/78 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 78 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 72 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 69 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 69 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 67 transition count 67
Applied a total of 22 rules in 22 ms. Remains 67 /78 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12433525109448900902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12161905060496326698.kers'
[2026-05-25 03:02:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12433525109448900902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12161905060496326698.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 65 cols 319 entries
Finished phase 1 with 38 SingleSign rule and 17 generalized
[2026-05-25 03:02:08] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12161905060496326698.kers
Total runtime 0 ms.
[2026-05-25 03:02:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 03:02:08] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 03:02:09] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-25 03:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 03:02:09] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:02:09] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:02:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:02:09] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 03:02:09] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 03:02:09] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:02:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
TRAPS : Iteration 1
[2026-05-25 03:02:09] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:02:09] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:02:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:02:09] [INFO ] Flatten gal took : 29 ms
[2026-05-25 03:02:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12052968518024069887.gal : 0 ms
[2026-05-25 03:02:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality793103648493247699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12052968518024069887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality793103648493247699.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality793103648493247699.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1526 after 3424
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3424 after 7205
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7205 after 14688
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :14688 after 29647
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :29647 after 59621
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :59621 after 119462
Detected timeout of ITS tools.
[2026-05-25 03:02:24] [INFO ] Flatten gal took : 13 ms
[2026-05-25 03:02:24] [INFO ] Applying decomposition
[2026-05-25 03:02:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2314136923200230035.txt' '-o' '/tmp/graph2314136923200230035.bin' '-w' '/tmp/graph2314136923200230035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2314136923200230035.bin' '-l' '-1' '-v' '-w' '/tmp/graph2314136923200230035.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:02:24] [INFO ] Decomposing Gal with order
[2026-05-25 03:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:02:24] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-25 03:02:24] [INFO ] Flatten gal took : 26 ms
[2026-05-25 03:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 03:02:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11529280915208463332.gal : 2 ms
[2026-05-25 03:02:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8969186511696381188.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11529280915208463332.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8969186511696381188.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8969186511696381188.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :188 after 341
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.34149e+09 after 6.99369e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30963 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:02:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 03:02:39] [INFO ] Applying decomposition
[2026-05-25 03:02:39] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6726904103312773686.txt' '-o' '/tmp/graph6726904103312773686.bin' '-w' '/tmp/graph6726904103312773686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6726904103312773686.bin' '-l' '-1' '-v' '-w' '/tmp/graph6726904103312773686.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:02:39] [INFO ] Decomposing Gal with order
[2026-05-25 03:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:02:39] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-25 03:02:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 03:02:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2026-05-25 03:02:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18418505874342217692.gal : 1 ms
[2026-05-25 03:02:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9949256058555905122.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18418505874342217692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9949256058555905122.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9949256058555905122.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :42 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :60 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1656
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :747052 after 747099
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747099 after 747228
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :747228 after 747485
Detected timeout of ITS tools.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7054978275416032099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8488355166420233442.kers'
[2026-05-25 03:03:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7054978275416032099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8488355166420233442.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 76 cols 350 entries
Finished phase 1 with 60 SingleSign rule and 6 generalized
[2026-05-25 03:03:29] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8488355166420233442.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1480 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (908 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:03:30] [INFO ] Invariant cache hit.
[2026-05-25 03:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 03:03:30] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 03:03:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:03:30] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2026-05-25 03:03:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:03:30] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:03:30] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2026-05-25 03:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2026-05-25 03:03:30] [INFO ] Computed and/alt/rep : 75/430/75 causal constraints (skipped 2 transitions) in 7 ms.
[2026-05-25 03:03:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2026-05-25 03:03:30] [INFO ] Added : 70 causal constraints over 15 iterations in 416 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 78/78 transitions.
[2026-05-25 03:03:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143944 resets) in 625 ms. (1597 steps per ms)
BEST_FIRST walk for 1000000 steps (91288 resets) in 454 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 03:03:31] [INFO ] Invariant cache hit.
[2026-05-25 03:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:03:31] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 03:03:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:03:31] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2026-05-25 03:03:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:03:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 03:03:31] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:31] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 03:03:32] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2026-05-25 03:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2026-05-25 03:03:32] [INFO ] Computed and/alt/rep : 75/430/75 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-25 03:03:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2026-05-25 03:03:32] [INFO ] Added : 70 causal constraints over 15 iterations in 438 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:03:32] [INFO ] Invariant cache hit.
[2026-05-25 03:03:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 03:03:32] [INFO ] Invariant cache hit.
[2026-05-25 03:03:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:03:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2026-05-25 03:03:32] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 78/78 places, 78/78 transitions.
[2026-05-25 03:03:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 03:03:32] [INFO ] Flatten gal took : 11 ms
[2026-05-25 03:03:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9958201818236538334.gal : 1 ms
[2026-05-25 03:03:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12095994267692386984.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9958201818236538334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12095994267692386984.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12095994267692386984.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
RANDOM walk for 40000 steps (5803 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 275
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :275 after 816
BEST_FIRST walk for 40001 steps (3688 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :816 after 6221
BEST_FIRST walk for 40002 steps (3668 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6221 after 45817
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :45817 after 223968
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :223968 after 597273
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748076 after 1.1302e+07
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.1302e+07 after 4.03243e+08
Interrupted probabilistic random walk after 652604 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 2
Probabilistic random walk after 652604 steps, saw 326436 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-25 03:03:36] [INFO ] Invariant cache hit.
[2026-05-25 03:03:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 78/151 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/156 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/151 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/156 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 78/78 places, 78/78 transitions.
RANDOM walk for 40000 steps (5836 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3650 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3690 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.03243e+08 after 2.34149e+09
Interrupted probabilistic random walk after 586553 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 586553 steps, saw 293429 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2026-05-25 03:03:40] [INFO ] Invariant cache hit.
[2026-05-25 03:03:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 78/151 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/156 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/156 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/69 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/151 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/156 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 78/78 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-25 03:03:40] [INFO ] Invariant cache hit.
[2026-05-25 03:03:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 03:03:40] [INFO ] Invariant cache hit.
[2026-05-25 03:03:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 03:03:41] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2026-05-25 03:03:41] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 78/78 places, 78/78 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 78 transition count 72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 72 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 69 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 69 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 67 transition count 67
Applied a total of 22 rules in 9 ms. Remains 67 /78 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2060681915359757902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17099829765681348318.kers'
[2026-05-25 03:03:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2060681915359757902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17099829765681348318.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 65 cols 319 entries
Finished phase 1 with 38 SingleSign rule and 17 generalized
[2026-05-25 03:03:41] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17099829765681348318.kers
Total runtime 1 ms.
[2026-05-25 03:03:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 03:03:41] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:41] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-25 03:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 03:03:41] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:03:41] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:03:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 03:03:41] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 03:03:41] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 03:03:41] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2026-05-25 03:03:41] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:03:41] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:03:41] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:03:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 03:03:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5890801459829995979.gal : 1 ms
[2026-05-25 03:03:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8645181135637056826.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5890801459829995979.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8645181135637056826.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8645181135637056826.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1526 after 3424
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3424 after 7205
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7205 after 14688
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :14688 after 29647
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :29647 after 59621
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :59621 after 119462
Detected timeout of ITS tools.
[2026-05-25 03:03:56] [INFO ] Flatten gal took : 7 ms
[2026-05-25 03:03:56] [INFO ] Applying decomposition
[2026-05-25 03:03:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12261653742624510827.txt' '-o' '/tmp/graph12261653742624510827.bin' '-w' '/tmp/graph12261653742624510827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12261653742624510827.bin' '-l' '-1' '-v' '-w' '/tmp/graph12261653742624510827.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:03:56] [INFO ] Decomposing Gal with order
[2026-05-25 03:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:03:56] [INFO ] Removed a total of 35 redundant transitions.
[2026-05-25 03:03:56] [INFO ] Flatten gal took : 15 ms
[2026-05-25 03:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2026-05-25 03:03:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12320351891757555191.gal : 1 ms
[2026-05-25 03:03:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11696899712393298589.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12320351891757555191.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11696899712393298589.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11696899712393298589.prop.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.34149e+09 after 6.99369e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30330 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 11 ms
[2026-05-25 03:04:11] [INFO ] Applying decomposition
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12838219365382962790.txt' '-o' '/tmp/graph12838219365382962790.bin' '-w' '/tmp/graph12838219365382962790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12838219365382962790.bin' '-l' '-1' '-v' '-w' '/tmp/graph12838219365382962790.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:04:11] [INFO ] Decomposing Gal with order
[2026-05-25 03:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:04:11] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 13 ms
[2026-05-25 03:04:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2026-05-25 03:04:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4500810018999479104.gal : 1 ms
[2026-05-25 03:04:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4127223972135407772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4500810018999479104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4127223972135407772.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4127223972135407772.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1534
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :747052 after 747096
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747096 after 747225
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :747225 after 747482
Detected timeout of ITS tools.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-12 in 91608 ms.
[2026-05-25 03:05:01] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:05:01] [INFO ] Applying decomposition
[2026-05-25 03:05:01] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10849281540633974875.txt' '-o' '/tmp/graph10849281540633974875.bin' '-w' '/tmp/graph10849281540633974875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10849281540633974875.bin' '-l' '-1' '-v' '-w' '/tmp/graph10849281540633974875.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:05:01] [INFO ] Decomposing Gal with order
[2026-05-25 03:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:05:01] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-25 03:05:01] [INFO ] Flatten gal took : 7 ms
[2026-05-25 03:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2026-05-25 03:05:01] [INFO ] Time to serialize gal into /tmp/UpperBounds14048528279987308694.gal : 1 ms
[2026-05-25 03:05:01] [INFO ] Time to serialize properties into /tmp/UpperBounds8292657807813356980.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14048528279987308694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8292657807813356980.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8292657807813356980.prop.
Detected timeout of ITS tools.
[2026-05-25 03:26:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 03:26:52] [INFO ] Time to serialize gal into /tmp/UpperBounds18255792062499521001.gal : 2 ms
[2026-05-25 03:26:52] [INFO ] Time to serialize properties into /tmp/UpperBounds16034710192752696393.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18255792062499521001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16034710192752696393.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds16034710192752696393.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.52464e+09,58.5073,769840,2,121522,5,1.58935e+06,6,0,390,1.44396e+06,0
Total reachable state count : 7524641160
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-004-UpperBounds-12 :0 <= p193 <= 1
FORMULA DoubleExponent-PT-004-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-004-UpperBounds-12,0,58.6301,769840,1,0,7,1.58935e+06,9,1,523,1.44396e+06,4
Total runtime 1704991 ms.
BK_STOP 1779679671657
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800877"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;