About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3433.676 | 3600000.00 | 4172832.00 | 19727.90 | ? 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-177955695800893.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800893
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.9K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 340K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779686085939
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-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 05:14:47] [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 05:14:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:14:47] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-25 05:14:47] [INFO ] Transformed 1064 places.
[2026-05-25 05:14:47] [INFO ] Transformed 998 transitions.
[2026-05-25 05:14:47] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 204 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-14761389139323676491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4630854916973204368.kers'
[2026-05-25 05:14:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14761389139323676491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4630854916973204368.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 998 rows 1064 cols 2814 entries
Finished phase 1 with 899 SingleSign rule and 61 generalized
[2026-05-25 05:14:47] [INFO ] Computed 104 invariants in 123 ms
Computed 104 P flows in 123 ms.
Exported basis to /tmp/petrispot-output-4630854916973204368.kers
Total runtime 124 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, 22, 3, 3, 3, 1, 3, 1, 1, 1, 3, 3, 1, 1, 3]
RANDOM walk for 10000 steps (326 resets) in 50 ms. (196 steps per ms)
FORMULA DoubleExponent-PT-020-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-020-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-020-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130001 steps (3657 resets) in 247 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
[2026-05-25 05:14:48] [INFO ] Invariant cache hit.
[2026-05-25 05:14:48] [INFO ] [Real]Absence check using 4 positive place invariants in 36 ms returned sat
[2026-05-25 05:14:48] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 111 ms returned sat
[2026-05-25 05:14:49] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2026-05-25 05:14:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:14:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2026-05-25 05:14:50] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 71 ms returned sat
[2026-05-25 05:14:50] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2026-05-25 05:14:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1588 ms
[2026-05-25 05:14:52] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 53 ms.
[2026-05-25 05:14:54] [INFO ] Added : 155 causal constraints over 31 iterations in 2722 ms. Result :unknown
[2026-05-25 05:14:55] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2026-05-25 05:14:55] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 88 ms returned sat
[2026-05-25 05:14:56] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2026-05-25 05:14:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:14:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2026-05-25 05:14:56] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 77 ms returned sat
[2026-05-25 05:14:58] [INFO ] [Nat]Absence check using state equation in 1697 ms returned sat
[2026-05-25 05:15:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:15:02] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2026-05-25 05:15:02] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 98 ms returned sat
[2026-05-25 05:15:03] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2026-05-25 05:15:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2026-05-25 05:15:03] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 90 ms returned sat
[2026-05-25 05:15:04] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2026-05-25 05:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2026-05-25 05:15:05] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 52 ms.
[2026-05-25 05:15:05] [INFO ] Added : 20 causal constraints over 4 iterations in 748 ms. Result :sat
Minimization took 674 ms.
[2026-05-25 05:15:06] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:06] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 90 ms returned sat
[2026-05-25 05:15:07] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2026-05-25 05:15:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:07] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 87 ms returned sat
[2026-05-25 05:15:08] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2026-05-25 05:15:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:15:12] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2026-05-25 05:15:13] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 103 ms returned sat
[2026-05-25 05:15:14] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2026-05-25 05:15:14] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2026-05-25 05:15:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:14] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 76 ms returned sat
[2026-05-25 05:15:15] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2026-05-25 05:15:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:15:20] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:20] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 89 ms returned sat
[2026-05-25 05:15:20] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2026-05-25 05:15:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:21] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 80 ms returned sat
[2026-05-25 05:15:22] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2026-05-25 05:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2026-05-25 05:15:22] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2026-05-25 05:15:23] [INFO ] Added : 20 causal constraints over 4 iterations in 935 ms. Result :sat
Minimization took 645 ms.
[2026-05-25 05:15:24] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:24] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 84 ms returned sat
[2026-05-25 05:15:24] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2026-05-25 05:15:24] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 47 ms.
[2026-05-25 05:15:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:24] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 82 ms returned sat
[2026-05-25 05:15:25] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2026-05-25 05:15:25] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 48 ms.
[2026-05-25 05:15:29] [INFO ] Added : 244 causal constraints over 49 iterations in 4386 ms. Result :unknown
[2026-05-25 05:15:29] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:30] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 99 ms returned sat
[2026-05-25 05:15:30] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2026-05-25 05:15:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:31] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 82 ms returned sat
[2026-05-25 05:15:31] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2026-05-25 05:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2026-05-25 05:15:32] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 35 ms.
[2026-05-25 05:15:33] [INFO ] Added : 20 causal constraints over 4 iterations in 1277 ms. Result :unknown
[2026-05-25 05:15:33] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:33] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 89 ms returned sat
[2026-05-25 05:15:34] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2026-05-25 05:15:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:35] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 86 ms returned sat
[2026-05-25 05:15:36] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2026-05-25 05:15:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:15:40] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2026-05-25 05:15:40] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 88 ms returned sat
[2026-05-25 05:15:42] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2026-05-25 05:15:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 44 ms.
[2026-05-25 05:15:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:42] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 94 ms returned sat
[2026-05-25 05:15:43] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2026-05-25 05:15:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1823 ms
[2026-05-25 05:15:45] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 43 ms.
[2026-05-25 05:15:47] [INFO ] Added : 25 causal constraints over 5 iterations in 1310 ms. Result :sat
Minimization took 266 ms.
[2026-05-25 05:15:47] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:47] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 101 ms returned sat
[2026-05-25 05:15:48] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2026-05-25 05:15:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:49] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 85 ms returned sat
[2026-05-25 05:15:50] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2026-05-25 05:15:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3174 ms
[2026-05-25 05:15:53] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 46 ms.
[2026-05-25 05:15:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:15:54] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 05:15:54] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 89 ms returned sat
[2026-05-25 05:15:54] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2026-05-25 05:15:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:15:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:15:55] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 99 ms returned sat
[2026-05-25 05:15:56] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2026-05-25 05:15:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1996 ms
[2026-05-25 05:15:58] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 46 ms.
[2026-05-25 05:15:59] [INFO ] Added : 20 causal constraints over 4 iterations in 1272 ms. Result :unknown
[2026-05-25 05:15:59] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2026-05-25 05:15:59] [INFO ] [Real]Absence check using 4 positive and 100 generalized place invariants in 80 ms returned sat
[2026-05-25 05:16:00] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2026-05-25 05:16:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:16:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 05:16:01] [INFO ] [Nat]Absence check using 4 positive and 100 generalized place invariants in 86 ms returned sat
[2026-05-25 05:16:02] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2026-05-25 05:16:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1134 ms
[2026-05-25 05:16:03] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 48 ms.
[2026-05-25 05:16:04] [INFO ] Added : 20 causal constraints over 4 iterations in 1403 ms. Result :sat
Minimization took 640 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Support contains 13 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 1057 transition count 767
Reduce places removed 229 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 234 rules applied. Total rules applied 467 place count 828 transition count 762
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 472 place count 823 transition count 762
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 472 place count 823 transition count 721
Deduced a syphon composed of 41 places in 10 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 554 place count 782 transition count 721
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 9 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 910 place count 604 transition count 543
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 982 place count 568 transition count 543
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 3 with 81 rules applied. Total rules applied 1063 place count 568 transition count 462
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 1144 place count 487 transition count 462
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 4 with 77 rules applied. Total rules applied 1221 place count 487 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1222 place count 486 transition count 461
Applied a total of 1222 rules in 336 ms. Remains 486 /1064 variables (removed 578) and now considering 461/998 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 486/1064 places, 461/998 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11236477330562038002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14956134133365334149.kers'
[2026-05-25 05:17:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11236477330562038002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14956134133365334149.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 461 rows 484 cols 3883 entries
Finished phase 1 with 265 SingleSign rule and 121 generalized
[2026-05-25 05:17:09] [INFO ] Computed 100 invariants in 9 ms
Computed 100 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14956134133365334149.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
RANDOM walk for 1000000 steps (128389 resets) in 1005 ms. (994 steps per ms)
BEST_FIRST walk for 13000005 steps (1100661 resets) in 8666 ms. (1499 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
[2026-05-25 05:17:18] [INFO ] Invariant cache hit.
[2026-05-25 05:17:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:17:18] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 36 ms returned sat
[2026-05-25 05:17:19] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2026-05-25 05:17:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:17:19] [INFO ] [Real]Added 77 Read/Feed constraints in 308 ms returned sat
[2026-05-25 05:17:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:17:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:17:19] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 31 ms returned sat
[2026-05-25 05:17:19] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2026-05-25 05:17:20] [INFO ] [Nat]Added 77 Read/Feed constraints in 474 ms returned sat
[2026-05-25 05:17:20] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 34 ms.
[2026-05-25 05:17:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2026-05-25 05:17:23] [INFO ] Added : 107 causal constraints over 22 iterations in 2787 ms. Result :sat
Minimization took 2600 ms.
[2026-05-25 05:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:25] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:17:26] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2026-05-25 05:17:26] [INFO ] [Real]Added 77 Read/Feed constraints in 279 ms returned sat
[2026-05-25 05:17:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:26] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 33 ms returned sat
[2026-05-25 05:17:26] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2026-05-25 05:17:27] [INFO ] [Nat]Added 77 Read/Feed constraints in 1013 ms returned sat
[2026-05-25 05:17:27] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 41 ms.
[2026-05-25 05:17:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2026-05-25 05:17:30] [INFO ] Added : 121 causal constraints over 25 iterations in 2693 ms. Result :sat
Minimization took 2140 ms.
[2026-05-25 05:17:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:17:32] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:17:33] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:17:33] [INFO ] [Real]Added 77 Read/Feed constraints in 137 ms returned sat
[2026-05-25 05:17:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:17:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:33] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 35 ms returned sat
[2026-05-25 05:17:33] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2026-05-25 05:17:33] [INFO ] [Nat]Added 77 Read/Feed constraints in 453 ms returned sat
[2026-05-25 05:17:33] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 23 ms.
[2026-05-25 05:17:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3432 ms
[2026-05-25 05:17:39] [INFO ] Added : 96 causal constraints over 21 iterations in 5267 ms. Result :sat
Minimization took 1921 ms.
[2026-05-25 05:17:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:41] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:17:41] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2026-05-25 05:17:42] [INFO ] [Real]Added 77 Read/Feed constraints in 592 ms returned sat
[2026-05-25 05:17:42] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 20 ms.
[2026-05-25 05:17:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:17:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:42] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 31 ms returned sat
[2026-05-25 05:17:42] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:17:43] [INFO ] [Nat]Added 77 Read/Feed constraints in 664 ms returned sat
[2026-05-25 05:17:43] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 28 ms.
[2026-05-25 05:17:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2026-05-25 05:17:45] [INFO ] Added : 102 causal constraints over 21 iterations in 1847 ms. Result :sat
Minimization took 2250 ms.
[2026-05-25 05:17:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:17:47] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:17:47] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2026-05-25 05:17:48] [INFO ] [Real]Added 77 Read/Feed constraints in 929 ms returned sat
[2026-05-25 05:17:48] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 45 ms.
[2026-05-25 05:17:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:17:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:17:49] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 32 ms returned sat
[2026-05-25 05:17:49] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2026-05-25 05:17:50] [INFO ] [Nat]Added 77 Read/Feed constraints in 1534 ms returned sat
[2026-05-25 05:17:50] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 28 ms.
[2026-05-25 05:17:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 614 ms
[2026-05-25 05:17:57] [INFO ] Added : 224 causal constraints over 45 iterations in 6568 ms. Result :sat
Minimization took 3323 ms.
[2026-05-25 05:18:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:00] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 39 ms returned sat
[2026-05-25 05:18:01] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2026-05-25 05:18:02] [INFO ] [Real]Added 77 Read/Feed constraints in 851 ms returned sat
[2026-05-25 05:18:02] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 29 ms.
[2026-05-25 05:18:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:02] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 31 ms returned sat
[2026-05-25 05:18:02] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2026-05-25 05:18:04] [INFO ] [Nat]Added 77 Read/Feed constraints in 1598 ms returned sat
[2026-05-25 05:18:04] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 26 ms.
[2026-05-25 05:18:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2026-05-25 05:18:16] [INFO ] Added : 350 causal constraints over 70 iterations in 12095 ms. Result :sat
Minimization took 4508 ms.
[2026-05-25 05:18:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:18:21] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 40 ms returned sat
[2026-05-25 05:18:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-25 05:18:21] [INFO ] [Real]Added 77 Read/Feed constraints in 194 ms returned sat
[2026-05-25 05:18:21] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 24 ms.
[2026-05-25 05:18:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:21] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 32 ms returned sat
[2026-05-25 05:18:21] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-05-25 05:18:22] [INFO ] [Nat]Added 77 Read/Feed constraints in 202 ms returned sat
[2026-05-25 05:18:22] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 23 ms.
[2026-05-25 05:18:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1145 ms
[2026-05-25 05:18:24] [INFO ] Added : 52 causal constraints over 11 iterations in 1847 ms. Result :sat
Minimization took 1755 ms.
[2026-05-25 05:18:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:25] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:18:26] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2026-05-25 05:18:26] [INFO ] [Real]Added 77 Read/Feed constraints in 434 ms returned sat
[2026-05-25 05:18:26] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 22 ms.
[2026-05-25 05:18:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:18:26] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 31 ms returned sat
[2026-05-25 05:18:27] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2026-05-25 05:18:28] [INFO ] [Nat]Added 77 Read/Feed constraints in 849 ms returned sat
[2026-05-25 05:18:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2026-05-25 05:18:28] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 24 ms.
[2026-05-25 05:18:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1580 ms
[2026-05-25 05:18:33] [INFO ] Added : 146 causal constraints over 30 iterations in 4763 ms. Result :sat
Minimization took 3609 ms.
[2026-05-25 05:18:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:36] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 32 ms returned sat
[2026-05-25 05:18:36] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2026-05-25 05:18:38] [INFO ] [Real]Added 77 Read/Feed constraints in 1072 ms returned sat
[2026-05-25 05:18:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:18:38] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 32 ms returned sat
[2026-05-25 05:18:38] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2026-05-25 05:18:40] [INFO ] [Nat]Added 77 Read/Feed constraints in 1734 ms returned sat
[2026-05-25 05:18:40] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 24 ms.
[2026-05-25 05:18:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1047 ms
[2026-05-25 05:18:46] [INFO ] Added : 220 causal constraints over 45 iterations in 5896 ms. Result :sat
Minimization took 4506 ms.
[2026-05-25 05:18:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:50] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 36 ms returned sat
[2026-05-25 05:18:50] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2026-05-25 05:18:51] [INFO ] [Real]Added 77 Read/Feed constraints in 210 ms returned sat
[2026-05-25 05:18:51] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 24 ms.
[2026-05-25 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:18:51] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 34 ms returned sat
[2026-05-25 05:18:51] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2026-05-25 05:18:51] [INFO ] [Nat]Added 77 Read/Feed constraints in 264 ms returned sat
[2026-05-25 05:18:51] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 21 ms.
[2026-05-25 05:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2026-05-25 05:18:52] [INFO ] Added : 61 causal constraints over 13 iterations in 1055 ms. Result :sat
Minimization took 2567 ms.
[2026-05-25 05:18:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:18:55] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 33 ms returned sat
[2026-05-25 05:18:55] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2026-05-25 05:18:56] [INFO ] [Real]Added 77 Read/Feed constraints in 595 ms returned sat
[2026-05-25 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:18:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:18:56] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 38 ms returned sat
[2026-05-25 05:18:56] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2026-05-25 05:18:57] [INFO ] [Nat]Added 77 Read/Feed constraints in 765 ms returned sat
[2026-05-25 05:18:57] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 29 ms.
[2026-05-25 05:19:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1946 ms
[2026-05-25 05:19:00] [INFO ] Added : 88 causal constraints over 18 iterations in 3149 ms. Result :sat
Minimization took 2276 ms.
[2026-05-25 05:19:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:19:03] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 43 ms returned sat
[2026-05-25 05:19:03] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2026-05-25 05:19:04] [INFO ] [Real]Added 77 Read/Feed constraints in 798 ms returned sat
[2026-05-25 05:19:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:19:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 05:19:04] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 32 ms returned sat
[2026-05-25 05:19:04] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2026-05-25 05:19:06] [INFO ] [Nat]Added 77 Read/Feed constraints in 1818 ms returned sat
[2026-05-25 05:19:06] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 26 ms.
[2026-05-25 05:19:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2098 ms
[2026-05-25 05:19:14] [INFO ] Added : 244 causal constraints over 50 iterations in 7993 ms. Result :sat
Minimization took 3501 ms.
[2026-05-25 05:19:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:19:18] [INFO ] [Real]Absence check using 3 positive and 97 generalized place invariants in 38 ms returned sat
[2026-05-25 05:19:18] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2026-05-25 05:19:19] [INFO ] [Real]Added 77 Read/Feed constraints in 1114 ms returned sat
[2026-05-25 05:19:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:19:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 05:19:19] [INFO ] [Nat]Absence check using 3 positive and 97 generalized place invariants in 33 ms returned sat
[2026-05-25 05:19:19] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2026-05-25 05:19:22] [INFO ] [Nat]Added 77 Read/Feed constraints in 2240 ms returned sat
[2026-05-25 05:19:22] [INFO ] Computed and/alt/rep : 372/2149/372 causal constraints (skipped 88 transitions) in 22 ms.
[2026-05-25 05:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2026-05-25 05:19:25] [INFO ] Added : 172 causal constraints over 35 iterations in 3322 ms. Result :sat
Minimization took 2311 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Support contains 13 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 461/461 transitions.
Applied a total of 0 rules in 19 ms. Remains 486 /486 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 486/486 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 461/461 transitions.
Applied a total of 0 rules in 17 ms. Remains 486 /486 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2026-05-25 05:21:40] [INFO ] Invariant cache hit.
[2026-05-25 05:21:54] [INFO ] Implicit Places using invariants in 13495 ms returned [15, 20, 46, 53, 75, 80, 101, 106, 127, 133, 154, 159, 160, 180, 185, 206, 212, 220, 234, 239, 262, 268, 290, 295, 316, 321, 342, 347, 369, 375, 396, 398, 402, 422, 430, 452, 457, 461, 478, 484]
[2026-05-25 05:21:54] [INFO ] Actually due to overlaps returned [220, 159]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13499 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 484/486 places, 461/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 460
Applied a total of 2 rules in 36 ms. Remains 483 /484 variables (removed 1) and now considering 460/461 (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-9284834160388284155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7867222193040246006.kers'
[2026-05-25 05:21:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9284834160388284155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7867222193040246006.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 460 rows 481 cols 3780 entries
Finished phase 1 with 267 SingleSign rule and 118 generalized
[2026-05-25 05:21:54] [INFO ] Computed 98 invariants in 7 ms
Computed 98 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7867222193040246006.kers
Total runtime 8 ms.
[2026-05-25 05:22:05] [INFO ] Implicit Places using invariants in 11705 ms returned [15, 20, 46, 53, 75, 80, 101, 106, 127, 133, 154, 159, 179, 184, 205, 211, 231, 236, 259, 265, 287, 292, 313, 318, 339, 344, 366, 372, 393, 395, 399, 419, 427, 449, 454, 458, 475, 481]
[2026-05-25 05:22:05] [INFO ] Actually due to overlaps returned [458, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11712 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 481/486 places, 460/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 481 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 480 transition count 459
Applied a total of 2 rules in 48 ms. Remains 480 /481 variables (removed 1) and now considering 459/460 (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-17746002048601255628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8030325535836256770.kers'
[2026-05-25 05:22:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17746002048601255628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8030325535836256770.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 459 rows 478 cols 3685 entries
Finished phase 1 with 276 SingleSign rule and 108 generalized
[2026-05-25 05:22:05] [INFO ] Computed 96 invariants in 17 ms
Computed 96 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8030325535836256770.kers
Total runtime 18 ms.
[2026-05-25 05:22:14] [INFO ] Implicit Places using invariants in 9139 ms returned [15, 20, 46, 53, 75, 80, 101, 106, 127, 133, 154, 159, 179, 184, 205, 211, 231, 236, 259, 265, 287, 292, 313, 318, 339, 344, 366, 372, 393, 398, 418, 426, 448, 453, 472, 478]
[2026-05-25 05:22:14] [INFO ] Actually due to overlaps returned [53, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9144 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 478/486 places, 459/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 477 transition count 458
Applied a total of 2 rules in 46 ms. Remains 477 /478 variables (removed 1) and now considering 458/459 (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-3189699716568605866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12861807902622413425.kers'
[2026-05-25 05:22:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3189699716568605866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12861807902622413425.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 458 rows 475 cols 3596 entries
Finished phase 1 with 270 SingleSign rule and 113 generalized
[2026-05-25 05:22:15] [INFO ] Computed 94 invariants in 8 ms
Computed 94 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12861807902622413425.kers
Total runtime 9 ms.
[2026-05-25 05:22:23] [INFO ] Implicit Places using invariants in 8888 ms returned [15, 20, 72, 77, 98, 103, 124, 130, 151, 156, 176, 181, 202, 208, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 363, 369, 390, 395, 415, 423, 445, 450, 469, 475]
[2026-05-25 05:22:23] [INFO ] Actually due to overlaps returned [77, 72]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 8892 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 475/486 places, 458/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 457
Applied a total of 2 rules in 42 ms. Remains 474 /475 variables (removed 1) and now considering 457/458 (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-5594183005986969896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14456255272674514419.kers'
[2026-05-25 05:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5594183005986969896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14456255272674514419.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 457 rows 472 cols 3512 entries
Finished phase 1 with 269 SingleSign rule and 113 generalized
[2026-05-25 05:22:23] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14456255272674514419.kers
Total runtime 9 ms.
[2026-05-25 05:22:31] [INFO ] Implicit Places using invariants in 7974 ms returned [15, 20, 95, 100, 121, 127, 148, 153, 173, 178, 199, 205, 225, 230, 253, 259, 281, 286, 307, 312, 333, 338, 360, 366, 387, 392, 412, 420, 442, 447, 466, 472]
[2026-05-25 05:22:31] [INFO ] Actually due to overlaps returned [100, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 7978 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 472/486 places, 457/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 456
Applied a total of 2 rules in 30 ms. Remains 471 /472 variables (removed 1) and now considering 456/457 (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-9024304529102660436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17397457173960157362.kers'
[2026-05-25 05:22:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9024304529102660436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17397457173960157362.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 456 rows 469 cols 3433 entries
Finished phase 1 with 269 SingleSign rule and 112 generalized
[2026-05-25 05:22:31] [INFO ] Computed 90 invariants in 12 ms
Computed 90 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17397457173960157362.kers
Total runtime 13 ms.
[2026-05-25 05:22:38] [INFO ] Implicit Places using invariants in 6677 ms returned [15, 20, 118, 124, 145, 150, 170, 175, 196, 202, 222, 227, 250, 256, 278, 283, 304, 309, 330, 335, 357, 363, 384, 389, 409, 417, 439, 444, 463, 469]
[2026-05-25 05:22:38] [INFO ] Actually due to overlaps returned [124, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6688 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 469/486 places, 456/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 455
Applied a total of 2 rules in 31 ms. Remains 468 /469 variables (removed 1) and now considering 455/456 (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-17243560878829439698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8945712021218508405.kers'
[2026-05-25 05:22:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17243560878829439698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8945712021218508405.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 455 rows 466 cols 3359 entries
Finished phase 1 with 268 SingleSign rule and 112 generalized
[2026-05-25 05:22:38] [INFO ] Computed 88 invariants in 13 ms
Computed 88 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-8945712021218508405.kers
Total runtime 28 ms.
[2026-05-25 05:22:44] [INFO ] Implicit Places using invariants in 6008 ms returned [15, 20, 142, 147, 167, 172, 193, 199, 219, 224, 247, 253, 275, 280, 301, 306, 327, 332, 354, 360, 381, 386, 406, 414, 436, 441, 460, 466]
[2026-05-25 05:22:44] [INFO ] Actually due to overlaps returned [147, 142]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6013 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 466/486 places, 455/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 454
Applied a total of 2 rules in 28 ms. Remains 465 /466 variables (removed 1) and now considering 454/455 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18364325658533419811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10618578326948988337.kers'
[2026-05-25 05:22:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18364325658533419811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10618578326948988337.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 454 rows 463 cols 3290 entries
Finished phase 1 with 268 SingleSign rule and 111 generalized
[2026-05-25 05:22:44] [INFO ] Computed 86 invariants in 8 ms
Computed 86 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10618578326948988337.kers
Total runtime 8 ms.
[2026-05-25 05:22:49] [INFO ] Implicit Places using invariants in 4931 ms returned [15, 20, 164, 169, 190, 196, 216, 221, 244, 250, 272, 277, 298, 303, 324, 329, 351, 357, 378, 383, 403, 411, 433, 438, 457, 463]
[2026-05-25 05:22:49] [INFO ] Actually due to overlaps returned [169, 164]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4935 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 463/486 places, 454/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 453
Applied a total of 2 rules in 21 ms. Remains 462 /463 variables (removed 1) and now considering 453/454 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-993480699961748908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17807129740152982269.kers'
[2026-05-25 05:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-993480699961748908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17807129740152982269.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 453 rows 460 cols 3226 entries
Finished phase 1 with 267 SingleSign rule and 111 generalized
[2026-05-25 05:22:49] [INFO ] Computed 84 invariants in 8 ms
Computed 84 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17807129740152982269.kers
Total runtime 9 ms.
[2026-05-25 05:22:54] [INFO ] Implicit Places using invariants in 4908 ms returned [15, 20, 187, 193, 213, 218, 241, 247, 269, 274, 295, 300, 321, 326, 348, 354, 375, 380, 400, 408, 430, 435, 454, 460]
[2026-05-25 05:22:54] [INFO ] Actually due to overlaps returned [193, 187]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4914 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 460/486 places, 453/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 452
Applied a total of 2 rules in 23 ms. Remains 459 /460 variables (removed 1) and now considering 452/453 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13400649655175884765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2798618080014777531.kers'
[2026-05-25 05:22:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13400649655175884765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2798618080014777531.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 452 rows 457 cols 3167 entries
Finished phase 1 with 268 SingleSign rule and 109 generalized
[2026-05-25 05:22:54] [INFO ] Computed 82 invariants in 8 ms
Computed 82 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2798618080014777531.kers
Total runtime 9 ms.
[2026-05-25 05:22:58] [INFO ] Implicit Places using invariants in 4173 ms returned [15, 20, 210, 215, 238, 244, 266, 271, 292, 297, 318, 323, 345, 351, 372, 377, 397, 405, 427, 432, 451, 457]
[2026-05-25 05:22:58] [INFO ] Actually due to overlaps returned [215, 210]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 457/486 places, 452/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 451
Applied a total of 2 rules in 27 ms. Remains 456 /457 variables (removed 1) and now considering 451/452 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17365228581417829393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11307011872589477123.kers'
[2026-05-25 05:22:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17365228581417829393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11307011872589477123.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 451 rows 454 cols 3113 entries
Finished phase 1 with 267 SingleSign rule and 109 generalized
[2026-05-25 05:22:58] [INFO ] Computed 80 invariants in 8 ms
Computed 80 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11307011872589477123.kers
Total runtime 9 ms.
[2026-05-25 05:23:02] [INFO ] Implicit Places using invariants in 3601 ms returned [15, 20, 235, 241, 263, 268, 289, 294, 315, 320, 342, 348, 369, 374, 394, 402, 424, 429, 448, 454]
[2026-05-25 05:23:02] [INFO ] Actually due to overlaps returned [241, 235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3604 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 454/486 places, 451/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 450
Applied a total of 2 rules in 24 ms. Remains 453 /454 variables (removed 1) and now considering 450/451 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15123453591383311230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16544334333197258948.kers'
[2026-05-25 05:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15123453591383311230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16544334333197258948.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 450 rows 451 cols 3064 entries
Finished phase 1 with 267 SingleSign rule and 108 generalized
[2026-05-25 05:23:02] [INFO ] Computed 78 invariants in 15 ms
Computed 78 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-16544334333197258948.kers
Total runtime 17 ms.
[2026-05-25 05:23:05] [INFO ] Implicit Places using invariants in 3510 ms returned [15, 20, 260, 265, 286, 291, 312, 317, 339, 345, 366, 371, 391, 399, 421, 426, 445, 451]
[2026-05-25 05:23:05] [INFO ] Actually due to overlaps returned [265, 260]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3513 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 451/486 places, 450/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 449
Applied a total of 2 rules in 22 ms. Remains 450 /451 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7873301166278326632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14943063695467538463.kers'
[2026-05-25 05:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7873301166278326632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14943063695467538463.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 449 rows 448 cols 3020 entries
Finished phase 1 with 267 SingleSign rule and 107 generalized
[2026-05-25 05:23:05] [INFO ] Computed 76 invariants in 8 ms
Computed 76 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14943063695467538463.kers
Total runtime 10 ms.
[2026-05-25 05:23:08] [INFO ] Implicit Places using invariants in 2997 ms returned [15, 20, 283, 288, 309, 314, 336, 342, 363, 368, 388, 396, 418, 423, 442, 448]
[2026-05-25 05:23:08] [INFO ] Actually due to overlaps returned [288, 283]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3000 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 448/486 places, 449/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 448
Applied a total of 2 rules in 26 ms. Remains 447 /448 variables (removed 1) and now considering 448/449 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16943860145312306035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16164753952240355372.kers'
[2026-05-25 05:23:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16943860145312306035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16164753952240355372.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 448 rows 445 cols 2981 entries
Finished phase 1 with 267 SingleSign rule and 106 generalized
[2026-05-25 05:23:09] [INFO ] Computed 74 invariants in 7 ms
Computed 74 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16164753952240355372.kers
Total runtime 10 ms.
[2026-05-25 05:23:12] [INFO ] Implicit Places using invariants in 3094 ms returned [15, 20, 306, 311, 333, 339, 360, 365, 385, 393, 415, 420, 439, 445]
[2026-05-25 05:23:12] [INFO ] Actually due to overlaps returned [311, 306]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3099 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 445/486 places, 448/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 447
Applied a total of 2 rules in 17 ms. Remains 444 /445 variables (removed 1) and now considering 447/448 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17226475607930456705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12069210124696274586.kers'
[2026-05-25 05:23:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17226475607930456705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12069210124696274586.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 447 rows 442 cols 2947 entries
Finished phase 1 with 267 SingleSign rule and 105 generalized
[2026-05-25 05:23:12] [INFO ] Computed 72 invariants in 7 ms
Computed 72 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12069210124696274586.kers
Total runtime 9 ms.
[2026-05-25 05:23:14] [INFO ] Implicit Places using invariants in 2739 ms returned [15, 20, 330, 336, 357, 362, 382, 390, 412, 417, 436, 442]
[2026-05-25 05:23:14] [INFO ] Actually due to overlaps returned [336, 330]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2742 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 442/486 places, 447/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 446
Applied a total of 2 rules in 18 ms. Remains 441 /442 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13411993206266042123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12434066576335628192.kers'
[2026-05-25 05:23:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13411993206266042123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12434066576335628192.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 446 rows 439 cols 2918 entries
Finished phase 1 with 267 SingleSign rule and 104 generalized
[2026-05-25 05:23:14] [INFO ] Computed 70 invariants in 7 ms
Computed 70 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12434066576335628192.kers
Total runtime 10 ms.
[2026-05-25 05:23:17] [INFO ] Implicit Places using invariants in 2456 ms returned [15, 20, 354, 359, 379, 387, 409, 414, 433, 439]
[2026-05-25 05:23:17] [INFO ] Actually due to overlaps returned [359, 354]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2460 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 439/486 places, 446/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 445
Applied a total of 2 rules in 19 ms. Remains 438 /439 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15518867188845531667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17676381318716775664.kers'
[2026-05-25 05:23:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15518867188845531667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17676381318716775664.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 445 rows 436 cols 2894 entries
Finished phase 1 with 267 SingleSign rule and 103 generalized
[2026-05-25 05:23:17] [INFO ] Computed 68 invariants in 10 ms
Computed 68 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17676381318716775664.kers
Total runtime 13 ms.
[2026-05-25 05:23:19] [INFO ] Implicit Places using invariants in 2457 ms returned [15, 20, 376, 384, 406, 411, 430, 436]
[2026-05-25 05:23:19] [INFO ] Actually due to overlaps returned [384, 376]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 436/486 places, 445/461 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 445
Applied a total of 1 rules in 23 ms. Remains 436 /436 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10465170090130085436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12443669459285478323.kers'
[2026-05-25 05:23:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10465170090130085436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12443669459285478323.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 445 rows 434 cols 2877 entries
Finished phase 1 with 268 SingleSign rule and 102 generalized
[2026-05-25 05:23:19] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12443669459285478323.kers
Total runtime 10 ms.
[2026-05-25 05:23:22] [INFO ] Implicit Places using invariants in 2165 ms returned [15, 20, 404, 409, 428, 434]
[2026-05-25 05:23:22] [INFO ] Actually due to overlaps returned [409, 404]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2170 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 434/486 places, 445/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 444
Applied a total of 2 rules in 16 ms. Remains 433 /434 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4253534690452392010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1140407968141261745.kers'
[2026-05-25 05:23:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4253534690452392010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1140407968141261745.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 444 rows 431 cols 2863 entries
Finished phase 1 with 267 SingleSign rule and 102 generalized
[2026-05-25 05:23:22] [INFO ] Computed 64 invariants in 17 ms
Computed 64 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-1140407968141261745.kers
Total runtime 18 ms.
[2026-05-25 05:23:24] [INFO ] Implicit Places using invariants in 2348 ms returned [15, 20, 425, 431]
[2026-05-25 05:23:24] [INFO ] Actually due to overlaps returned [425, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2352 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 431/486 places, 444/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 430 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 430 transition count 443
Applied a total of 3 rules in 30 ms. Remains 430 /431 variables (removed 1) and now considering 443/444 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-82662507576221836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-213375195282659474.kers'
[2026-05-25 05:23:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-82662507576221836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-213375195282659474.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 443 rows 428 cols 2853 entries
Finished phase 1 with 266 SingleSign rule and 102 generalized
[2026-05-25 05:23:24] [INFO ] Computed 62 invariants in 6 ms
Computed 62 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-213375195282659474.kers
Total runtime 7 ms.
[2026-05-25 05:23:26] [INFO ] Implicit Places using invariants in 2231 ms returned [428]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2233 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 429/486 places, 443/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 442
Applied a total of 2 rules in 18 ms. Remains 428 /429 variables (removed 1) and now considering 442/443 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17832671362821310633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4184416450970052112.kers'
[2026-05-25 05:23:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17832671362821310633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4184416450970052112.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 442 rows 426 cols 2847 entries
Finished phase 1 with 265 SingleSign rule and 102 generalized
[2026-05-25 05:23:26] [INFO ] Computed 61 invariants in 8 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4184416450970052112.kers
Total runtime 9 ms.
[2026-05-25 05:23:29] [INFO ] Implicit Places using invariants in 2453 ms returned []
[2026-05-25 05:23:29] [INFO ] Invariant cache hit.
[2026-05-25 05:23:29] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:23:39] [INFO ] Implicit Places using invariants and state equation in 10005 ms returned []
Implicit Place search using SMT with State Equation took 12461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 21 : 428/486 places, 442/461 transitions.
Finished structural reductions in REACHABILITY mode , in 21 iterations and 118623 ms. Remains : 428/486 places, 442/461 transitions.
[2026-05-25 05:23:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
RANDOM walk for 1000000 steps (144244 resets) in 932 ms. (1071 steps per ms)
BEST_FIRST walk for 13000005 steps (1188438 resets) in 8115 ms. (1601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
[2026-05-25 05:23:48] [INFO ] Invariant cache hit.
[2026-05-25 05:23:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:23:48] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 28 ms returned sat
[2026-05-25 05:23:48] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2026-05-25 05:23:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:23:48] [INFO ] [Real]Added 77 Read/Feed constraints in 244 ms returned sat
[2026-05-25 05:23:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:23:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:23:48] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:23:49] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2026-05-25 05:23:49] [INFO ] [Nat]Added 77 Read/Feed constraints in 500 ms returned sat
[2026-05-25 05:23:49] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:23:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1513 ms
[2026-05-25 05:23:52] [INFO ] Added : 105 causal constraints over 22 iterations in 2793 ms. Result :sat
Minimization took 1527 ms.
[2026-05-25 05:23:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:23:53] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 28 ms returned sat
[2026-05-25 05:23:54] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2026-05-25 05:23:54] [INFO ] [Real]Added 77 Read/Feed constraints in 326 ms returned sat
[2026-05-25 05:23:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:23:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:23:54] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:23:54] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2026-05-25 05:23:55] [INFO ] [Nat]Added 77 Read/Feed constraints in 721 ms returned sat
[2026-05-25 05:24:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6423 ms
[2026-05-25 05:24:02] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 23 ms.
[2026-05-25 05:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2026-05-25 05:24:09] [INFO ] Added : 137 causal constraints over 28 iterations in 7018 ms. Result :sat
Minimization took 1958 ms.
[2026-05-25 05:24:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:11] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:24:11] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2026-05-25 05:24:11] [INFO ] [Real]Added 77 Read/Feed constraints in 219 ms returned sat
[2026-05-25 05:24:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:24:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:24:11] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:24:12] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 05:24:12] [INFO ] [Nat]Added 77 Read/Feed constraints in 353 ms returned sat
[2026-05-25 05:24:12] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 26 ms.
[2026-05-25 05:24:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 820 ms
[2026-05-25 05:24:14] [INFO ] Added : 88 causal constraints over 19 iterations in 2065 ms. Result :sat
Minimization took 1308 ms.
[2026-05-25 05:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:24:15] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 23 ms returned sat
[2026-05-25 05:24:16] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2026-05-25 05:24:16] [INFO ] [Real]Added 77 Read/Feed constraints in 197 ms returned sat
[2026-05-25 05:24:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:24:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:16] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:24:17] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2026-05-25 05:24:17] [INFO ] [Nat]Added 77 Read/Feed constraints in 398 ms returned sat
[2026-05-25 05:24:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2536 ms
[2026-05-25 05:24:20] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 19 ms.
[2026-05-25 05:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2026-05-25 05:24:21] [INFO ] Added : 93 causal constraints over 19 iterations in 1559 ms. Result :sat
Minimization took 1089 ms.
[2026-05-25 05:24:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:22] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:24:23] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2026-05-25 05:24:23] [INFO ] [Real]Added 77 Read/Feed constraints in 829 ms returned sat
[2026-05-25 05:24:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:24:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:24] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:24:24] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2026-05-25 05:24:26] [INFO ] [Nat]Added 77 Read/Feed constraints in 1864 ms returned sat
[2026-05-25 05:24:26] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:24:40] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11041 ms
[2026-05-25 05:24:42] [INFO ] Added : 206 causal constraints over 42 iterations in 16033 ms. Result :sat
Minimization took 3854 ms.
[2026-05-25 05:24:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:46] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:24:46] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2026-05-25 05:24:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:24:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:24:46] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:24:47] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2026-05-25 05:24:48] [INFO ] [Nat]Added 77 Read/Feed constraints in 1704 ms returned sat
[2026-05-25 05:24:48] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 19 ms.
[2026-05-25 05:24:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2157 ms
[2026-05-25 05:25:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4444 ms
[2026-05-25 05:25:07] [INFO ] Added : 304 causal constraints over 63 iterations in 18533 ms. Result :sat
Minimization took 3859 ms.
[2026-05-25 05:25:11] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:25:11] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:25:11] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2026-05-25 05:25:11] [INFO ] [Real]Added 77 Read/Feed constraints in 397 ms returned sat
[2026-05-25 05:25:11] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 22 ms.
[2026-05-25 05:25:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:25:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:25:12] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 22 ms returned sat
[2026-05-25 05:25:12] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2026-05-25 05:25:12] [INFO ] [Nat]Added 77 Read/Feed constraints in 255 ms returned sat
[2026-05-25 05:25:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2026-05-25 05:25:13] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 16 ms.
[2026-05-25 05:25:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2616 ms
[2026-05-25 05:25:18] [INFO ] Added : 99 causal constraints over 22 iterations in 5251 ms. Result :sat
Minimization took 1162 ms.
[2026-05-25 05:25:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:25:19] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:25:20] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2026-05-25 05:25:20] [INFO ] [Real]Added 77 Read/Feed constraints in 245 ms returned sat
[2026-05-25 05:25:20] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:25:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:25:20] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:25:20] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2026-05-25 05:25:21] [INFO ] [Nat]Added 77 Read/Feed constraints in 731 ms returned sat
[2026-05-25 05:25:21] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:25:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1588 ms
[2026-05-25 05:25:25] [INFO ] Added : 121 causal constraints over 25 iterations in 3503 ms. Result :sat
Minimization took 1541 ms.
[2026-05-25 05:25:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:25:26] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 05:25:27] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2026-05-25 05:25:27] [INFO ] [Real]Added 77 Read/Feed constraints in 605 ms returned sat
[2026-05-25 05:25:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:25:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:25:27] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:25:28] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2026-05-25 05:25:29] [INFO ] [Nat]Added 77 Read/Feed constraints in 1367 ms returned sat
[2026-05-25 05:25:29] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:25:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5717 ms
[2026-05-25 05:25:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2026-05-25 05:25:47] [INFO ] Added : 298 causal constraints over 61 iterations in 18048 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 05:25:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:25:52] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:25:52] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2026-05-25 05:25:53] [INFO ] [Real]Added 77 Read/Feed constraints in 618 ms returned sat
[2026-05-25 05:25:53] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:25:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:25:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:25:53] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 05:25:53] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2026-05-25 05:25:53] [INFO ] [Nat]Added 77 Read/Feed constraints in 359 ms returned sat
[2026-05-25 05:25:53] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:25:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1049 ms
[2026-05-25 05:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 541 ms
[2026-05-25 05:25:59] [INFO ] Added : 112 causal constraints over 24 iterations in 5618 ms. Result :sat
Minimization took 1140 ms.
[2026-05-25 05:26:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:26:00] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:26:01] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2026-05-25 05:26:01] [INFO ] [Real]Added 77 Read/Feed constraints in 289 ms returned sat
[2026-05-25 05:26:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:26:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:26:01] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:26:01] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2026-05-25 05:26:02] [INFO ] [Nat]Added 77 Read/Feed constraints in 413 ms returned sat
[2026-05-25 05:26:02] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:26:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7232 ms
[2026-05-25 05:26:10] [INFO ] Added : 88 causal constraints over 18 iterations in 8122 ms. Result :sat
Minimization took 1871 ms.
[2026-05-25 05:26:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:26:12] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:26:12] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2026-05-25 05:26:13] [INFO ] [Real]Added 77 Read/Feed constraints in 1195 ms returned sat
[2026-05-25 05:26:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:26:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:26:13] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:26:14] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2026-05-25 05:26:15] [INFO ] [Nat]Added 77 Read/Feed constraints in 1482 ms returned sat
[2026-05-25 05:26:15] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 19 ms.
[2026-05-25 05:26:19] [INFO ] Added : 159 causal constraints over 32 iterations in 4389 ms. Result :sat
Minimization took 1625 ms.
[2026-05-25 05:26:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:26:21] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:26:21] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2026-05-25 05:26:22] [INFO ] [Real]Added 77 Read/Feed constraints in 676 ms returned sat
[2026-05-25 05:26:22] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 20 ms.
[2026-05-25 05:26:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:26:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:26:22] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:26:23] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:26:24] [INFO ] [Nat]Added 77 Read/Feed constraints in 1737 ms returned sat
[2026-05-25 05:26:25] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2026-05-25 05:26:28] [INFO ] Added : 156 causal constraints over 32 iterations in 3137 ms. Result :sat
Minimization took 1116 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 22, 3, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3]
Support contains 13 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 428 /428 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 428/428 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 428 /428 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2026-05-25 05:28:45] [INFO ] Invariant cache hit.
[2026-05-25 05:28:48] [INFO ] Implicit Places using invariants in 2442 ms returned []
[2026-05-25 05:28:48] [INFO ] Invariant cache hit.
[2026-05-25 05:28:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:28:58] [INFO ] Implicit Places using invariants and state equation in 10018 ms returned []
Implicit Place search using SMT with State Equation took 12468 ms to find 0 implicit places.
[2026-05-25 05:28:58] [INFO ] Redundant transitions in 21 ms returned []
Running 441 sub problems to find dead transitions.
[2026-05-25 05:28:58] [INFO ] Invariant cache hit.
[2026-05-25 05:28:58] [INFO ] State equation strengthened by 77 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/870 variables, and 101 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 0/428 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 441/432 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/870 variables, and 142 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 0/428 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 9/432 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72894 ms. Remains : 428/428 places, 442/442 transitions.
RANDOM walk for 40000 steps (5758 resets) in 1118 ms. (35 steps per ms) remains 26/26 properties
[2026-05-25 05:29:59] [INFO ] Flatten gal took : 119 ms
BEST_FIRST walk for 4001 steps (369 resets) in 144 ms. (27 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (351 resets) in 89 ms. (44 steps per ms) remains 26/26 properties
[2026-05-25 05:29:59] [INFO ] Flatten gal took : 72 ms
BEST_FIRST walk for 4000 steps (348 resets) in 57 ms. (68 steps per ms) remains 26/26 properties
[2026-05-25 05:29:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality953528532642577711.gal : 24 ms
[2026-05-25 05:29:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7277653473829777358.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/ReachabilityCardinality953528532642577711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7277653473829777358.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (365 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (354 resets) in 88 ms. (44 steps per ms) remains 26/26 properties
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 ...327
BEST_FIRST walk for 4002 steps (370 resets) in 49 ms. (80 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (365 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
Loading property file /tmp/ReachabilityCardinality7277653473829777358.prop.
BEST_FIRST walk for 4002 steps (363 resets) in 65 ms. (60 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (361 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (363 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (385 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,26 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,26 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,26 properties remain. new max is 32
SDD size :14 after 19
BEST_FIRST walk for 4002 steps (360 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (348 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 64
SDD size :19 after 33
SDD proceeding with computation,26 properties remain. new max is 128
SDD size :33 after 40
SDD proceeding with computation,26 properties remain. new max is 256
SDD size :40 after 125
BEST_FIRST walk for 4000 steps (356 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 512
SDD size :125 after 218
SDD proceeding with computation,26 properties remain. new max is 1024
SDD size :218 after 415
BEST_FIRST walk for 4002 steps (376 resets) in 69 ms. (57 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (361 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 2048
SDD size :415 after 750
BEST_FIRST walk for 4002 steps (381 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (360 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (375 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 4096
SDD size :750 after 3411
BEST_FIRST walk for 4001 steps (372 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (369 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (370 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (376 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (362 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (361 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (357 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 8192
SDD size :3411 after 24081
SDD proceeding with computation,26 properties remain. new max is 16384
SDD size :24081 after 44970
Invariant property MIN6 does not hold.
SDD proceeding with computation,25 properties remain. new max is 16384
SDD size :44970 after 148232
SDD proceeding with computation,25 properties remain. new max is 32768
SDD size :148232 after 246030
Interrupted probabilistic random walk after 113411 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :1 out of 26
Probabilistic random walk after 113411 steps, saw 56713 distinct states, run finished after 3007 ms. (steps per millisecond=37 ) properties seen :1
[2026-05-25 05:30:02] [INFO ] Invariant cache hit.
[2026-05-25 05:30:02] [INFO ] State equation strengthened by 77 read => feed constraints.
SDD proceeding with computation,25 properties remain. new max is 65536
SDD size :246030 after 441080
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 320/333 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SMT process timed out in 5150ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 442/442 transitions.
Applied a total of 0 rules in 9 ms. Remains 428 /428 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 428/428 places, 442/442 transitions.
RANDOM walk for 40000 steps (5759 resets) in 360 ms. (110 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (372 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (370 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (367 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (363 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (364 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (382 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (361 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (352 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (358 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (369 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (366 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (374 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (369 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (363 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (382 resets) in 57 ms. (69 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (348 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (349 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (368 resets) in 45 ms. (86 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (340 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (353 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (370 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (366 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (373 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (366 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (356 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 192264 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 25
Probabilistic random walk after 192264 steps, saw 96150 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2026-05-25 05:30:11] [INFO ] Invariant cache hit.
[2026-05-25 05:30:11] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 320/333 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Invariant property MIN9 does not hold.
SDD proceeding with computation,24 properties remain. new max is 65536
SDD size :441080 after 2.5335e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX6 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX12 is UNSAT
At refinement iteration 5 (OVERLAPS) 82/415 variables, 33/91 constraints. Problems are: Problem set: 9 solved, 16 unsolved
SDD proceeding with computation,24 properties remain. new max is 131072
SDD size :2.5335e+06 after 3.9079e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 20/111 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 19/130 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 2/132 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 1/133 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 8/423 variables, 4/137 constraints. Problems are: Problem set: 9 solved, 16 unsolved
SDD proceeding with computation,24 properties remain. new max is 262144
SDD size :3.9079e+07 after 1.29228e+08
Detected timeout of ITS tools.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 11/148 constraints. Problems are: Problem set: 9 solved, 16 unsolved
[2026-05-25 05:30:49] [INFO ] Flatten gal took : 65 ms
[2026-05-25 05:30:49] [INFO ] Applying decomposition
[2026-05-25 05:30:49] [INFO ] Flatten gal took : 54 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/graph920420059548289700.txt' '-o' '/tmp/graph920420059548289700.bin' '-w' '/tmp/graph920420059548289700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph920420059548289700.bin' '-l' '-1' '-v' '-w' '/tmp/graph920420059548289700.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:30:49] [INFO ] Decomposing Gal with order
[2026-05-25 05:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:30:49] [INFO ] Removed a total of 212 redundant transitions.
[2026-05-25 05:30:49] [INFO ] Flatten gal took : 140 ms
[2026-05-25 05:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 48 ms.
[2026-05-25 05:30:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7658156877606737921.gal : 14 ms
[2026-05-25 05:30:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality940591551715284107.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/ReachabilityCardinality7658156877606737921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality940591551715284107.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 ...306
Loading property file /tmp/ReachabilityCardinality940591551715284107.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :21 after 46
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :46 after 54
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :54 after 92
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :92 after 137
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :137 after 315
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :315 after 638
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :638 after 2520
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/150 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/150 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 442/865 variables, 423/573 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/865 variables, 77/650 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/865 variables, 1/651 constraints. Problems are: Problem set: 9 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/865 variables, 0/651 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 5/870 variables, 5/656 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/870 variables, 2/658 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/870 variables, 0/658 constraints. Problems are: Problem set: 9 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 870/870 variables, and 658 constraints, problems are : Problem set: 9 solved, 16 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 428/428 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 316/327 variables, 19/19 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 41/60 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/60 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 88/415 variables, 36/96 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 49/145 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/145 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 8/423 variables, 4/149 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/151 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 20/171 constraints. Problems are: Problem set: 9 solved, 16 unsolved
Detected timeout of ITS tools.
SMT process timed out in 100549ms, After SMT, problems are : Problem set: 9 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 442/442 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 424 transition count 440
Applied a total of 8 rules in 21 ms. Remains 424 /428 variables (removed 4) and now considering 440/442 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 424/428 places, 440/442 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2]
[2026-05-25 05:31:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2]
RANDOM walk for 1000000 steps (144478 resets) in 902 ms. (1107 steps per ms)
BEST_FIRST walk for 13000008 steps (1189063 resets) in 8218 ms. (1581 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2]
[2026-05-25 05:32:01] [INFO ] Invariant cache hit.
[2026-05-25 05:32:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:01] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:32:01] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2026-05-25 05:32:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:32:01] [INFO ] [Real]Added 77 Read/Feed constraints in 252 ms returned sat
[2026-05-25 05:32:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:32:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:32:01] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:32:01] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2026-05-25 05:32:02] [INFO ] [Nat]Added 77 Read/Feed constraints in 495 ms returned sat
[2026-05-25 05:32:02] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:32:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1595 ms
[2026-05-25 05:32:05] [INFO ] Added : 105 causal constraints over 22 iterations in 2923 ms. Result :sat
Minimization took 1625 ms.
[2026-05-25 05:32:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:07] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:32:07] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2026-05-25 05:32:07] [INFO ] [Real]Added 77 Read/Feed constraints in 342 ms returned sat
[2026-05-25 05:32:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:32:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:07] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:32:08] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2026-05-25 05:32:08] [INFO ] [Nat]Added 77 Read/Feed constraints in 732 ms returned sat
[2026-05-25 05:32:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6718 ms
[2026-05-25 05:32:15] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2026-05-25 05:32:22] [INFO ] Added : 137 causal constraints over 28 iterations in 7316 ms. Result :sat
Minimization took 2086 ms.
[2026-05-25 05:32:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:25] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:32:25] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2026-05-25 05:32:25] [INFO ] [Real]Added 77 Read/Feed constraints in 235 ms returned sat
[2026-05-25 05:32:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:32:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:25] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:32:25] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-05-25 05:32:26] [INFO ] [Nat]Added 77 Read/Feed constraints in 346 ms returned sat
[2026-05-25 05:32:26] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 26 ms.
[2026-05-25 05:32:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 857 ms
[2026-05-25 05:32:28] [INFO ] Added : 88 causal constraints over 19 iterations in 2190 ms. Result :sat
Minimization took 1429 ms.
[2026-05-25 05:32:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:30] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:32:30] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-25 05:32:30] [INFO ] [Real]Added 77 Read/Feed constraints in 204 ms returned sat
[2026-05-25 05:32:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:32:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:30] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:32:31] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2026-05-25 05:32:31] [INFO ] [Nat]Added 77 Read/Feed constraints in 418 ms returned sat
[2026-05-25 05:32:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2715 ms
[2026-05-25 05:32:34] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 18 ms.
[2026-05-25 05:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2026-05-25 05:32:36] [INFO ] Added : 93 causal constraints over 19 iterations in 1607 ms. Result :sat
Minimization took 1257 ms.
[2026-05-25 05:32:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:32:37] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:32:37] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-25 05:32:38] [INFO ] [Real]Added 77 Read/Feed constraints in 873 ms returned sat
[2026-05-25 05:32:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:32:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:32:38] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:32:38] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 05:32:40] [INFO ] [Nat]Added 77 Read/Feed constraints in 1894 ms returned sat
[2026-05-25 05:32:40] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 23 ms.
[2026-05-25 05:32:56] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11815 ms
[2026-05-25 05:32:57] [INFO ] Added : 206 causal constraints over 42 iterations in 16986 ms. Result :sat
Minimization took 4084 ms.
[2026-05-25 05:33:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:33:02] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:33:02] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2026-05-25 05:33:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:33:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:33:02] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:33:02] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2026-05-25 05:33:04] [INFO ] [Nat]Added 77 Read/Feed constraints in 1777 ms returned sat
[2026-05-25 05:33:04] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 22 ms.
[2026-05-25 05:33:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2204 ms
[2026-05-25 05:33:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4389 ms
[2026-05-25 05:33:23] [INFO ] Added : 304 causal constraints over 63 iterations in 18718 ms. Result :sat
Minimization took 3935 ms.
[2026-05-25 05:33:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:33:27] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned unsat
[2026-05-25 05:33:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:33:27] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:33:27] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2026-05-25 05:33:28] [INFO ] [Real]Added 77 Read/Feed constraints in 247 ms returned sat
[2026-05-25 05:33:28] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:33:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:33:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:33:28] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:33:28] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2026-05-25 05:33:29] [INFO ] [Nat]Added 77 Read/Feed constraints in 731 ms returned sat
[2026-05-25 05:33:29] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:33:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1649 ms
[2026-05-25 05:33:33] [INFO ] Added : 121 causal constraints over 25 iterations in 3614 ms. Result :sat
Minimization took 1649 ms.
[2026-05-25 05:33:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:33:34] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 28 ms returned sat
[2026-05-25 05:33:35] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:33:35] [INFO ] [Real]Added 77 Read/Feed constraints in 609 ms returned sat
[2026-05-25 05:33:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:33:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:33:35] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 30 ms returned sat
[2026-05-25 05:33:36] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2026-05-25 05:33:37] [INFO ] [Nat]Added 77 Read/Feed constraints in 1374 ms returned sat
[2026-05-25 05:33:37] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 22 ms.
[2026-05-25 05:33:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5904 ms
[2026-05-25 05:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2026-05-25 05:33:56] [INFO ] Added : 298 causal constraints over 61 iterations in 18558 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 05:34:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:34:00] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 23 ms returned unsat
[2026-05-25 05:34:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:34:00] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 25 ms returned sat
[2026-05-25 05:34:00] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:34:01] [INFO ] [Real]Added 77 Read/Feed constraints in 296 ms returned sat
[2026-05-25 05:34:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:34:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:34:01] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 22 ms returned sat
[2026-05-25 05:34:01] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2026-05-25 05:34:02] [INFO ] [Nat]Added 77 Read/Feed constraints in 429 ms returned sat
[2026-05-25 05:34:02] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 23 ms.
[2026-05-25 05:34:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7348 ms
[2026-05-25 05:34:10] [INFO ] Added : 88 causal constraints over 18 iterations in 8248 ms. Result :sat
Minimization took 2002 ms.
[2026-05-25 05:34:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:34:12] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:34:12] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2026-05-25 05:34:14] [INFO ] [Real]Added 77 Read/Feed constraints in 1180 ms returned sat
[2026-05-25 05:34:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:34:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:34:14] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 29 ms returned sat
[2026-05-25 05:34:14] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2026-05-25 05:34:15] [INFO ] [Nat]Added 77 Read/Feed constraints in 1477 ms returned sat
[2026-05-25 05:34:15] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 21 ms.
[2026-05-25 05:34:20] [INFO ] Added : 159 causal constraints over 32 iterations in 4494 ms. Result :sat
Minimization took 1744 ms.
[2026-05-25 05:34:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:34:22] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:34:22] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2026-05-25 05:34:23] [INFO ] [Real]Added 77 Read/Feed constraints in 674 ms returned sat
[2026-05-25 05:34:23] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 19 ms.
[2026-05-25 05:34:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:34:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:34:23] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:34:23] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2026-05-25 05:34:25] [INFO ] [Nat]Added 77 Read/Feed constraints in 1726 ms returned sat
[2026-05-25 05:34:25] [INFO ] Computed and/alt/rep : 350/2169/350 causal constraints (skipped 91 transitions) in 23 ms.
[2026-05-25 05:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2026-05-25 05:34:28] [INFO ] Added : 156 causal constraints over 32 iterations in 3194 ms. Result :sat
Minimization took 1178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2]
FORMULA DoubleExponent-PT-020-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-020-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 2, 1, 2]
Support contains 11 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 442/442 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 424 transition count 440
Applied a total of 8 rules in 27 ms. Remains 424 /428 variables (removed 4) and now considering 440/442 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 424/428 places, 440/442 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-535461027376808081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-163253367201851754.kers'
[2026-05-25 05:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-535461027376808081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-163253367201851754.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 422 cols 2855 entries
Finished phase 1 with 261 SingleSign rule and 102 generalized
[2026-05-25 05:36:46] [INFO ] Computed 61 invariants in 7 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-163253367201851754.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (144278 resets) in 900 ms. (1109 steps per ms)
BEST_FIRST walk for 11000004 steps (1006242 resets) in 6848 ms. (1606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 2, 1, 2]
[2026-05-25 05:36:54] [INFO ] Invariant cache hit.
[2026-05-25 05:36:54] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:36:54] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:36:54] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2026-05-25 05:36:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 05:36:54] [INFO ] [Real]Added 80 Read/Feed constraints in 171 ms returned sat
[2026-05-25 05:36:54] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:36:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:36:54] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:36:55] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2026-05-25 05:36:55] [INFO ] [Nat]Added 80 Read/Feed constraints in 425 ms returned sat
[2026-05-25 05:36:55] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:37:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1220 ms
[2026-05-25 05:37:02] [INFO ] Added : 148 causal constraints over 31 iterations in 6502 ms. Result :sat
Minimization took 1924 ms.
[2026-05-25 05:37:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:37:04] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:37:04] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2026-05-25 05:37:04] [INFO ] [Real]Added 80 Read/Feed constraints in 213 ms returned sat
[2026-05-25 05:37:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:37:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:37:04] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 05:37:04] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2026-05-25 05:37:05] [INFO ] [Nat]Added 80 Read/Feed constraints in 952 ms returned sat
[2026-05-25 05:37:05] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:37:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:37:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:37:49] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:37:50] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2026-05-25 05:37:50] [INFO ] [Real]Added 80 Read/Feed constraints in 432 ms returned sat
[2026-05-25 05:37:50] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:37:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:37:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:37:50] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:37:50] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2026-05-25 05:37:51] [INFO ] [Nat]Added 80 Read/Feed constraints in 247 ms returned sat
[2026-05-25 05:37:51] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2026-05-25 05:37:51] [INFO ] Added : 57 causal constraints over 12 iterations in 797 ms. Result :sat
Minimization took 1118 ms.
[2026-05-25 05:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:37:53] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:37:53] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2026-05-25 05:37:53] [INFO ] [Real]Added 80 Read/Feed constraints in 419 ms returned sat
[2026-05-25 05:37:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:37:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:37:54] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:37:54] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2026-05-25 05:37:54] [INFO ] [Nat]Added 80 Read/Feed constraints in 506 ms returned sat
[2026-05-25 05:37:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1762 ms
[2026-05-25 05:37:56] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 16 ms.
[2026-05-25 05:37:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2026-05-25 05:37:58] [INFO ] Added : 95 causal constraints over 20 iterations in 1322 ms. Result :sat
Minimization took 1363 ms.
[2026-05-25 05:37:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:37:59] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:37:59] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2026-05-25 05:38:00] [INFO ] [Real]Added 80 Read/Feed constraints in 963 ms returned sat
[2026-05-25 05:38:00] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:38:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:38:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:38:00] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 05:38:01] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2026-05-25 05:38:02] [INFO ] [Nat]Added 80 Read/Feed constraints in 1642 ms returned sat
[2026-05-25 05:38:02] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:38:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3184 ms
[2026-05-25 05:38:15] [INFO ] Added : 269 causal constraints over 54 iterations in 12619 ms. Result :sat
Minimization took 3339 ms.
[2026-05-25 05:38:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:38:18] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:38:19] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2026-05-25 05:38:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:38:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:38:19] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:38:19] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2026-05-25 05:38:21] [INFO ] [Nat]Added 80 Read/Feed constraints in 1424 ms returned sat
[2026-05-25 05:38:21] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 26 ms.
[2026-05-25 05:38:42] [INFO ] Added : 315 causal constraints over 64 iterations in 21131 ms.(timeout) Result :sat
Minimization took 2141 ms.
[2026-05-25 05:38:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:38:44] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:38:44] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2026-05-25 05:38:45] [INFO ] [Real]Added 80 Read/Feed constraints in 417 ms returned sat
[2026-05-25 05:38:45] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:38:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:38:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:38:45] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:38:45] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 05:38:46] [INFO ] [Nat]Added 80 Read/Feed constraints in 703 ms returned sat
[2026-05-25 05:38:46] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 23 ms.
[2026-05-25 05:38:48] [INFO ] Added : 109 causal constraints over 22 iterations in 2258 ms. Result :sat
Minimization took 1163 ms.
[2026-05-25 05:38:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:38:50] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 22 ms returned sat
[2026-05-25 05:38:50] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2026-05-25 05:38:50] [INFO ] [Real]Added 80 Read/Feed constraints in 595 ms returned sat
[2026-05-25 05:38:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:38:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:38:50] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 30 ms returned sat
[2026-05-25 05:38:51] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-25 05:38:53] [INFO ] [Nat]Added 80 Read/Feed constraints in 1872 ms returned sat
[2026-05-25 05:38:53] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:39:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9228 ms
[2026-05-25 05:39:06] [INFO ] Added : 179 causal constraints over 36 iterations in 13200 ms. Result :sat
Minimization took 1557 ms.
[2026-05-25 05:39:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:39:07] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:39:08] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-25 05:39:08] [INFO ] [Real]Added 80 Read/Feed constraints in 299 ms returned sat
[2026-05-25 05:39:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:39:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:39:08] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:39:08] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2026-05-25 05:39:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 419 ms returned sat
[2026-05-25 05:39:09] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 24 ms.
[2026-05-25 05:39:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 972 ms
[2026-05-25 05:39:11] [INFO ] Added : 76 causal constraints over 17 iterations in 1726 ms. Result :sat
Minimization took 1722 ms.
[2026-05-25 05:39:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:39:12] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:39:13] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-25 05:39:14] [INFO ] [Real]Added 80 Read/Feed constraints in 1081 ms returned sat
[2026-05-25 05:39:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:39:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:39:14] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:39:14] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2026-05-25 05:39:15] [INFO ] [Nat]Added 80 Read/Feed constraints in 1307 ms returned sat
[2026-05-25 05:39:16] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 19 ms.
[2026-05-25 05:39:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4891 ms
[2026-05-25 05:39:29] [INFO ] Added : 209 causal constraints over 42 iterations in 13189 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 05:39:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:39:33] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:39:34] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-25 05:39:34] [INFO ] [Real]Added 80 Read/Feed constraints in 640 ms returned sat
[2026-05-25 05:39:34] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:39:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:39:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:39:34] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 05:39:35] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-25 05:39:36] [INFO ] [Nat]Added 80 Read/Feed constraints in 1530 ms returned sat
[2026-05-25 05:39:36] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:39:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2026-05-25 05:39:39] [INFO ] Added : 147 causal constraints over 30 iterations in 3052 ms. Result :sat
Minimization took 1170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 2, 1, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 2, 2, 2, 1, 1, 1, 2, 1, 2]
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 05:42:14] [INFO ] Invariant cache hit.
[2026-05-25 05:42:16] [INFO ] Implicit Places using invariants in 2143 ms returned []
[2026-05-25 05:42:16] [INFO ] Invariant cache hit.
[2026-05-25 05:42:16] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 05:42:25] [INFO ] Implicit Places using invariants and state equation in 9373 ms returned []
Implicit Place search using SMT with State Equation took 11517 ms to find 0 implicit places.
[2026-05-25 05:42:25] [INFO ] Redundant transitions in 13 ms returned []
Running 439 sub problems to find dead transitions.
[2026-05-25 05:42:25] [INFO ] Invariant cache hit.
[2026-05-25 05:42:25] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/864 variables, and 98 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 0/424 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 439/430 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/864 variables, and 158 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 0/424 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 9/430 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71776 ms. Remains : 424/424 places, 440/440 transitions.
[2026-05-25 05:43:26] [INFO ] Flatten gal took : 34 ms
[2026-05-25 05:43:26] [INFO ] Flatten gal took : 57 ms
[2026-05-25 05:43:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15924424362487312713.gal : 11 ms
[2026-05-25 05:43:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1760370193145198924.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/ReachabilityCardinality15924424362487312713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1760370193145198924.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
RANDOM walk for 40000 steps (5808 resets) in 611 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (367 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (359 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality1760370193145198924.prop.
BEST_FIRST walk for 4002 steps (371 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (361 resets) in 76 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (370 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (372 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :14 after 19
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :19 after 33
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :33 after 40
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :40 after 125
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :125 after 218
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :218 after 415
BEST_FIRST walk for 4002 steps (341 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 2048
BEST_FIRST walk for 4002 steps (357 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
SDD size :415 after 750
BEST_FIRST walk for 4002 steps (363 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (379 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (367 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (368 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (368 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (382 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (365 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (348 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :750 after 3535
BEST_FIRST walk for 4000 steps (365 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (376 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (363 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (368 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (379 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :3535 after 24499
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :24499 after 45890
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :45890 after 151868
Interrupted probabilistic random walk after 148374 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 22
Probabilistic random walk after 148374 steps, saw 74195 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2026-05-25 05:43:29] [INFO ] Invariant cache hit.
[2026-05-25 05:43:29] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :151868 after 345842
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX8 is UNSAT
Problem MAX10 is UNSAT
At refinement iteration 5 (OVERLAPS) 88/409 variables, 35/83 constraints. Problems are: Problem set: 6 solved, 16 unsolved
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :345842 after 724045
SMT process timed out in 5087ms, After SMT, problems are : Problem set: 6 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 424/424 places, 440/440 transitions.
RANDOM walk for 40000 steps (5778 resets) in 273 ms. (145 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (362 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (379 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (345 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (356 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (361 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (360 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (366 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (354 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (360 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (360 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (361 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (361 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (376 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (350 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (375 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (382 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 152930 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 16
Probabilistic random walk after 152930 steps, saw 76477 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2026-05-25 05:43:38] [INFO ] Invariant cache hit.
[2026-05-25 05:43:38] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 88/409 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :724045 after 6.23178e+07
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 10/419 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 440/859 variables, 419/545 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 80/625 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 5/864 variables, 5/630 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/864 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/864 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 864/864 variables, and 632 constraints, problems are : Problem set: 0 solved, 16 unsolved in 27989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 424/424 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 88/409 variables, 35/76 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 10/419 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :6.23178e+07 after 2.4215e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Detected timeout of ITS tools.
[2026-05-25 05:44:16] [INFO ] Flatten gal took : 23 ms
[2026-05-25 05:44:16] [INFO ] Applying decomposition
[2026-05-25 05:44:16] [INFO ] Flatten gal took : 23 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/graph16687139610048275020.txt' '-o' '/tmp/graph16687139610048275020.bin' '-w' '/tmp/graph16687139610048275020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16687139610048275020.bin' '-l' '-1' '-v' '-w' '/tmp/graph16687139610048275020.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:44:16] [INFO ] Decomposing Gal with order
[2026-05-25 05:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:44:16] [INFO ] Removed a total of 219 redundant transitions.
[2026-05-25 05:44:16] [INFO ] Flatten gal took : 118 ms
[2026-05-25 05:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 31 ms.
[2026-05-25 05:44:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11774909260320482767.gal : 27 ms
[2026-05-25 05:44:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6518612690982024147.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/ReachabilityCardinality11774909260320482767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6518612690982024147.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/ReachabilityCardinality6518612690982024147.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :40 after 60
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :60 after 1155
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1155 after 45023
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :45023 after 747140
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :747140 after 747335
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :747335 after 747722
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 17/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 440/859 variables, 419/603 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 80/683 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/864 variables, and 699 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 419/424 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 125/125 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73009ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 05:44:51] [INFO ] Invariant cache hit.
[2026-05-25 05:44:53] [INFO ] Implicit Places using invariants in 2149 ms returned []
[2026-05-25 05:44:53] [INFO ] Invariant cache hit.
[2026-05-25 05:44:53] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 05:45:02] [INFO ] Implicit Places using invariants and state equation in 9457 ms returned []
Implicit Place search using SMT with State Equation took 11621 ms to find 0 implicit places.
[2026-05-25 05:45:02] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11647 ms. Remains : 424/424 places, 440/440 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 424 transition count 404
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 388 transition count 404
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 370 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 370 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 369 transition count 385
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 369 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 367 transition count 383
Applied a total of 114 rules in 57 ms. Remains 367 /424 variables (removed 57) and now considering 383/440 (removed 57) transitions.
Running SMT prover for 16 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8039371231481030844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1962461300407600085.kers'
[2026-05-25 05:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8039371231481030844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1962461300407600085.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 383 rows 365 cols 2685 entries
Finished phase 1 with 209 SingleSign rule and 97 generalized
[2026-05-25 05:45:02] [INFO ] Computed 61 invariants in 11 ms
Computed 61 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1962461300407600085.kers
Total runtime 11 ms.
[2026-05-25 05:45:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:45:03] [INFO ] [Real]Absence check using 4 positive and 57 generalized place invariants in 35 ms returned sat
[2026-05-25 05:45:03] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-25 05:45:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:45:03] [INFO ] [Nat]Absence check using 4 positive and 57 generalized place invariants in 19 ms returned sat
[2026-05-25 05:45:04] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-25 05:45:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 05:45:04] [INFO ] After 517ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-25 05:45:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2026-05-25 05:45:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2026-05-25 05:45:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2026-05-25 05:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-25 05:45:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
Detected timeout of ITS tools.
[2026-05-25 05:45:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1072 ms
TRAPS : Iteration 1
[2026-05-25 05:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-25 05:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-25 05:45:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1474 ms
[2026-05-25 05:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2026-05-25 05:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 2
[2026-05-25 05:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2026-05-25 05:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2026-05-25 05:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2026-05-25 05:45:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1747 ms
TRAPS : Iteration 3
[2026-05-25 05:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2026-05-25 05:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2026-05-25 05:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2026-05-25 05:49:41] [INFO ] Trap strengthening (SAT) tested/added 422/421 trap constraints in 266751 ms
TRAPS : Iteration 4
[2026-05-25 05:50:05] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 20996 ms
[2026-05-25 05:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2026-05-25 05:50:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 610 ms
[2026-05-25 05:50:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1527 ms
TRAPS : Iteration 5
[2026-05-25 05:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2026-05-25 05:50:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2117 ms
SMT process timed out, exceeded limit of 225
[2026-05-25 05:52:33] [INFO ] After 449497ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :16
[2026-05-25 05:52:33] [INFO ] After 450261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
[2026-05-25 05:52:33] [INFO ] Flatten gal took : 17 ms
[2026-05-25 05:52:33] [INFO ] Flatten gal took : 16 ms
[2026-05-25 05:52:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3827665898135703110.gal : 4 ms
[2026-05-25 05:52:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality684275340898191037.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/ReachabilityCardinality3827665898135703110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality684275340898191037.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 ...327
Loading property file /tmp/ReachabilityCardinality684275340898191037.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :159 after 192
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :192 after 872
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :872 after 3630
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3630 after 16757
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :16757 after 53831
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :53831 after 138670
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :138670 after 403221
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :403221 after 1.04165e+06
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :1.04165e+06 after 2.40938e+06
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :2.40938e+06 after 5.58821e+06
Detected timeout of ITS tools.
[2026-05-25 05:52:48] [INFO ] Flatten gal took : 19 ms
[2026-05-25 05:52:48] [INFO ] Applying decomposition
[2026-05-25 05:52:48] [INFO ] Flatten gal took : 23 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/graph2759398406126664876.txt' '-o' '/tmp/graph2759398406126664876.bin' '-w' '/tmp/graph2759398406126664876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2759398406126664876.bin' '-l' '-1' '-v' '-w' '/tmp/graph2759398406126664876.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:52:48] [INFO ] Decomposing Gal with order
[2026-05-25 05:52:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:52:48] [INFO ] Removed a total of 245 redundant transitions.
[2026-05-25 05:52:48] [INFO ] Flatten gal took : 37 ms
[2026-05-25 05:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 10 ms.
[2026-05-25 05:52:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11916448007082382720.gal : 7 ms
[2026-05-25 05:52:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5804065966175816703.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/ReachabilityCardinality11916448007082382720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5804065966175816703.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/ReachabilityCardinality5804065966175816703.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 27925
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 481289 ms.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17370429281888146491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17240519500792518578.kers'
[2026-05-25 05:53:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17370429281888146491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17240519500792518578.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 422 cols 2855 entries
Finished phase 1 with 261 SingleSign rule and 102 generalized
[2026-05-25 05:53:04] [INFO ] Computed 61 invariants in 6 ms
Computed 61 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17240519500792518578.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (144478 resets) in 864 ms. (1156 steps per ms)
BEST_FIRST walk for 11000003 steps (1006019 resets) in 6729 ms. (1634 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 05:53:11] [INFO ] Invariant cache hit.
[2026-05-25 05:53:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:53:11] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:53:11] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-25 05:53:11] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 05:53:12] [INFO ] [Real]Added 80 Read/Feed constraints in 168 ms returned sat
[2026-05-25 05:53:12] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:53:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:53:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:53:12] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:53:12] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2026-05-25 05:53:13] [INFO ] [Nat]Added 80 Read/Feed constraints in 419 ms returned sat
[2026-05-25 05:53:13] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:53:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1193 ms
[2026-05-25 05:53:19] [INFO ] Added : 148 causal constraints over 31 iterations in 6387 ms. Result :sat
Minimization took 1857 ms.
[2026-05-25 05:53:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:53:21] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:53:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-25 05:53:21] [INFO ] [Real]Added 80 Read/Feed constraints in 213 ms returned sat
[2026-05-25 05:53:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:53:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:53:21] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:53:22] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2026-05-25 05:53:23] [INFO ] [Nat]Added 80 Read/Feed constraints in 951 ms returned sat
[2026-05-25 05:53:23] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:54:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 05:54:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:07] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:54:07] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2026-05-25 05:54:08] [INFO ] [Real]Added 80 Read/Feed constraints in 438 ms returned sat
[2026-05-25 05:54:08] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:54:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:54:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:54:08] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 05:54:08] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2026-05-25 05:54:08] [INFO ] [Nat]Added 80 Read/Feed constraints in 250 ms returned sat
[2026-05-25 05:54:08] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 28 ms.
[2026-05-25 05:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-25 05:54:09] [INFO ] Added : 57 causal constraints over 12 iterations in 770 ms. Result :sat
Minimization took 1044 ms.
[2026-05-25 05:54:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:10] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:54:11] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2026-05-25 05:54:11] [INFO ] [Real]Added 80 Read/Feed constraints in 419 ms returned sat
[2026-05-25 05:54:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:54:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:11] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:54:12] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2026-05-25 05:54:12] [INFO ] [Nat]Added 80 Read/Feed constraints in 501 ms returned sat
[2026-05-25 05:54:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1727 ms
[2026-05-25 05:54:14] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 27 ms.
[2026-05-25 05:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2026-05-25 05:54:15] [INFO ] Added : 95 causal constraints over 20 iterations in 1336 ms. Result :sat
Minimization took 1260 ms.
[2026-05-25 05:54:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:16] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:54:17] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2026-05-25 05:54:18] [INFO ] [Real]Added 80 Read/Feed constraints in 948 ms returned sat
[2026-05-25 05:54:18] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:54:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:54:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:54:18] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:54:18] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2026-05-25 05:54:20] [INFO ] [Nat]Added 80 Read/Feed constraints in 1640 ms returned sat
[2026-05-25 05:54:20] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 05:54:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3202 ms
[2026-05-25 05:54:32] [INFO ] Added : 269 causal constraints over 54 iterations in 12569 ms. Result :sat
Minimization took 3256 ms.
[2026-05-25 05:54:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:36] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 25 ms returned sat
[2026-05-25 05:54:36] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2026-05-25 05:54:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:54:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:54:36] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:54:36] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2026-05-25 05:54:38] [INFO ] [Nat]Added 80 Read/Feed constraints in 1411 ms returned sat
[2026-05-25 05:54:38] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 18 ms.
[2026-05-25 05:54:59] [INFO ] Added : 315 causal constraints over 64 iterations in 20605 ms.(timeout) Result :sat
Minimization took 2065 ms.
[2026-05-25 05:55:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:01] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:55:01] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2026-05-25 05:55:01] [INFO ] [Real]Added 80 Read/Feed constraints in 416 ms returned sat
[2026-05-25 05:55:01] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 19 ms.
[2026-05-25 05:55:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:55:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:55:02] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 05:55:02] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 05:55:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 697 ms returned sat
[2026-05-25 05:55:03] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 18 ms.
[2026-05-25 05:55:05] [INFO ] Added : 109 causal constraints over 22 iterations in 2225 ms. Result :sat
Minimization took 1089 ms.
[2026-05-25 05:55:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:06] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:55:06] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-25 05:55:07] [INFO ] [Real]Added 80 Read/Feed constraints in 585 ms returned sat
[2026-05-25 05:55:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:55:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:07] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 05:55:07] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2026-05-25 05:55:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 1857 ms returned sat
[2026-05-25 05:55:09] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 19 ms.
[2026-05-25 05:55:22] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9212 ms
[2026-05-25 05:55:22] [INFO ] Added : 179 causal constraints over 36 iterations in 13205 ms. Result :sat
Minimization took 1486 ms.
[2026-05-25 05:55:24] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:24] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 05:55:24] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2026-05-25 05:55:24] [INFO ] [Real]Added 80 Read/Feed constraints in 296 ms returned sat
[2026-05-25 05:55:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:55:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:25] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:55:25] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2026-05-25 05:55:25] [INFO ] [Nat]Added 80 Read/Feed constraints in 416 ms returned sat
[2026-05-25 05:55:25] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 05:55:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 933 ms
[2026-05-25 05:55:27] [INFO ] Added : 76 causal constraints over 17 iterations in 1700 ms. Result :sat
Minimization took 1662 ms.
[2026-05-25 05:55:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:29] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:55:29] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2026-05-25 05:55:30] [INFO ] [Real]Added 80 Read/Feed constraints in 1083 ms returned sat
[2026-05-25 05:55:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:55:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 05:55:30] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:55:30] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-25 05:55:32] [INFO ] [Nat]Added 80 Read/Feed constraints in 1298 ms returned sat
[2026-05-25 05:55:32] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 23 ms.
[2026-05-25 05:55:45] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4917 ms
[2026-05-25 05:55:45] [INFO ] Added : 209 causal constraints over 42 iterations in 13063 ms. Result :sat
Minimization took 4505 ms.
[2026-05-25 05:55:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:49] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:55:50] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2026-05-25 05:55:50] [INFO ] [Real]Added 80 Read/Feed constraints in 637 ms returned sat
[2026-05-25 05:55:50] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 05:55:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:55:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 05:55:51] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 05:55:51] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2026-05-25 05:55:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 1509 ms returned sat
[2026-05-25 05:55:52] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 18 ms.
[2026-05-25 05:55:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 500 ms
[2026-05-25 05:55:55] [INFO ] Added : 147 causal constraints over 30 iterations in 3025 ms. Result :sat
Minimization took 1178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 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, 0, 0] Max Struct:[1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 05:58:30] [INFO ] Invariant cache hit.
[2026-05-25 05:58:32] [INFO ] Implicit Places using invariants in 2140 ms returned []
[2026-05-25 05:58:32] [INFO ] Invariant cache hit.
[2026-05-25 05:58:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 05:58:41] [INFO ] Implicit Places using invariants and state equation in 9254 ms returned []
Implicit Place search using SMT with State Equation took 11396 ms to find 0 implicit places.
[2026-05-25 05:58:41] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11417 ms. Remains : 424/424 places, 440/440 transitions.
[2026-05-25 05:58:41] [INFO ] Flatten gal took : 33 ms
[2026-05-25 05:58:41] [INFO ] Flatten gal took : 15 ms
[2026-05-25 05:58:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11370296683042895058.gal : 4 ms
[2026-05-25 05:58:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13676882561343200824.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/ReachabilityCardinality11370296683042895058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13676882561343200824.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 ...330
Loading property file /tmp/ReachabilityCardinality13676882561343200824.prop.
RANDOM walk for 40000 steps (5718 resets) in 338 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (371 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (371 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (358 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (366 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
BEST_FIRST walk for 4000 steps (381 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :14 after 19
BEST_FIRST walk for 4001 steps (352 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :19 after 33
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :33 after 40
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :40 after 125
BEST_FIRST walk for 4001 steps (334 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :125 after 218
BEST_FIRST walk for 4002 steps (364 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :218 after 415
BEST_FIRST walk for 4002 steps (374 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (373 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (371 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :415 after 750
BEST_FIRST walk for 4003 steps (370 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (374 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (355 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (367 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4096
BEST_FIRST walk for 4001 steps (358 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
SDD size :750 after 3535
BEST_FIRST walk for 4002 steps (359 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (369 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (364 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (367 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (387 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (380 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :3535 after 24499
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :24499 after 45890
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :45890 after 151868
Interrupted probabilistic random walk after 166649 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 22
Probabilistic random walk after 166649 steps, saw 83336 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2026-05-25 05:58:45] [INFO ] Invariant cache hit.
[2026-05-25 05:58:45] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :151868 after 345842
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem MAX1 is UNSAT
At refinement iteration 5 (OVERLAPS) 88/409 variables, 35/81 constraints. Problems are: Problem set: 1 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :345842 after 724045
SMT process timed out in 5041ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 424/424 places, 440/440 transitions.
RANDOM walk for 40000 steps (5747 resets) in 334 ms. (119 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (374 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (375 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (379 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (371 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (369 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (365 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (377 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (356 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (354 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (360 resets) in 71 ms. (55 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (369 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (355 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (356 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (376 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (353 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (370 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (359 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (360 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (371 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (383 resets) in 59 ms. (66 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (368 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 176040 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 21
Probabilistic random walk after 176040 steps, saw 88038 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-25 05:58:53] [INFO ] Invariant cache hit.
[2026-05-25 05:58:53] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 88/409 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :724045 after 6.23178e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :6.23178e+07 after 2.4215e+08
Detected timeout of ITS tools.
[2026-05-25 05:59:31] [INFO ] Flatten gal took : 14 ms
[2026-05-25 05:59:31] [INFO ] Applying decomposition
[2026-05-25 05:59:31] [INFO ] Flatten gal took : 13 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/graph897849451267492613.txt' '-o' '/tmp/graph897849451267492613.bin' '-w' '/tmp/graph897849451267492613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph897849451267492613.bin' '-l' '-1' '-v' '-w' '/tmp/graph897849451267492613.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:59:31] [INFO ] Decomposing Gal with order
[2026-05-25 05:59:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:59:32] [INFO ] Removed a total of 230 redundant transitions.
[2026-05-25 05:59:32] [INFO ] Flatten gal took : 34 ms
[2026-05-25 05:59:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 13 ms.
[2026-05-25 05:59:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11040554382308605711.gal : 6 ms
[2026-05-25 05:59:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9568778217557651442.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/ReachabilityCardinality11040554382308605711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9568778217557651442.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/ReachabilityCardinality9568778217557651442.prop.
SDD proceeding with computation,21 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,21 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,21 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,21 properties remain. new max is 32
SDD size :15 after 17
SDD proceeding with computation,21 properties remain. new max is 64
SDD size :17 after 95
SDD proceeding with computation,21 properties remain. new max is 128
SDD size :95 after 1951
SMT process timed out in 47250ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 05:59:40] [INFO ] Invariant cache hit.
[2026-05-25 05:59:43] [INFO ] Implicit Places using invariants in 2411 ms returned []
[2026-05-25 05:59:43] [INFO ] Invariant cache hit.
[2026-05-25 05:59:43] [INFO ] State equation strengthened by 80 read => feed constraints.
SDD proceeding with computation,21 properties remain. new max is 256
SDD size :1951 after 747116
SDD proceeding with computation,21 properties remain. new max is 512
SDD size :747116 after 747311
SDD proceeding with computation,21 properties remain. new max is 1024
SDD size :747311 after 747698
[2026-05-25 05:59:52] [INFO ] Implicit Places using invariants and state equation in 9504 ms returned []
Implicit Place search using SMT with State Equation took 11924 ms to find 0 implicit places.
[2026-05-25 05:59:52] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11942 ms. Remains : 424/424 places, 440/440 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 424 transition count 404
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 388 transition count 404
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 370 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 370 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 369 transition count 385
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 369 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 367 transition count 383
Applied a total of 114 rules in 42 ms. Remains 367 /424 variables (removed 57) and now considering 383/440 (removed 57) transitions.
Running SMT prover for 21 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8526153467265845324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17723599854403967283.kers'
[2026-05-25 05:59:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8526153467265845324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17723599854403967283.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 383 rows 365 cols 2685 entries
Finished phase 1 with 209 SingleSign rule and 97 generalized
[2026-05-25 05:59:52] [INFO ] Computed 61 invariants in 7 ms
Computed 61 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17723599854403967283.kers
Total runtime 8 ms.
[2026-05-25 05:59:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:59:53] [INFO ] [Real]Absence check using 4 positive and 57 generalized place invariants in 30 ms returned sat
[2026-05-25 05:59:53] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2026-05-25 05:59:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:59:53] [INFO ] [Nat]Absence check using 4 positive and 57 generalized place invariants in 19 ms returned sat
[2026-05-25 05:59:54] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2026-05-25 05:59:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 05:59:54] [INFO ] After 576ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :21
TRAPS : Iteration 0
[2026-05-25 05:59:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2026-05-25 05:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2026-05-25 05:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2026-05-25 05:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-25 05:59:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
Detected timeout of ITS tools.
[2026-05-25 06:00:29] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 33038 ms
[2026-05-25 06:00:38] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 9044 ms
TRAPS : Iteration 1
[2026-05-25 06:00:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2026-05-25 06:00:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2026-05-25 06:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2026-05-25 06:00:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4020 ms
[2026-05-25 06:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2026-05-25 06:00:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 653 ms
TRAPS : Iteration 2
[2026-05-25 06:01:12] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 25952 ms
[2026-05-25 06:01:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2026-05-25 06:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2026-05-25 06:05:55] [INFO ] Trap strengthening (SAT) tested/added 186/185 trap constraints in 282095 ms
TRAPS : Iteration 3
[2026-05-25 06:05:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 328 ms
[2026-05-25 06:06:20] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 20902 ms
[2026-05-25 06:06:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1947 ms
TRAPS : Iteration 4
[2026-05-25 06:06:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
TRAPS : Iteration 5
SMT process timed out, exceeded limit of 225
[2026-05-25 06:07:23] [INFO ] After 449264ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :21
[2026-05-25 06:07:23] [INFO ] After 450137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
[2026-05-25 06:07:23] [INFO ] Flatten gal took : 16 ms
[2026-05-25 06:07:23] [INFO ] Flatten gal took : 12 ms
[2026-05-25 06:07:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15576516541923165557.gal : 7 ms
[2026-05-25 06:07:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2422248236218572300.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/ReachabilityCardinality15576516541923165557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2422248236218572300.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/ReachabilityCardinality2422248236218572300.prop.
SDD proceeding with computation,21 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,21 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,21 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,21 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,21 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,21 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,21 properties remain. new max is 256
SDD size :159 after 192
SDD proceeding with computation,21 properties remain. new max is 512
SDD size :192 after 872
SDD proceeding with computation,21 properties remain. new max is 1024
SDD size :872 after 3630
SDD proceeding with computation,21 properties remain. new max is 2048
SDD size :3630 after 16757
SDD proceeding with computation,21 properties remain. new max is 4096
SDD size :16757 after 53831
SDD proceeding with computation,21 properties remain. new max is 8192
SDD size :53831 after 138670
SDD proceeding with computation,21 properties remain. new max is 16384
SDD size :138670 after 403221
SDD proceeding with computation,21 properties remain. new max is 32768
SDD size :403221 after 1.04165e+06
SDD proceeding with computation,21 properties remain. new max is 65536
SDD size :1.04165e+06 after 2.40938e+06
SDD proceeding with computation,21 properties remain. new max is 131072
SDD size :2.40938e+06 after 5.58821e+06
Detected timeout of ITS tools.
[2026-05-25 06:07:38] [INFO ] Flatten gal took : 17 ms
[2026-05-25 06:07:38] [INFO ] Applying decomposition
[2026-05-25 06:07:38] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9065909970547388022.txt' '-o' '/tmp/graph9065909970547388022.bin' '-w' '/tmp/graph9065909970547388022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9065909970547388022.bin' '-l' '-1' '-v' '-w' '/tmp/graph9065909970547388022.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:07:38] [INFO ] Decomposing Gal with order
[2026-05-25 06:07:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:07:38] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-25 06:07:38] [INFO ] Flatten gal took : 51 ms
[2026-05-25 06:07:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 12 ms.
[2026-05-25 06:07:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10548616104573102855.gal : 6 ms
[2026-05-25 06:07:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16077472255527862893.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/ReachabilityCardinality10548616104573102855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16077472255527862893.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/ReachabilityCardinality16077472255527862893.prop.
SDD proceeding with computation,21 properties remain. new max is 4
SDD size :1 after 27388
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 480972 ms.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7651871463683853129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12737437585141602009.kers'
[2026-05-25 06:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7651871463683853129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12737437585141602009.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 440 rows 422 cols 2855 entries
Finished phase 1 with 261 SingleSign rule and 102 generalized
[2026-05-25 06:07:53] [INFO ] Computed 61 invariants in 6 ms
Computed 61 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12737437585141602009.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (144200 resets) in 935 ms. (1068 steps per ms)
BEST_FIRST walk for 11000005 steps (1004943 resets) in 6940 ms. (1584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 06:08:01] [INFO ] Invariant cache hit.
[2026-05-25 06:08:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:01] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:08:02] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2026-05-25 06:08:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 06:08:02] [INFO ] [Real]Added 80 Read/Feed constraints in 170 ms returned sat
[2026-05-25 06:08:02] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 23 ms.
[2026-05-25 06:08:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:08:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:02] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:08:02] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2026-05-25 06:08:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 426 ms returned sat
[2026-05-25 06:08:03] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 06:08:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1246 ms
[2026-05-25 06:08:09] [INFO ] Added : 148 causal constraints over 31 iterations in 6381 ms. Result :sat
Minimization took 1790 ms.
[2026-05-25 06:08:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:11] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:08:11] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-25 06:08:11] [INFO ] [Real]Added 80 Read/Feed constraints in 209 ms returned sat
[2026-05-25 06:08:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:08:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:11] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 06:08:12] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2026-05-25 06:08:13] [INFO ] [Nat]Added 80 Read/Feed constraints in 928 ms returned sat
[2026-05-25 06:08:13] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 27 ms.
[2026-05-25 06:08:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 06:08:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:56] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:08:57] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2026-05-25 06:08:57] [INFO ] [Real]Added 80 Read/Feed constraints in 426 ms returned sat
[2026-05-25 06:08:57] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 06:08:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:08:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:08:57] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 06:08:58] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2026-05-25 06:08:58] [INFO ] [Nat]Added 80 Read/Feed constraints in 242 ms returned sat
[2026-05-25 06:08:58] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 18 ms.
[2026-05-25 06:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2026-05-25 06:08:59] [INFO ] Added : 57 causal constraints over 12 iterations in 760 ms. Result :sat
Minimization took 999 ms.
[2026-05-25 06:09:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:00] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 18 ms returned sat
[2026-05-25 06:09:00] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2026-05-25 06:09:01] [INFO ] [Real]Added 80 Read/Feed constraints in 404 ms returned sat
[2026-05-25 06:09:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:09:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:01] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 06:09:01] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2026-05-25 06:09:02] [INFO ] [Nat]Added 80 Read/Feed constraints in 485 ms returned sat
[2026-05-25 06:09:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1802 ms
[2026-05-25 06:09:03] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 26 ms.
[2026-05-25 06:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2026-05-25 06:09:05] [INFO ] Added : 95 causal constraints over 20 iterations in 1302 ms. Result :sat
Minimization took 1241 ms.
[2026-05-25 06:09:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:06] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:06] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2026-05-25 06:09:07] [INFO ] [Real]Added 80 Read/Feed constraints in 939 ms returned sat
[2026-05-25 06:09:07] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 06:09:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:09:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:07] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:08] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-25 06:09:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 1594 ms returned sat
[2026-05-25 06:09:09] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 06:09:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3189 ms
[2026-05-25 06:09:22] [INFO ] Added : 269 causal constraints over 54 iterations in 12320 ms. Result :sat
Minimization took 3155 ms.
[2026-05-25 06:09:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:25] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:25] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2026-05-25 06:09:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:09:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:25] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 27 ms returned sat
[2026-05-25 06:09:26] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2026-05-25 06:09:27] [INFO ] [Nat]Added 80 Read/Feed constraints in 1407 ms returned sat
[2026-05-25 06:09:27] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 23 ms.
[2026-05-25 06:09:48] [INFO ] Added : 315 causal constraints over 64 iterations in 20906 ms.(timeout) Result :sat
Minimization took 2140 ms.
[2026-05-25 06:09:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:50] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:51] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2026-05-25 06:09:51] [INFO ] [Real]Added 80 Read/Feed constraints in 423 ms returned sat
[2026-05-25 06:09:51] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 06:09:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:09:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:51] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:51] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-25 06:09:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 708 ms returned sat
[2026-05-25 06:09:52] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 06:09:54] [INFO ] Added : 109 causal constraints over 22 iterations in 2232 ms. Result :sat
Minimization took 1095 ms.
[2026-05-25 06:09:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:56] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:56] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2026-05-25 06:09:56] [INFO ] [Real]Added 80 Read/Feed constraints in 589 ms returned sat
[2026-05-25 06:09:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:09:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:09:57] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:09:57] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2026-05-25 06:09:59] [INFO ] [Nat]Added 80 Read/Feed constraints in 1848 ms returned sat
[2026-05-25 06:09:59] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 18 ms.
[2026-05-25 06:10:12] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9177 ms
[2026-05-25 06:10:12] [INFO ] Added : 179 causal constraints over 36 iterations in 13176 ms. Result :sat
Minimization took 1468 ms.
[2026-05-25 06:10:13] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 06:10:13] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 06:10:14] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2026-05-25 06:10:14] [INFO ] [Real]Added 80 Read/Feed constraints in 299 ms returned sat
[2026-05-25 06:10:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:10:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:10:14] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:10:14] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-25 06:10:15] [INFO ] [Nat]Added 80 Read/Feed constraints in 416 ms returned sat
[2026-05-25 06:10:15] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 20 ms.
[2026-05-25 06:10:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 963 ms
[2026-05-25 06:10:16] [INFO ] Added : 76 causal constraints over 17 iterations in 1717 ms. Result :sat
Minimization took 1677 ms.
[2026-05-25 06:10:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:10:18] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:10:19] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2026-05-25 06:10:20] [INFO ] [Real]Added 80 Read/Feed constraints in 1108 ms returned sat
[2026-05-25 06:10:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:10:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:10:20] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 06:10:20] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 06:10:21] [INFO ] [Nat]Added 80 Read/Feed constraints in 1304 ms returned sat
[2026-05-25 06:10:21] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 22 ms.
[2026-05-25 06:10:34] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4807 ms
[2026-05-25 06:10:34] [INFO ] Added : 209 causal constraints over 42 iterations in 12934 ms. Result :sat
Minimization took 4505 ms.
[2026-05-25 06:10:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:10:39] [INFO ] [Real]Absence check using 2 positive and 59 generalized place invariants in 17 ms returned sat
[2026-05-25 06:10:39] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2026-05-25 06:10:40] [INFO ] [Real]Added 80 Read/Feed constraints in 630 ms returned sat
[2026-05-25 06:10:40] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 24 ms.
[2026-05-25 06:10:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 06:10:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-25 06:10:40] [INFO ] [Nat]Absence check using 2 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 06:10:40] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2026-05-25 06:10:42] [INFO ] [Nat]Added 80 Read/Feed constraints in 1482 ms returned sat
[2026-05-25 06:10:42] [INFO ] Computed and/alt/rep : 340/2138/340 causal constraints (skipped 99 transitions) in 21 ms.
[2026-05-25 06:10:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2026-05-25 06:10:45] [INFO ] Added : 147 causal constraints over 30 iterations in 2992 ms. Result :sat
Minimization took 1171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 19, 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, 0, 0] Max Struct:[1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 06:13:19] [INFO ] Invariant cache hit.
[2026-05-25 06:13:21] [INFO ] Implicit Places using invariants in 2115 ms returned []
[2026-05-25 06:13:21] [INFO ] Invariant cache hit.
[2026-05-25 06:13:22] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 06:13:31] [INFO ] Implicit Places using invariants and state equation in 9461 ms returned []
Implicit Place search using SMT with State Equation took 11578 ms to find 0 implicit places.
[2026-05-25 06:13:31] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11597 ms. Remains : 424/424 places, 440/440 transitions.
[2026-05-25 06:13:31] [INFO ] Flatten gal took : 16 ms
[2026-05-25 06:13:31] [INFO ] Flatten gal took : 13 ms
[2026-05-25 06:13:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15032247355387437850.gal : 3 ms
[2026-05-25 06:13:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12777406097708103544.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/ReachabilityCardinality15032247355387437850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12777406097708103544.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 ...330
RANDOM walk for 40000 steps (5779 resets) in 277 ms. (143 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality12777406097708103544.prop.
BEST_FIRST walk for 4001 steps (373 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (376 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (351 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (361 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (371 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (358 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (359 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (362 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (364 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (363 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
BEST_FIRST walk for 4003 steps (362 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :14 after 19
BEST_FIRST walk for 4000 steps (357 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :19 after 33
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :33 after 40
BEST_FIRST walk for 4003 steps (366 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :40 after 125
BEST_FIRST walk for 4002 steps (355 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :125 after 218
BEST_FIRST walk for 4004 steps (357 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :218 after 415
BEST_FIRST walk for 4001 steps (370 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (367 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :415 after 750
BEST_FIRST walk for 4001 steps (365 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (378 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (362 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :750 after 3535
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :3535 after 24499
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :24499 after 45890
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :45890 after 151868
Interrupted probabilistic random walk after 166775 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 22
Probabilistic random walk after 166775 steps, saw 83399 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2026-05-25 06:13:34] [INFO ] Invariant cache hit.
[2026-05-25 06:13:34] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :151868 after 345842
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem MAX1 is UNSAT
At refinement iteration 5 (OVERLAPS) 88/409 variables, 35/81 constraints. Problems are: Problem set: 1 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :345842 after 724045
SMT process timed out in 5073ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 424/424 places, 440/440 transitions.
RANDOM walk for 40000 steps (5768 resets) in 279 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (360 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (360 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (384 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (369 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (353 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (372 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (371 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (365 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (370 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (357 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (369 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (367 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (367 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (362 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (358 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (371 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (374 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (360 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (368 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (363 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (368 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 177464 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 21
Probabilistic random walk after 177464 steps, saw 88751 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-25 06:13:43] [INFO ] Invariant cache hit.
[2026-05-25 06:13:43] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 310/321 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 88/409 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :724045 after 6.23178e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :6.23178e+07 after 2.4215e+08
Detected timeout of ITS tools.
[2026-05-25 06:14:21] [INFO ] Flatten gal took : 14 ms
[2026-05-25 06:14:21] [INFO ] Applying decomposition
[2026-05-25 06:14:21] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11661079807755265922.txt' '-o' '/tmp/graph11661079807755265922.bin' '-w' '/tmp/graph11661079807755265922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11661079807755265922.bin' '-l' '-1' '-v' '-w' '/tmp/graph11661079807755265922.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:14:21] [INFO ] Decomposing Gal with order
[2026-05-25 06:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:14:21] [INFO ] Removed a total of 223 redundant transitions.
[2026-05-25 06:14:21] [INFO ] Flatten gal took : 32 ms
[2026-05-25 06:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 9 ms.
[2026-05-25 06:14:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18219122398068351690.gal : 6 ms
[2026-05-25 06:14:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality467039227996196925.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/ReachabilityCardinality18219122398068351690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality467039227996196925.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/ReachabilityCardinality467039227996196925.prop.
SDD proceeding with computation,21 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,21 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,21 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,21 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,21 properties remain. new max is 64
SDD size :53 after 218
SDD proceeding with computation,21 properties remain. new max is 128
SDD size :218 after 4281
SMT process timed out in 48540ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 424/424 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2026-05-25 06:14:31] [INFO ] Invariant cache hit.
[2026-05-25 06:14:33] [INFO ] Implicit Places using invariants in 2126 ms returned []
[2026-05-25 06:14:33] [INFO ] Invariant cache hit.
[2026-05-25 06:14:34] [INFO ] State equation strengthened by 80 read => feed constraints.
SDD proceeding with computation,21 properties remain. new max is 256
SDD size :4281 after 747116
SDD proceeding with computation,21 properties remain. new max is 512
SDD size :747116 after 747311
SDD proceeding with computation,21 properties remain. new max is 1024
SDD size :747311 after 747698
[2026-05-25 06:14:43] [INFO ] Implicit Places using invariants and state equation in 9574 ms returned []
Implicit Place search using SMT with State Equation took 11701 ms to find 0 implicit places.
[2026-05-25 06:14:43] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11724 ms. Remains : 424/424 places, 440/440 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 424 transition count 404
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 388 transition count 404
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 370 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 370 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 369 transition count 385
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 369 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 367 transition count 383
Applied a total of 114 rules in 30 ms. Remains 367 /424 variables (removed 57) and now considering 383/440 (removed 57) transitions.
Running SMT prover for 21 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10585689282422710251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7018052508882619301.kers'
[2026-05-25 06:14:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10585689282422710251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7018052508882619301.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 383 rows 365 cols 2685 entries
Finished phase 1 with 209 SingleSign rule and 97 generalized
[2026-05-25 06:14:43] [INFO ] Computed 61 invariants in 7 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7018052508882619301.kers
Total runtime 10 ms.
[2026-05-25 06:14:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 06:14:43] [INFO ] [Real]Absence check using 4 positive and 57 generalized place invariants in 21 ms returned sat
[2026-05-25 06:14:43] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2026-05-25 06:14:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 06:14:44] [INFO ] [Nat]Absence check using 4 positive and 57 generalized place invariants in 20 ms returned sat
[2026-05-25 06:14:44] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2026-05-25 06:14:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 06:14:45] [INFO ] After 578ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :21
TRAPS : Iteration 0
[2026-05-25 06:14:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2026-05-25 06:14:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-020"
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-020, 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-177955695800893"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "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 ;