About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFT?FTFF??F??TT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748945189021
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 10:06:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 10:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 10:06:32] [INFO ] Load time of PNML (sax parser for PT used): 819 ms
[2025-06-03 10:06:32] [INFO ] Transformed 5568 places.
[2025-06-03 10:06:32] [INFO ] Transformed 7799 transitions.
[2025-06-03 10:06:32] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 1138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1613 places :
Symmetric choice reduction at 1 with 1613 rule applications. Total rules 1645 place count 3923 transition count 6186
Iterating global reduction 1 with 1613 rules applied. Total rules applied 3258 place count 3923 transition count 6186
Discarding 1414 places :
Symmetric choice reduction at 1 with 1414 rule applications. Total rules 4672 place count 2509 transition count 4772
Iterating global reduction 1 with 1414 rules applied. Total rules applied 6086 place count 2509 transition count 4772
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 6301 place count 2294 transition count 3482
Iterating global reduction 1 with 215 rules applied. Total rules applied 6516 place count 2294 transition count 3482
Applied a total of 6516 rules in 1745 ms. Remains 2294 /5568 variables (removed 3274) and now considering 3482/7799 (removed 4317) transitions.
[2025-06-03 10:06:34] [INFO ] Flow matrix only has 3210 transitions (discarded 272 similar events)
// Phase 1: matrix 3210 rows 2294 cols
[2025-06-03 10:06:34] [INFO ] Computed 541 invariants in 220 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:41] [INFO ] Implicit Places using invariants in 6966 ms returned [4, 8, 12, 14, 16, 20, 22, 24, 29, 36, 48, 59, 72, 87, 103, 119, 121, 123, 125, 127, 129, 131, 145, 156, 165, 172, 177, 180, 207, 214, 217, 218, 219, 220, 221, 222, 223, 226, 231, 238, 247, 258, 271, 285, 299, 300, 301, 302, 303, 304, 305, 316, 325, 332, 337, 342, 369, 376, 379, 380, 382, 383, 384, 385, 389, 392, 397, 404, 413, 425, 437, 449, 450, 451, 452, 453, 454, 455, 464, 471, 476, 479, 481, 483, 510, 517, 520, 521, 522, 523, 524, 525, 526, 528, 530, 533, 538, 545, 554, 564, 574, 575, 576, 579, 580, 581, 590, 595, 599, 601, 603, 605, 632, 639, 642, 643, 644, 645, 646, 647, 648, 650, 652, 654, 657, 662, 669, 677, 685, 686, 687, 688, 689, 690, 691, 697, 700, 702, 704, 706, 708, 735, 742, 745, 746, 747, 748, 749, 750, 751, 753, 755, 757, 759, 762, 767, 773, 779, 780, 782, 783, 784, 785, 788, 790, 792, 794, 798, 800, 827, 834, 837, 838, 839, 840, 842, 843, 845, 847, 849, 853, 855, 858, 862, 866, 867, 868, 869, 870, 871, 872, 874, 876, 878, 880, 882, 884, 911, 918, 921, 922, 923, 924, 925, 926, 927, 929, 932, 934, 936, 938, 940, 942, 945, 946, 947, 948, 949, 950, 951, 953, 955, 957, 959, 961, 964, 991, 993, 997, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1008, 1010, 1012, 1014, 1016, 1018, 1020, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1068, 1075, 1078, 1079, 1080, 1081, 1082, 1084, 1088, 1090, 1092, 1094, 1096, 1098, 1100, 1103, 1104, 1105, 1106, 1107, 1109, 1113, 1115, 1117, 1119, 1121, 1123, 1150, 1157, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1168, 1170, 1172, 1174, 1176, 1178, 1181, 1186, 1187, 1188, 1190, 1191, 1192, 1195, 1197, 1199, 1201, 1206, 1208, 1242, 1245, 1246, 1247, 1249, 1250, 1251, 1255, 1257, 1260, 1263, 1265, 1268, 1273, 1280, 1281, 1282, 1284, 1285, 1286, 1291, 1297, 1299, 1301, 1303, 1305, 1332, 1339, 1343, 1344, 1345, 1346, 1347, 1348, 1353, 1355, 1357, 1359, 1362, 1367, 1374, 1383, 1384, 1385, 1386, 1387, 1389, 1396, 1401, 1404, 1406, 1408, 1410, 1440, 1447, 1450, 1451, 1452, 1454, 1455, 1456, 1458, 1460, 1462, 1465, 1470, 1477, 1489, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1515, 1522, 1527, 1530, 1532, 1534, 1561, 1568, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1579, 1581, 1584, 1589, 1596, 1605, 1616, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1655, 1662, 1667, 1670, 1672, 1699, 1706, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1717, 1720, 1725, 1732, 1741, 1752, 1765, 1781, 1782, 1783, 1784, 1785, 1786, 1799, 1810, 1819, 1828, 1833, 1836, 1866, 1870, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1882, 1887, 1894, 1903, 1914, 1927, 1942, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1980, 1993, 2004, 2013, 2020, 2025, 2053]
[2025-06-03 10:06:41] [INFO ] Actually due to overlaps returned [207, 369, 510, 632, 735, 827, 911, 991, 1068, 1150, 1332, 1440, 1561, 1699, 2053, 4, 12, 14, 16, 20, 22, 119, 121, 123, 125, 127, 129, 131, 177, 217, 218, 219, 220, 221, 222, 299, 300, 301, 302, 303, 304, 305, 379, 380, 382, 383, 384, 449, 450, 451, 452, 453, 454, 455, 481, 520, 521, 522, 523, 524, 525, 574, 575, 576, 579, 580, 581, 603, 642, 643, 644, 645, 646, 647, 685, 686, 687, 688, 689, 690, 691, 706, 745, 746, 747, 748, 749, 750, 779, 780, 782, 783, 784, 785, 798, 837, 838, 839, 840, 842, 866, 867, 868, 869, 870, 871, 872, 882, 921, 922, 923, 924, 925, 926, 945, 946, 947, 948, 949, 950, 951, 961, 993, 1000, 1001, 1002, 1003, 1004, 1005, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1039, 1078, 1079, 1080, 1081, 1082, 1103, 1104, 1105, 1106, 1107, 1109, 1121, 1160, 1161, 1162, 1163, 1164, 1165, 1186, 1187, 1188, 1190, 1191, 1206, 1245, 1246, 1247, 1249, 1250, 1280, 1281, 1282, 1284, 1285, 1291, 1303, 1343, 1344, 1345, 1346, 1347, 1383, 1384, 1385, 1386, 1387, 1396, 1408, 1450, 1451, 1452, 1454, 1455, 1500, 1501, 1502, 1503, 1504, 1505, 1515, 1532, 1571, 1572, 1573, 1574, 1575, 1576, 1629, 1630, 1631, 1632, 1633, 1634, 1670, 1709, 1710, 1711, 1712, 1713, 1714, 1781, 1782, 1783, 1784, 1785, 1799, 1866, 1873, 1874, 1875, 1876, 1877, 1878, 1959, 1960, 1961, 1962, 1963, 1964, 1980, 2025]
Discarding 238 places :
Implicit Place search using SMT only with invariants took 7051 ms to find 238 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2056/5568 places, 3482/7799 transitions.
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 178 place count 1878 transition count 3304
Iterating global reduction 0 with 178 rules applied. Total rules applied 356 place count 1878 transition count 3304
Discarding 177 places :
Symmetric choice reduction at 0 with 177 rule applications. Total rules 533 place count 1701 transition count 3127
Iterating global reduction 0 with 177 rules applied. Total rules applied 710 place count 1701 transition count 3127
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 886 place count 1525 transition count 2951
Iterating global reduction 0 with 176 rules applied. Total rules applied 1062 place count 1525 transition count 2951
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 1078 place count 1509 transition count 2855
Iterating global reduction 0 with 16 rules applied. Total rules applied 1094 place count 1509 transition count 2855
Applied a total of 1094 rules in 565 ms. Remains 1509 /2056 variables (removed 547) and now considering 2855/3482 (removed 627) transitions.
[2025-06-03 10:06:42] [INFO ] Flow matrix only has 2583 transitions (discarded 272 similar events)
// Phase 1: matrix 2583 rows 1509 cols
[2025-06-03 10:06:42] [INFO ] Computed 303 invariants in 180 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:47] [INFO ] Implicit Places using invariants in 5441 ms returned [7, 18, 23, 30, 42, 53, 66, 81, 97, 132, 143, 152, 159, 166, 199, 202, 205, 210, 217, 226, 237, 250, 264, 287, 296, 303, 308, 313, 324, 328, 332, 335, 340, 347, 356, 368, 380, 400, 407, 412, 415, 418, 430, 432, 434, 436, 439, 444, 451, 460, 470, 490, 495, 499, 501, 504, 515, 517, 519, 521, 523, 526, 531, 538, 546, 558, 561, 563, 565, 568, 577, 580, 582, 584, 586, 588, 591, 596, 602, 611, 613, 615, 617, 622, 634, 638, 640, 642, 644, 648, 650, 653, 657, 661, 663, 665, 667, 670, 681, 683, 685, 688, 690, 692, 694, 696, 698, 701, 703, 705, 707, 711, 718, 720, 722, 724, 726, 728, 730, 732, 734, 737, 739, 741, 743, 746, 755, 759, 763, 765, 767, 769, 771, 773, 775, 782, 784, 786, 788, 791, 804, 806, 808, 810, 812, 814, 816, 818, 821, 827, 830, 832, 834, 836, 842, 854, 858, 862, 864, 867, 870, 872, 875, 880, 888, 898, 900, 902, 905, 918, 922, 927, 929, 931, 933, 936, 941, 948, 958, 969, 972, 974, 977, 993, 997, 999, 1001, 1003, 1006, 1011, 1018, 1030, 1040, 1055, 1060, 1063, 1066, 1077, 1079, 1081, 1083, 1086, 1091, 1098, 1107, 1118, 1130, 1150, 1157, 1162, 1166, 1175, 1177, 1179, 1182, 1187, 1194, 1203, 1214, 1227, 1243, 1266, 1275, 1284, 1289, 1292, 1303, 1305, 1308, 1313, 1320, 1329, 1340, 1353, 1368, 1384, 1411, 1422, 1431, 1438]
Discarding 240 places :
Implicit Place search using SMT only with invariants took 5447 ms to find 240 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1269/5568 places, 2855/7799 transitions.
Applied a total of 0 rules in 91 ms. Remains 1269 /1269 variables (removed 0) and now considering 2855/2855 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14932 ms. Remains : 1269/5568 places, 2855/7799 transitions.
Support contains 67 out of 1269 places after structural reductions.
[2025-06-03 10:06:48] [INFO ] Flatten gal took : 533 ms
[2025-06-03 10:06:49] [INFO ] Flatten gal took : 225 ms
[2025-06-03 10:06:49] [INFO ] Input system was already deterministic with 2855 transitions.
Reduction of identical properties reduced properties to check from 36 to 34
RANDOM walk for 40000 steps (641 resets) in 2272 ms. (17 steps per ms) remains 15/34 properties
BEST_FIRST walk for 4001 steps (16 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (16 resets) in 55 ms. (71 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (16 resets) in 37 ms. (105 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (16 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (16 resets) in 31 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (16 resets) in 51 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (16 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (16 resets) in 26 ms. (148 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000 steps (16 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (16 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (16 resets) in 25 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (16 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (16 resets) in 22 ms. (173 steps per ms) remains 13/13 properties
[2025-06-03 10:06:50] [INFO ] Flow matrix only has 2583 transitions (discarded 272 similar events)
// Phase 1: matrix 2583 rows 1269 cols
[2025-06-03 10:06:50] [INFO ] Computed 63 invariants in 70 ms
[2025-06-03 10:06:50] [INFO ] State equation strengthened by 1023 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1147/1173 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/1177 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 75/1252 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 16/1268 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1268 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/1269 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1269 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3852/3852 variables, and 1332 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1269/1269 constraints, ReadFeed: 0/1023 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1147/1173 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:58] [INFO ] Deduced a trap composed of 238 places in 2177 ms of which 589 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:00] [INFO ] Deduced a trap composed of 621 places in 1951 ms of which 605 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:02] [INFO ] Deduced a trap composed of 215 places in 1792 ms of which 400 ms to minimize.
SMT process timed out in 11896ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 1269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1269 transition count 2836
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1250 transition count 2836
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 1250 transition count 2816
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 1230 transition count 2816
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 1217 transition count 2768
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 1217 transition count 2768
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 104 place count 1217 transition count 2765
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 1214 transition count 2765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 1208 transition count 2734
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 1208 transition count 2734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 1207 transition count 2728
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 1207 transition count 2728
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 176 place count 1181 transition count 2702
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 181 place count 1176 transition count 2697
Iterating global reduction 2 with 5 rules applied. Total rules applied 186 place count 1176 transition count 2697
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 191 place count 1171 transition count 2667
Iterating global reduction 2 with 5 rules applied. Total rules applied 196 place count 1171 transition count 2667
Free-agglomeration rule (complex) applied 141 times.
Iterating global reduction 2 with 141 rules applied. Total rules applied 337 place count 1171 transition count 3381
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 2 with 141 rules applied. Total rules applied 478 place count 1030 transition count 3381
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 486 place count 1030 transition count 3381
Applied a total of 486 rules in 1630 ms. Remains 1030 /1269 variables (removed 239) and now considering 3381/2855 (removed -526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1631 ms. Remains : 1030/1269 places, 3381/2855 transitions.
RANDOM walk for 40000 steps (1073 resets) in 1860 ms. (21 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (141 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (141 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (140 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (125 resets) in 273 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (142 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (125 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (141 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (143 resets) in 264 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (143 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (141 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 41101 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 12
Probabilistic random walk after 41101 steps, saw 17536 distinct states, run finished after 3010 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-03 10:07:08] [INFO ] Flow matrix only has 2991 transitions (discarded 390 similar events)
// Phase 1: matrix 2991 rows 1030 cols
[2025-06-03 10:07:08] [INFO ] Computed 63 invariants in 75 ms
[2025-06-03 10:07:08] [INFO ] State equation strengthened by 1788 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 918/943 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/947 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 61/1008 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 16/1024 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 6/1030 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1030 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2991/4021 variables, 1030/1093 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4021 variables, 1788/2881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:15] [INFO ] Deduced a trap composed of 157 places in 1421 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:17] [INFO ] Deduced a trap composed of 64 places in 1517 ms of which 110 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4021 variables, 2/2883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4021 variables, 0/2883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/4021 variables, 0/2883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4021/4021 variables, and 2883 constraints, problems are : Problem set: 0 solved, 12 unsolved in 18710 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1030/1030 constraints, ReadFeed: 1788/1788 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 918/943 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/947 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 61/1008 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 16/1024 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 6/1030 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1030 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:30] [INFO ] Deduced a trap composed of 5 places in 1537 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:31] [INFO ] Deduced a trap composed of 46 places in 1248 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:32] [INFO ] Deduced a trap composed of 46 places in 1332 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:34] [INFO ] Deduced a trap composed of 63 places in 1434 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:35] [INFO ] Deduced a trap composed of 88 places in 1261 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:36] [INFO ] Deduced a trap composed of 54 places in 1295 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:38] [INFO ] Deduced a trap composed of 54 places in 1383 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:39] [INFO ] Deduced a trap composed of 84 places in 1324 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:41] [INFO ] Deduced a trap composed of 94 places in 1597 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:42] [INFO ] Deduced a trap composed of 101 places in 1262 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:43] [INFO ] Deduced a trap composed of 103 places in 1166 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:44] [INFO ] Deduced a trap composed of 54 places in 1353 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:46] [INFO ] Deduced a trap composed of 54 places in 1196 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:47] [INFO ] Deduced a trap composed of 54 places in 1470 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:49] [INFO ] Deduced a trap composed of 54 places in 1761 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:50] [INFO ] Deduced a trap composed of 101 places in 1474 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:52] [INFO ] Deduced a trap composed of 103 places in 1555 ms of which 240 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:53] [INFO ] Deduced a trap composed of 54 places in 1303 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:55] [INFO ] Deduced a trap composed of 54 places in 1689 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:56] [INFO ] Deduced a trap composed of 54 places in 1397 ms of which 116 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1030 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:58] [INFO ] Deduced a trap composed of 71 places in 1398 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:00] [INFO ] Deduced a trap composed of 127 places in 1561 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:01] [INFO ] Deduced a trap composed of 132 places in 1377 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:02] [INFO ] Deduced a trap composed of 133 places in 1466 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:04] [INFO ] Deduced a trap composed of 131 places in 1301 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:05] [INFO ] Deduced a trap composed of 133 places in 1324 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:07] [INFO ] Deduced a trap composed of 138 places in 1384 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:08] [INFO ] Deduced a trap composed of 116 places in 1282 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:09] [INFO ] Deduced a trap composed of 115 places in 1431 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:11] [INFO ] Deduced a trap composed of 120 places in 1305 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:12] [INFO ] Deduced a trap composed of 115 places in 1344 ms of which 150 ms to minimize.
SMT process timed out in 64207ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 1030 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1030/1030 places, 3381/3381 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1030 transition count 3380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1029 transition count 3380
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1029 transition count 3380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1028 transition count 3379
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1028 transition count 3379
Applied a total of 5 rules in 322 ms. Remains 1028 /1030 variables (removed 2) and now considering 3379/3381 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 1028/1030 places, 3379/3381 transitions.
RANDOM walk for 40000 steps (1075 resets) in 2060 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (142 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (139 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (142 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (124 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (140 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (123 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (142 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (144 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (139 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (140 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 41153 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 12
Probabilistic random walk after 41153 steps, saw 17550 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-03 10:08:16] [INFO ] Flow matrix only has 2989 transitions (discarded 390 similar events)
// Phase 1: matrix 2989 rows 1028 cols
[2025-06-03 10:08:16] [INFO ] Computed 63 invariants in 66 ms
[2025-06-03 10:08:17] [INFO ] State equation strengthened by 1788 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 917/942 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/942 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/946 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 57/1003 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 16/1019 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 9/1028 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1028 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2989/4017 variables, 1028/1091 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4017 variables, 1788/2879 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:24] [INFO ] Deduced a trap composed of 157 places in 1329 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:25] [INFO ] Deduced a trap composed of 61 places in 1252 ms of which 109 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4017 variables, 2/2881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4017 variables, 0/2881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/4017 variables, 0/2881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4017/4017 variables, and 2881 constraints, problems are : Problem set: 0 solved, 12 unsolved in 18439 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1028/1028 constraints, ReadFeed: 1788/1788 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 917/942 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/942 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/946 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 57/1003 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 16/1019 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 9/1028 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1028 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:38] [INFO ] Deduced a trap composed of 5 places in 1469 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:40] [INFO ] Deduced a trap composed of 46 places in 1204 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:41] [INFO ] Deduced a trap composed of 63 places in 1246 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:42] [INFO ] Deduced a trap composed of 56 places in 1333 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:44] [INFO ] Deduced a trap composed of 62 places in 1661 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:45] [INFO ] Deduced a trap composed of 62 places in 1491 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:47] [INFO ] Deduced a trap composed of 63 places in 1245 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:48] [INFO ] Deduced a trap composed of 62 places in 1176 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:49] [INFO ] Deduced a trap composed of 61 places in 1530 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:51] [INFO ] Deduced a trap composed of 62 places in 1419 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:52] [INFO ] Deduced a trap composed of 62 places in 1326 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:54] [INFO ] Deduced a trap composed of 63 places in 1339 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:55] [INFO ] Deduced a trap composed of 84 places in 1200 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:56] [INFO ] Deduced a trap composed of 56 places in 1337 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:57] [INFO ] Deduced a trap composed of 56 places in 1327 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:59] [INFO ] Deduced a trap composed of 64 places in 1463 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:00] [INFO ] Deduced a trap composed of 63 places in 1164 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:01] [INFO ] Deduced a trap composed of 94 places in 1284 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:03] [INFO ] Deduced a trap composed of 64 places in 1444 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:04] [INFO ] Deduced a trap composed of 63 places in 1179 ms of which 122 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1028 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:05] [INFO ] Deduced a trap composed of 121 places in 1196 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:06] [INFO ] Deduced a trap composed of 124 places in 1009 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:08] [INFO ] Deduced a trap composed of 104 places in 1161 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:09] [INFO ] Deduced a trap composed of 108 places in 1212 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:10] [INFO ] Deduced a trap composed of 111 places in 1374 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:11] [INFO ] Deduced a trap composed of 115 places in 1125 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:13] [INFO ] Deduced a trap composed of 116 places in 1201 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:14] [INFO ] Deduced a trap composed of 118 places in 1306 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:15] [INFO ] Deduced a trap composed of 27 places in 1196 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:16] [INFO ] Deduced a trap composed of 130 places in 1218 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:17] [INFO ] Deduced a trap composed of 132 places in 1021 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:18] [INFO ] Deduced a trap composed of 133 places in 998 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:20] [INFO ] Deduced a trap composed of 132 places in 1277 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:21] [INFO ] Deduced a trap composed of 135 places in 1201 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:22] [INFO ] Deduced a trap composed of 128 places in 1096 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:23] [INFO ] Deduced a trap composed of 131 places in 1133 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:24] [INFO ] Deduced a trap composed of 130 places in 1064 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:25] [INFO ] Deduced a trap composed of 133 places in 1084 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:27] [INFO ] Deduced a trap composed of 131 places in 1503 ms of which 227 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:28] [INFO ] Deduced a trap composed of 134 places in 1095 ms of which 143 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:29] [INFO ] Deduced a trap composed of 88 places in 1294 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:31] [INFO ] Deduced a trap composed of 71 places in 1358 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:32] [INFO ] Deduced a trap composed of 124 places in 1401 ms of which 284 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:34] [INFO ] Deduced a trap composed of 127 places in 1332 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:35] [INFO ] Deduced a trap composed of 126 places in 1233 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:36] [INFO ] Deduced a trap composed of 129 places in 1096 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:38] [INFO ] Deduced a trap composed of 130 places in 1656 ms of which 282 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:39] [INFO ] Deduced a trap composed of 129 places in 1330 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:40] [INFO ] Deduced a trap composed of 125 places in 1409 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:42] [INFO ] Deduced a trap composed of 133 places in 1282 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:43] [INFO ] Deduced a trap composed of 126 places in 1220 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:44] [INFO ] Deduced a trap composed of 125 places in 1418 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:46] [INFO ] Deduced a trap composed of 144 places in 1118 ms of which 214 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:47] [INFO ] Deduced a trap composed of 133 places in 1571 ms of which 316 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:49] [INFO ] Deduced a trap composed of 150 places in 1520 ms of which 345 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:09:50] [INFO ] Deduced a trap composed of 169 places in 1400 ms of which 186 ms to minimize.
SMT process timed out in 93807ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 3379/3379 transitions.
Applied a total of 0 rules in 117 ms. Remains 1028 /1028 variables (removed 0) and now considering 3379/3379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1028/1028 places, 3379/3379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 3379/3379 transitions.
Applied a total of 0 rules in 114 ms. Remains 1028 /1028 variables (removed 0) and now considering 3379/3379 (removed 0) transitions.
[2025-06-03 10:09:50] [INFO ] Flow matrix only has 2989 transitions (discarded 390 similar events)
[2025-06-03 10:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:09:54] [INFO ] Implicit Places using invariants in 3131 ms returned [7, 227, 238, 346, 423, 548, 558, 565, 579, 598, 643, 746, 822, 862]
[2025-06-03 10:09:54] [INFO ] Actually due to overlaps returned [558, 862, 7, 238, 346, 423, 548, 565, 579, 598, 643, 822]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 3135 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1016/1028 places, 3379/3379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1009 transition count 3372
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1009 transition count 3372
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1002 transition count 3365
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1002 transition count 3365
Applied a total of 28 rules in 200 ms. Remains 1002 /1016 variables (removed 14) and now considering 3365/3379 (removed 14) transitions.
[2025-06-03 10:09:54] [INFO ] Flow matrix only has 2975 transitions (discarded 390 similar events)
// Phase 1: matrix 2975 rows 1002 cols
[2025-06-03 10:09:54] [INFO ] Computed 51 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:09:57] [INFO ] Implicit Places using invariants in 2861 ms returned [226, 730]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2866 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1000/1028 places, 3365/3379 transitions.
Applied a total of 0 rules in 145 ms. Remains 1000 /1000 variables (removed 0) and now considering 3365/3365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6462 ms. Remains : 1000/1028 places, 3365/3379 transitions.
Computed a total of 437 stabilizing places and 1222 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1246 transition count 2792
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1246 transition count 2792
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 1231 transition count 2742
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 1231 transition count 2742
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 1223 transition count 2694
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 1223 transition count 2694
Applied a total of 92 rules in 289 ms. Remains 1223 /1269 variables (removed 46) and now considering 2694/2855 (removed 161) transitions.
[2025-06-03 10:09:58] [INFO ] Flow matrix only has 2422 transitions (discarded 272 similar events)
// Phase 1: matrix 2422 rows 1223 cols
[2025-06-03 10:09:58] [INFO ] Computed 63 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:00] [INFO ] Implicit Places using invariants in 2656 ms returned [13, 280, 294, 420, 514, 534, 609, 619, 651, 663, 672, 690, 715, 740, 770, 889, 1027]
[2025-06-03 10:10:00] [INFO ] Actually due to overlaps returned [663, 1027, 13, 294, 420, 514, 534, 609, 619, 651, 672, 690, 715, 740, 770]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2663 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1208/1269 places, 2694/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1195 transition count 2681
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1195 transition count 2681
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1182 transition count 2668
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1182 transition count 2668
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1169 transition count 2655
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1169 transition count 2655
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1156 transition count 2577
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1156 transition count 2577
Applied a total of 104 rules in 352 ms. Remains 1156 /1208 variables (removed 52) and now considering 2577/2694 (removed 117) transitions.
[2025-06-03 10:10:01] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1156 cols
[2025-06-03 10:10:01] [INFO ] Computed 48 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:03] [INFO ] Implicit Places using invariants in 2299 ms returned [278, 836]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2302 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1154/1269 places, 2577/2855 transitions.
Applied a total of 0 rules in 100 ms. Remains 1154 /1154 variables (removed 0) and now considering 2577/2577 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5709 ms. Remains : 1154/1269 places, 2577/2855 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00
Stuttering criterion allowed to conclude after 1428 steps with 22 reset in 37 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00 finished in 6286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1269 transition count 2834
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1248 transition count 2834
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 42 place count 1248 transition count 2811
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 88 place count 1225 transition count 2811
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 1208 transition count 2754
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 1208 transition count 2754
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 122 place count 1208 transition count 2749
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1203 transition count 2749
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 1194 transition count 2700
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 1194 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1193 transition count 2694
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1193 transition count 2694
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 202 place count 1168 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 1161 transition count 2662
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 1161 transition count 2662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1154 transition count 2620
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1154 transition count 2620
Applied a total of 230 rules in 741 ms. Remains 1154 /1269 variables (removed 115) and now considering 2620/2855 (removed 235) transitions.
[2025-06-03 10:10:04] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1154 cols
[2025-06-03 10:10:04] [INFO ] Computed 63 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:07] [INFO ] Implicit Places using invariants in 2482 ms returned [9, 254, 266, 390, 481, 499, 571, 581, 610, 621, 629, 647, 669, 694, 721, 838, 925, 971]
[2025-06-03 10:10:07] [INFO ] Actually due to overlaps returned [621, 971, 9, 266, 390, 481, 499, 571, 581, 610, 629, 647, 669, 694, 721, 925]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2489 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1269 places, 2620/2855 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1128 transition count 2610
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1128 transition count 2610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1118 transition count 2600
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1118 transition count 2600
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1108 transition count 2540
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1108 transition count 2540
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 1104 transition count 2536
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 1100 transition count 2532
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 1100 transition count 2532
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 1096 transition count 2508
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 1096 transition count 2508
Applied a total of 84 rules in 593 ms. Remains 1096 /1138 variables (removed 42) and now considering 2508/2620 (removed 112) transitions.
[2025-06-03 10:10:07] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1096 cols
[2025-06-03 10:10:07] [INFO ] Computed 47 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:09] [INFO ] Implicit Places using invariants in 1952 ms returned [252, 798]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1954 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1094/1269 places, 2508/2855 transitions.
Applied a total of 0 rules in 109 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5889 ms. Remains : 1094/1269 places, 2508/2855 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 81564 steps with 1858 reset in 678 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01 finished in 6645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1) U (p0 U X((p2||F(G(p2)))))))))'
Support contains 5 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1246 transition count 2792
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1246 transition count 2792
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 1231 transition count 2737
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 1231 transition count 2737
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 1224 transition count 2695
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 1224 transition count 2695
Applied a total of 90 rules in 289 ms. Remains 1224 /1269 variables (removed 45) and now considering 2695/2855 (removed 160) transitions.
[2025-06-03 10:10:11] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1224 cols
[2025-06-03 10:10:11] [INFO ] Computed 63 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:14] [INFO ] Implicit Places using invariants in 2993 ms returned [13, 280, 294, 420, 514, 534, 609, 619, 651, 663, 672, 691, 744, 774, 893, 981, 1028]
[2025-06-03 10:10:14] [INFO ] Actually due to overlaps returned [663, 1028, 13, 294, 420, 514, 534, 609, 619, 651, 672, 691, 744, 774, 981]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 3002 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1269 places, 2695/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1196 transition count 2682
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1196 transition count 2682
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1183 transition count 2669
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1183 transition count 2669
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1170 transition count 2656
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1170 transition count 2656
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1157 transition count 2578
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1157 transition count 2578
Applied a total of 104 rules in 480 ms. Remains 1157 /1209 variables (removed 52) and now considering 2578/2695 (removed 117) transitions.
[2025-06-03 10:10:14] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1157 cols
[2025-06-03 10:10:14] [INFO ] Computed 48 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:16] [INFO ] Implicit Places using invariants in 2383 ms returned [278, 844]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2386 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1155/1269 places, 2578/2855 transitions.
Applied a total of 0 rules in 101 ms. Remains 1155 /1155 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6261 ms. Remains : 1155/1269 places, 2578/2855 transitions.
Stuttering acceptance computed with spot in 450 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02
Stuttering criterion allowed to conclude after 5530 steps with 88 reset in 40 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 finished in 6798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 3 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1246 transition count 2787
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1246 transition count 2787
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 1232 transition count 2738
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1232 transition count 2738
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 1225 transition count 2696
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 1225 transition count 2696
Applied a total of 88 rules in 287 ms. Remains 1225 /1269 variables (removed 44) and now considering 2696/2855 (removed 159) transitions.
[2025-06-03 10:10:17] [INFO ] Flow matrix only has 2424 transitions (discarded 272 similar events)
// Phase 1: matrix 2424 rows 1225 cols
[2025-06-03 10:10:17] [INFO ] Computed 63 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:20] [INFO ] Implicit Places using invariants in 2703 ms returned [13, 280, 294, 420, 515, 536, 611, 655, 667, 676, 694, 719, 744, 774, 893, 981, 1028]
[2025-06-03 10:10:20] [INFO ] Actually due to overlaps returned [667, 1028, 13, 294, 420, 515, 536, 611, 655, 676, 694, 719, 744, 774, 981]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2706 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1210/1269 places, 2696/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1197 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2683
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1184 transition count 2670
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1184 transition count 2670
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1171 transition count 2657
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1171 transition count 2657
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1158 transition count 2579
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1158 transition count 2579
Applied a total of 104 rules in 372 ms. Remains 1158 /1210 variables (removed 52) and now considering 2579/2696 (removed 117) transitions.
[2025-06-03 10:10:20] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1158 cols
[2025-06-03 10:10:20] [INFO ] Computed 48 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:23] [INFO ] Implicit Places using invariants in 2320 ms returned [278, 844]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2322 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1156/1269 places, 2579/2855 transitions.
Applied a total of 0 rules in 68 ms. Remains 1156 /1156 variables (removed 0) and now considering 2579/2579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5758 ms. Remains : 1156/1269 places, 2579/2855 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 938 ms.
Product exploration explored 100000 steps with 50000 reset in 1093 ms.
Computed a total of 324 stabilizing places and 946 stable transitions
Computed a total of 324 stabilizing places and 946 stable transitions
Detected a total of 324/1156 stabilizing places and 946/2579 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 finished in 7984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||G(!p2))))) U (G((!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||(!p1&&G(!p2)))))))||(p3&&(!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||(!p1&&G(!p2))))))))))))'
Support contains 9 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1247 transition count 2793
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1247 transition count 2793
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 1233 transition count 2744
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 1233 transition count 2744
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 1226 transition count 2702
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 1226 transition count 2702
Applied a total of 86 rules in 295 ms. Remains 1226 /1269 variables (removed 43) and now considering 2702/2855 (removed 153) transitions.
[2025-06-03 10:10:25] [INFO ] Flow matrix only has 2430 transitions (discarded 272 similar events)
// Phase 1: matrix 2430 rows 1226 cols
[2025-06-03 10:10:25] [INFO ] Computed 63 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:28] [INFO ] Implicit Places using invariants in 2544 ms returned [13, 294, 421, 515, 535, 610, 620, 652, 664, 693, 718, 776, 895, 983]
[2025-06-03 10:10:28] [INFO ] Actually due to overlaps returned [664, 13, 294, 421, 515, 535, 610, 620, 652, 693, 718, 776, 983]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2547 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1213/1269 places, 2702/2855 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1201 transition count 2690
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1201 transition count 2690
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1189 transition count 2678
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1189 transition count 2678
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1177 transition count 2666
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1177 transition count 2666
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 1165 transition count 2594
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 1165 transition count 2594
Applied a total of 96 rules in 377 ms. Remains 1165 /1213 variables (removed 48) and now considering 2594/2702 (removed 108) transitions.
[2025-06-03 10:10:28] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
// Phase 1: matrix 2322 rows 1165 cols
[2025-06-03 10:10:28] [INFO ] Computed 50 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:30] [INFO ] Implicit Places using invariants in 2150 ms returned [850]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1164/1269 places, 2594/2855 transitions.
Applied a total of 0 rules in 67 ms. Remains 1164 /1164 variables (removed 0) and now considering 2594/2594 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5444 ms. Remains : 1164/1269 places, 2594/2855 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), true, p2, (OR (AND p0 p2) (AND p0 p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04
Product exploration explored 100000 steps with 1604 reset in 760 ms.
Product exploration explored 100000 steps with 1605 reset in 626 ms.
Computed a total of 332 stabilizing places and 961 stable transitions
Computed a total of 332 stabilizing places and 961 stable transitions
Detected a total of 332/1164 stabilizing places and 961/2594 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1300 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), true, p2, (OR (AND p0 p2) (AND p0 p1))]
RANDOM walk for 40000 steps (640 resets) in 437 ms. (91 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (172 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (172 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
[2025-06-03 10:10:34] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
// Phase 1: matrix 2322 rows 1164 cols
[2025-06-03 10:10:34] [INFO ] Computed 49 invariants in 38 ms
[2025-06-03 10:10:34] [INFO ] State equation strengthened by 853 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 1015/1024 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/1060 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1060 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/1127 variables, 9/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1127 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/1155 variables, 28/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1155 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/1164 variables, 9/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2322/3486 variables, 1164/1213 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3486 variables, 853/2066 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3486 variables, 0/2066 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3486 variables, 0/2066 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3486/3486 variables, and 2066 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2009 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1164/1164 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1024 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/1060 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1060 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/1127 variables, 9/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:38] [INFO ] Deduced a trap composed of 215 places in 1218 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:39] [INFO ] Deduced a trap composed of 227 places in 1295 ms of which 295 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:41] [INFO ] Deduced a trap composed of 225 places in 1324 ms of which 306 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:42] [INFO ] Deduced a trap composed of 225 places in 1441 ms of which 380 ms to minimize.
SMT process timed out in 7906ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 1164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1164/1164 places, 2594/2594 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1164 transition count 2572
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1142 transition count 2572
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 1142 transition count 2560
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 1130 transition count 2560
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 108 place count 1110 transition count 2540
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 2 with 129 rules applied. Total rules applied 237 place count 1110 transition count 2411
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 2 with 129 rules applied. Total rules applied 366 place count 981 transition count 2411
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 367 place count 981 transition count 2411
Applied a total of 367 rules in 413 ms. Remains 981 /1164 variables (removed 183) and now considering 2411/2594 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 981/1164 places, 2411/2594 transitions.
RANDOM walk for 40000 steps (964 resets) in 476 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (137 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 62766 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62766 steps, saw 26512 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-03 10:10:46] [INFO ] Flow matrix only has 2013 transitions (discarded 398 similar events)
// Phase 1: matrix 2013 rows 981 cols
[2025-06-03 10:10:46] [INFO ] Computed 49 invariants in 26 ms
[2025-06-03 10:10:46] [INFO ] State equation strengthened by 853 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 883/892 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/909 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/909 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/944 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/972 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/981 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2013/2994 variables, 981/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2994 variables, 853/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2994 variables, 0/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2994 variables, 0/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2994/2994 variables, and 1883 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 981/981 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 883/892 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/909 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/909 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/944 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/972 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/981 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2013/2994 variables, 981/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2994 variables, 853/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2994 variables, 1/1884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:50] [INFO ] Deduced a trap composed of 114 places in 923 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:52] [INFO ] Deduced a trap composed of 97 places in 962 ms of which 69 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2994 variables, 2/1886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2994 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2994 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2994/2994 variables, and 1886 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5550 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 981/981 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7320ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 661 steps, including 96 resets, run visited all 2 properties in 21 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 31 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p3) (NOT p1))), (G (AND (OR (NOT p0) (NOT p1)) (OR (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1) (NOT p2))))), (F p3), (F p1), (F p0)]
Knowledge based reduction with 15 factoid took 3147 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 164 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1164/1164 places, 2594/2594 transitions.
Applied a total of 0 rules in 67 ms. Remains 1164 /1164 variables (removed 0) and now considering 2594/2594 (removed 0) transitions.
[2025-06-03 10:10:57] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
// Phase 1: matrix 2322 rows 1164 cols
[2025-06-03 10:10:57] [INFO ] Computed 49 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:59] [INFO ] Implicit Places using invariants in 2167 ms returned []
[2025-06-03 10:10:59] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
[2025-06-03 10:10:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:11:00] [INFO ] State equation strengthened by 853 read => feed constraints.
[2025-06-03 10:11:30] [INFO ] Performed 1067/1164 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:11:33] [INFO ] Implicit Places using invariants and state equation in 34084 ms returned []
Implicit Place search using SMT with State Equation took 36254 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-06-03 10:11:33] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
[2025-06-03 10:11:33] [INFO ] Invariant cache hit.
[2025-06-03 10:11:33] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1162 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
SMT process timed out in 31949ms, After SMT, problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 31969ms
Finished structural reductions in LTL mode , in 1 iterations and 68307 ms. Remains : 1164/1164 places, 2594/2594 transitions.
Computed a total of 332 stabilizing places and 961 stable transitions
Computed a total of 332 stabilizing places and 961 stable transitions
Detected a total of 332/1164 stabilizing places and 961/2594 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 565 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (638 resets) in 418 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (172 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2025-06-03 10:12:06] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
[2025-06-03 10:12:06] [INFO ] Invariant cache hit.
[2025-06-03 10:12:06] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/1056 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/1124 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1152 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1152 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1164 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2322/3486 variables, 1164/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3486 variables, 853/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3486 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3486 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3486/3486 variables, and 2066 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1164/1164 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/1056 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/1124 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:09] [INFO ] Deduced a trap composed of 50 places in 1231 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:11] [INFO ] Deduced a trap composed of 67 places in 1369 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:12] [INFO ] Deduced a trap composed of 67 places in 1175 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:13] [INFO ] Deduced a trap composed of 67 places in 1300 ms of which 132 ms to minimize.
SMT process timed out in 7288ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1164/1164 places, 2594/2594 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1164 transition count 2572
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1142 transition count 2572
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 1142 transition count 2559
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 1129 transition count 2559
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1127 transition count 2552
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1127 transition count 2552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 1127 transition count 2551
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1126 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1125 transition count 2545
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1125 transition count 2545
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 1106 transition count 2526
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 2 with 134 rules applied. Total rules applied 250 place count 1106 transition count 3727
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 2 with 134 rules applied. Total rules applied 384 place count 972 transition count 3727
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 385 place count 972 transition count 3727
Applied a total of 385 rules in 658 ms. Remains 972 /1164 variables (removed 192) and now considering 3727/2594 (removed -1133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 972/1164 places, 3727/2594 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1261 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55719 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55719 steps, saw 23358 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 10:12:17] [INFO ] Flow matrix only has 3329 transitions (discarded 398 similar events)
// Phase 1: matrix 3329 rows 972 cols
[2025-06-03 10:12:17] [INFO ] Computed 49 invariants in 36 ms
[2025-06-03 10:12:17] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/932 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:18] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/960 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/972 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3329/4301 variables, 972/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4301 variables, 2178/3200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4301 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/4301 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 3200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 972/972 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/932 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:21] [INFO ] Deduced a trap composed of 50 places in 1290 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:23] [INFO ] Deduced a trap composed of 50 places in 1396 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:24] [INFO ] Deduced a trap composed of 51 places in 1283 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:25] [INFO ] Deduced a trap composed of 51 places in 1279 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:27] [INFO ] Deduced a trap composed of 51 places in 1283 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:28] [INFO ] Deduced a trap composed of 51 places in 1268 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:29] [INFO ] Deduced a trap composed of 50 places in 1331 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:31] [INFO ] Deduced a trap composed of 50 places in 1371 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:32] [INFO ] Deduced a trap composed of 50 places in 1273 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:33] [INFO ] Deduced a trap composed of 50 places in 1202 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:34] [INFO ] Deduced a trap composed of 50 places in 1107 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:36] [INFO ] Deduced a trap composed of 50 places in 1363 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:37] [INFO ] Deduced a trap composed of 50 places in 1378 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:38] [INFO ] Deduced a trap composed of 50 places in 1267 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:40] [INFO ] Deduced a trap composed of 50 places in 1257 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:41] [INFO ] Deduced a trap composed of 50 places in 1379 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:42] [INFO ] Deduced a trap composed of 84 places in 1202 ms of which 125 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/960 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:43] [INFO ] Deduced a trap composed of 85 places in 1111 ms of which 121 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/960 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/972 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/972 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3329/4301 variables, 972/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4301 variables, 2178/3218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4301 variables, 1/3219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:48] [INFO ] Deduced a trap composed of 111 places in 1077 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:50] [INFO ] Deduced a trap composed of 99 places in 1332 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:12:51] [INFO ] Deduced a trap composed of 101 places in 1085 ms of which 125 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4301 variables, 3/3222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4301 variables, 0/3222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4301 variables, 0/3222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 3222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33287 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 972/972 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 1 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 3727/3727 transitions.
Applied a total of 0 rules in 131 ms. Remains 972 /972 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 972/972 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 3727/3727 transitions.
Applied a total of 0 rules in 121 ms. Remains 972 /972 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2025-06-03 10:12:53] [INFO ] Flow matrix only has 3329 transitions (discarded 398 similar events)
[2025-06-03 10:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:12:56] [INFO ] Implicit Places using invariants in 2561 ms returned [221, 532, 817]
[2025-06-03 10:12:56] [INFO ] Actually due to overlaps returned [817, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2566 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 970/972 places, 3727/3727 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 969 transition count 3726
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 969 transition count 3726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 968 transition count 3725
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 968 transition count 3725
Applied a total of 4 rules in 232 ms. Remains 968 /970 variables (removed 2) and now considering 3725/3727 (removed 2) transitions.
[2025-06-03 10:12:56] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 968 cols
[2025-06-03 10:12:56] [INFO ] Computed 47 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:12:59] [INFO ] Implicit Places using invariants in 2397 ms returned [221]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2400 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 967/972 places, 3725/3727 transitions.
Applied a total of 0 rules in 128 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5449 ms. Remains : 967/972 places, 3725/3727 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1235 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55120 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55120 steps, saw 23104 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 10:13:02] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 967 cols
[2025-06-03 10:13:02] [INFO ] Computed 46 invariants in 26 ms
[2025-06-03 10:13:02] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 877/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/927 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/955 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/967 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3327/4294 variables, 967/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4294 variables, 2178/3191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4294 variables, 0/3191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4294 variables, 0/3191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4294/4294 variables, and 3191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 967/967 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 877/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/927 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/955 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:06] [INFO ] Deduced a trap composed of 95 places in 1019 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:07] [INFO ] Deduced a trap composed of 96 places in 1129 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:08] [INFO ] Deduced a trap composed of 96 places in 1106 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:09] [INFO ] Deduced a trap composed of 96 places in 1099 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:10] [INFO ] Deduced a trap composed of 96 places in 1101 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:11] [INFO ] Deduced a trap composed of 96 places in 1119 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:12] [INFO ] Deduced a trap composed of 96 places in 1092 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:13] [INFO ] Deduced a trap composed of 96 places in 1104 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:15] [INFO ] Deduced a trap composed of 98 places in 1161 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:15] [INFO ] Deduced a trap composed of 27 places in 428 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:16] [INFO ] Deduced a trap composed of 98 places in 1128 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:17] [INFO ] Deduced a trap composed of 96 places in 1114 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:19] [INFO ] Deduced a trap composed of 96 places in 1117 ms of which 129 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/967 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3327/4294 variables, 967/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4294 variables, 2178/3204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4294 variables, 1/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4294 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4294 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4294/4294 variables, and 3205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18017 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 967/967 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 120 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 967/967 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 131 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2025-06-03 10:13:23] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2025-06-03 10:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:13:25] [INFO ] Implicit Places using invariants in 2396 ms returned []
[2025-06-03 10:13:25] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2025-06-03 10:13:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:13:27] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:13:57] [INFO ] Performed 388/967 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:14:27] [INFO ] Performed 655/967 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:14:44] [INFO ] Implicit Places using invariants and state equation in 79449 ms returned []
Implicit Place search using SMT with State Equation took 81849 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:14:45] [INFO ] Redundant transitions in 359 ms returned []
Running 3663 sub problems to find dead transitions.
[2025-06-03 10:14:45] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2025-06-03 10:14:45] [INFO ] Invariant cache hit.
[2025-06-03 10:14:45] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/965 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3663 unsolved
SMT process timed out in 35869ms, After SMT, problems are : Problem set: 0 solved, 3663 unsolved
Search for dead transitions found 0 dead transitions in 35884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118239 ms. Remains : 967/967 places, 3725/3725 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 7 factoid took 1028 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 160 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 160 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 1604 reset in 526 ms.
Product exploration explored 100000 steps with 1606 reset in 612 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[true, p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1164/1164 places, 2594/2594 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1164 transition count 2594
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 22 place count 1164 transition count 2595
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 1164 transition count 2595
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 1153 transition count 2579
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 1153 transition count 2579
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 76 place count 1153 transition count 2579
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 1150 transition count 2576
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 1150 transition count 2576
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 82 rules in 669 ms. Remains 1150 /1164 variables (removed 14) and now considering 2576/2594 (removed 18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:15:25] [INFO ] Redundant transitions in 250 ms returned []
Running 2559 sub problems to find dead transitions.
[2025-06-03 10:15:25] [INFO ] Flow matrix only has 2304 transitions (discarded 272 similar events)
// Phase 1: matrix 2304 rows 1150 cols
[2025-06-03 10:15:25] [INFO ] Computed 49 invariants in 38 ms
[2025-06-03 10:15:25] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1148 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2559 unsolved
SMT process timed out in 31901ms, After SMT, problems are : Problem set: 0 solved, 2559 unsolved
Search for dead transitions found 0 dead transitions in 31912ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1150/1164 places, 2576/2594 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32865 ms. Remains : 1150/1164 places, 2576/2594 transitions.
Built C files in :
/tmp/ltsmin1724809483848748377
[2025-06-03 10:15:57] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1724809483848748377
Running compilation step : cd /tmp/ltsmin1724809483848748377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1724809483848748377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1724809483848748377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1164/1164 places, 2594/2594 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1163 transition count 2588
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1163 transition count 2588
Applied a total of 2 rules in 95 ms. Remains 1163 /1164 variables (removed 1) and now considering 2588/2594 (removed 6) transitions.
[2025-06-03 10:16:00] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1163 cols
[2025-06-03 10:16:00] [INFO ] Computed 49 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:16:02] [INFO ] Implicit Places using invariants in 2297 ms returned []
[2025-06-03 10:16:02] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
[2025-06-03 10:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:16:04] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 10:16:34] [INFO ] Performed 1002/1163 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:16:38] [INFO ] Implicit Places using invariants and state equation in 35310 ms returned []
Implicit Place search using SMT with State Equation took 37610 ms to find 0 implicit places.
Running 2571 sub problems to find dead transitions.
[2025-06-03 10:16:38] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
[2025-06-03 10:16:38] [INFO ] Invariant cache hit.
[2025-06-03 10:16:38] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s732 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1161 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2571 unsolved
SMT process timed out in 31574ms, After SMT, problems are : Problem set: 0 solved, 2571 unsolved
Search for dead transitions found 0 dead transitions in 31580ms
Starting structural reductions in LTL mode, iteration 1 : 1163/1164 places, 2588/2594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69292 ms. Remains : 1163/1164 places, 2588/2594 transitions.
Built C files in :
/tmp/ltsmin16706028402821962221
[2025-06-03 10:17:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16706028402821962221
Running compilation step : cd /tmp/ltsmin16706028402821962221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16706028402821962221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16706028402821962221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 10:17:13] [INFO ] Flatten gal took : 121 ms
[2025-06-03 10:17:13] [INFO ] Flatten gal took : 113 ms
[2025-06-03 10:17:13] [INFO ] Time to serialize gal into /tmp/LTL13329119445668142572.gal : 42 ms
[2025-06-03 10:17:13] [INFO ] Time to serialize properties into /tmp/LTL8806823083508716030.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13329119445668142572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6598221341687453360.hoa' '-atoms' '/tmp/LTL8806823083508716030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8806823083508716030.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6598221341687453360.hoa
Detected timeout of ITS tools.
[2025-06-03 10:17:28] [INFO ] Flatten gal took : 104 ms
[2025-06-03 10:17:28] [INFO ] Flatten gal took : 109 ms
[2025-06-03 10:17:28] [INFO ] Time to serialize gal into /tmp/LTL7942655319413416208.gal : 30 ms
[2025-06-03 10:17:28] [INFO ] Time to serialize properties into /tmp/LTL4452130732777735049.ltl : 12 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7942655319413416208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4452130732777735049.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(((!("(((ThereIsAMasterInTheLeafSet>=1)&&(Node1WantsToManageTheCrashOfNode15>=1))&&((Node1HasDetectedCrashOfNode15>=1)&&(NoNodeM...2796
Formula 0 simplified : XX(("(((ThereIsAMasterInTheLeafSet>=1)&&(Node1WantsToManageTheCrashOfNode15>=1))&&((Node1HasDetectedCrashOfNode15>=1)&&(NoNodeManage...2682
Detected timeout of ITS tools.
[2025-06-03 10:17:43] [INFO ] Flatten gal took : 112 ms
[2025-06-03 10:17:43] [INFO ] Applying decomposition
[2025-06-03 10:17:43] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8532881923520074254.txt' '-o' '/tmp/graph8532881923520074254.bin' '-w' '/tmp/graph8532881923520074254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8532881923520074254.bin' '-l' '-1' '-v' '-w' '/tmp/graph8532881923520074254.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:17:44] [INFO ] Decomposing Gal with order
[2025-06-03 10:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:17:44] [INFO ] Removed a total of 3199 redundant transitions.
[2025-06-03 10:17:45] [INFO ] Flatten gal took : 577 ms
[2025-06-03 10:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1542 labels/synchronizations in 218 ms.
[2025-06-03 10:17:45] [INFO ] Time to serialize gal into /tmp/LTL18320120274045410583.gal : 35 ms
[2025-06-03 10:17:45] [INFO ] Time to serialize properties into /tmp/LTL9575469521485153808.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18320120274045410583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9575469521485153808.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(((!("(((i0.u3.ThereIsAMasterInTheLeafSet>=1)&&(i0.u22.Node1WantsToManageTheCrashOfNode15>=1))&&((i1.u37.Node1HasDetectedCrashOf...3334
Formula 0 simplified : XX(("(((i0.u3.ThereIsAMasterInTheLeafSet>=1)&&(i0.u22.Node1WantsToManageTheCrashOfNode15>=1))&&((i1.u37.Node1HasDetectedCrashOfNode1...3220
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04 finished in 455017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1269 transition count 2836
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1250 transition count 2836
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 38 place count 1250 transition count 2813
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 84 place count 1227 transition count 2813
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 102 place count 1209 transition count 2750
Iterating global reduction 2 with 18 rules applied. Total rules applied 120 place count 1209 transition count 2750
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 120 place count 1209 transition count 2745
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 130 place count 1204 transition count 2745
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 139 place count 1195 transition count 2696
Iterating global reduction 2 with 9 rules applied. Total rules applied 148 place count 1195 transition count 2696
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 1194 transition count 2690
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 1194 transition count 2690
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 200 place count 1169 transition count 2665
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 1164 transition count 2660
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 1164 transition count 2660
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 1159 transition count 2630
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 1159 transition count 2630
Applied a total of 220 rules in 625 ms. Remains 1159 /1269 variables (removed 110) and now considering 2630/2855 (removed 225) transitions.
[2025-06-03 10:18:01] [INFO ] Flow matrix only has 2358 transitions (discarded 272 similar events)
// Phase 1: matrix 2358 rows 1159 cols
[2025-06-03 10:18:01] [INFO ] Computed 63 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:03] [INFO ] Implicit Places using invariants in 2236 ms returned [9, 254, 266, 484, 502, 573, 583, 612, 623, 631, 674, 699, 726, 843, 930, 976]
[2025-06-03 10:18:03] [INFO ] Actually due to overlaps returned [623, 976, 9, 266, 484, 502, 573, 583, 612, 631, 674, 699, 726, 930]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2239 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1145/1269 places, 2630/2855 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1137 transition count 2622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1137 transition count 2622
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1129 transition count 2614
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1129 transition count 2614
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1121 transition count 2566
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1121 transition count 2566
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1117 transition count 2562
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1113 transition count 2558
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1113 transition count 2558
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1109 transition count 2534
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1109 transition count 2534
Applied a total of 72 rules in 608 ms. Remains 1109 /1145 variables (removed 36) and now considering 2534/2630 (removed 96) transitions.
[2025-06-03 10:18:04] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1109 cols
[2025-06-03 10:18:04] [INFO ] Computed 49 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:06] [INFO ] Implicit Places using invariants in 2234 ms returned [252, 809]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2237 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1269 places, 2534/2855 transitions.
Applied a total of 0 rules in 113 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5825 ms. Remains : 1107/1269 places, 2534/2855 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05 finished in 5879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X(X(X(X(F(p1))))))) U X(!p2)))'
Support contains 6 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1244 transition count 2785
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1244 transition count 2785
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 66 place count 1228 transition count 2729
Iterating global reduction 0 with 16 rules applied. Total rules applied 82 place count 1228 transition count 2729
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1220 transition count 2681
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1220 transition count 2681
Applied a total of 98 rules in 282 ms. Remains 1220 /1269 variables (removed 49) and now considering 2681/2855 (removed 174) transitions.
[2025-06-03 10:18:06] [INFO ] Flow matrix only has 2409 transitions (discarded 272 similar events)
// Phase 1: matrix 2409 rows 1220 cols
[2025-06-03 10:18:06] [INFO ] Computed 63 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:09] [INFO ] Implicit Places using invariants in 2755 ms returned [13, 280, 294, 420, 514, 534, 609, 619, 651, 663, 672, 690, 715, 740, 770, 889, 977, 1024]
[2025-06-03 10:18:09] [INFO ] Actually due to overlaps returned [663, 1024, 13, 294, 420, 514, 534, 609, 619, 651, 672, 690, 715, 740, 770, 977]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2766 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1204/1269 places, 2681/2855 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1190 transition count 2667
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1190 transition count 2667
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1176 transition count 2653
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1176 transition count 2653
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1162 transition count 2639
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1162 transition count 2639
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 98 place count 1148 transition count 2555
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 1148 transition count 2555
Applied a total of 112 rules in 499 ms. Remains 1148 /1204 variables (removed 56) and now considering 2555/2681 (removed 126) transitions.
[2025-06-03 10:18:10] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1148 cols
[2025-06-03 10:18:10] [INFO ] Computed 47 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:12] [INFO ] Implicit Places using invariants in 2246 ms returned [278, 836]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2249 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1269 places, 2555/2855 transitions.
Applied a total of 0 rules in 67 ms. Remains 1146 /1146 variables (removed 0) and now considering 2555/2555 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5870 ms. Remains : 1146/1269 places, 2555/2855 transitions.
Stuttering acceptance computed with spot in 339 ms :[p2, (AND p2 (NOT p1)), p2, (OR (AND (NOT p1) p2) (AND p0 p2)), (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 974 ms.
Product exploration explored 100000 steps with 50000 reset in 900 ms.
Computed a total of 314 stabilizing places and 922 stable transitions
Computed a total of 314 stabilizing places and 922 stable transitions
Detected a total of 314/1146 stabilizing places and 922/2555 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 finished in 8154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1269 transition count 2835
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1249 transition count 2835
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 40 place count 1249 transition count 2812
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 86 place count 1226 transition count 2812
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 104 place count 1208 transition count 2749
Iterating global reduction 2 with 18 rules applied. Total rules applied 122 place count 1208 transition count 2749
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 122 place count 1208 transition count 2744
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1203 transition count 2744
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 1194 transition count 2695
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 1194 transition count 2695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1193 transition count 2689
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1193 transition count 2689
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 202 place count 1168 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 1162 transition count 2658
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 1162 transition count 2658
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 1156 transition count 2622
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 1156 transition count 2622
Applied a total of 226 rules in 679 ms. Remains 1156 /1269 variables (removed 113) and now considering 2622/2855 (removed 233) transitions.
[2025-06-03 10:18:15] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1156 cols
[2025-06-03 10:18:15] [INFO ] Computed 63 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:17] [INFO ] Implicit Places using invariants in 2626 ms returned [9, 254, 266, 390, 481, 499, 570, 580, 609, 620, 628, 646, 668, 693, 840, 927, 973]
[2025-06-03 10:18:17] [INFO ] Actually due to overlaps returned [620, 973, 9, 266, 390, 481, 499, 570, 580, 609, 628, 646, 668, 693, 927]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2630 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1141/1269 places, 2622/2855 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1132 transition count 2613
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1132 transition count 2613
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1123 transition count 2604
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1123 transition count 2604
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1114 transition count 2550
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1114 transition count 2550
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1110 transition count 2546
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1106 transition count 2542
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1106 transition count 2542
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 1102 transition count 2518
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 1102 transition count 2518
Applied a total of 78 rules in 741 ms. Remains 1102 /1141 variables (removed 39) and now considering 2518/2622 (removed 104) transitions.
[2025-06-03 10:18:18] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1102 cols
[2025-06-03 10:18:18] [INFO ] Computed 48 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:20] [INFO ] Implicit Places using invariants in 2260 ms returned [252, 803]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2265 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1100/1269 places, 2518/2855 transitions.
Applied a total of 0 rules in 150 ms. Remains 1100 /1100 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6473 ms. Remains : 1100/1269 places, 2518/2855 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07 finished in 6546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1245 transition count 2786
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1245 transition count 2786
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1230 transition count 2736
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1230 transition count 2736
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1222 transition count 2688
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1222 transition count 2688
Applied a total of 94 rules in 379 ms. Remains 1222 /1269 variables (removed 47) and now considering 2688/2855 (removed 167) transitions.
[2025-06-03 10:18:21] [INFO ] Flow matrix only has 2416 transitions (discarded 272 similar events)
// Phase 1: matrix 2416 rows 1222 cols
[2025-06-03 10:18:21] [INFO ] Computed 63 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:24] [INFO ] Implicit Places using invariants in 2943 ms returned [13, 280, 422, 516, 536, 611, 621, 653, 665, 674, 692, 717, 742, 772, 891, 979, 1026]
[2025-06-03 10:18:24] [INFO ] Actually due to overlaps returned [665, 1026, 13, 422, 516, 536, 611, 621, 653, 674, 692, 717, 742, 772, 979]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2946 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1207/1269 places, 2688/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1194 transition count 2675
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1194 transition count 2675
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1181 transition count 2662
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1181 transition count 2662
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1168 transition count 2649
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1168 transition count 2649
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1155 transition count 2571
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1155 transition count 2571
Applied a total of 104 rules in 507 ms. Remains 1155 /1207 variables (removed 52) and now considering 2571/2688 (removed 117) transitions.
[2025-06-03 10:18:24] [INFO ] Flow matrix only has 2299 transitions (discarded 272 similar events)
// Phase 1: matrix 2299 rows 1155 cols
[2025-06-03 10:18:25] [INFO ] Computed 48 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:27] [INFO ] Implicit Places using invariants in 2438 ms returned [278, 842]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2440 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1153/1269 places, 2571/2855 transitions.
Applied a total of 0 rules in 85 ms. Remains 1153 /1153 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6357 ms. Remains : 1153/1269 places, 2571/2855 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08 finished in 6564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||F(p1)))) U (G(!p1)||(!p1&&F(p2)))))'
Support contains 6 out of 1269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1269 transition count 2834
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1248 transition count 2834
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 1248 transition count 2813
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 1227 transition count 2813
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 1211 transition count 2752
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 1211 transition count 2752
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 116 place count 1211 transition count 2749
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 1208 transition count 2749
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 1201 transition count 2712
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 1201 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 1200 transition count 2706
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 1200 transition count 2706
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 192 place count 1173 transition count 2679
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 199 place count 1166 transition count 2672
Iterating global reduction 2 with 7 rules applied. Total rules applied 206 place count 1166 transition count 2672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 1159 transition count 2630
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 1159 transition count 2630
Applied a total of 220 rules in 682 ms. Remains 1159 /1269 variables (removed 110) and now considering 2630/2855 (removed 225) transitions.
[2025-06-03 10:18:28] [INFO ] Flow matrix only has 2358 transitions (discarded 272 similar events)
// Phase 1: matrix 2358 rows 1159 cols
[2025-06-03 10:18:28] [INFO ] Computed 63 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:30] [INFO ] Implicit Places using invariants in 2492 ms returned [9, 256, 268, 392, 483, 587, 617, 628, 636, 654, 676, 701, 728, 845, 932, 978]
[2025-06-03 10:18:30] [INFO ] Actually due to overlaps returned [628, 978, 9, 268, 392, 483, 587, 617, 636, 654, 676, 701, 728, 932]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 2496 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1145/1269 places, 2630/2855 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1137 transition count 2622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1137 transition count 2622
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1129 transition count 2614
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1129 transition count 2614
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1121 transition count 2566
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1121 transition count 2566
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1117 transition count 2562
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1113 transition count 2558
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1113 transition count 2558
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1109 transition count 2534
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1109 transition count 2534
Applied a total of 72 rules in 742 ms. Remains 1109 /1145 variables (removed 36) and now considering 2534/2630 (removed 96) transitions.
[2025-06-03 10:18:31] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1109 cols
[2025-06-03 10:18:31] [INFO ] Computed 49 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:18:33] [INFO ] Implicit Places using invariants in 2258 ms returned [254, 811]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2260 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1269 places, 2534/2855 transitions.
Applied a total of 0 rules in 184 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6364 ms. Remains : 1107/1269 places, 2534/2855 transitions.
Stuttering acceptance computed with spot in 299 ms :[p1, (AND (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09
Product exploration explored 100000 steps with 2281 reset in 667 ms.
Product exploration explored 100000 steps with 2278 reset in 684 ms.
Computed a total of 292 stabilizing places and 918 stable transitions
Computed a total of 292 stabilizing places and 918 stable transitions
Detected a total of 292/1107 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 332 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (910 resets) in 520 ms. (76 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (188 resets) in 108 ms. (367 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (188 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
[2025-06-03 10:18:36] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1107 cols
[2025-06-03 10:18:36] [INFO ] Computed 47 invariants in 26 ms
[2025-06-03 10:18:36] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 761/767 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 302/1069 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1069 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/1095 variables, 26/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/1107 variables, 12/47 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1107 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2262/3369 variables, 1107/1154 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3369 variables, 848/2002 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3369 variables, 0/2002 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3369 variables, 0/2002 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3369/3369 variables, and 2002 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 1107/1107 constraints, ReadFeed: 848/848 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 761/767 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 302/1069 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:39] [INFO ] Deduced a trap composed of 47 places in 1036 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:41] [INFO ] Deduced a trap composed of 61 places in 1190 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:42] [INFO ] Deduced a trap composed of 62 places in 1069 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:43] [INFO ] Deduced a trap composed of 58 places in 1201 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:44] [INFO ] Deduced a trap composed of 58 places in 1108 ms of which 138 ms to minimize.
SMT process timed out in 7783ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 0 with 135 rules applied. Total rules applied 135 place count 1107 transition count 3729
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 0 with 135 rules applied. Total rules applied 270 place count 972 transition count 3729
Applied a total of 270 rules in 397 ms. Remains 972 /1107 variables (removed 135) and now considering 3729/2534 (removed -1195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 972/1107 places, 3729/2534 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1277 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (124 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 52679 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 52679 steps, saw 22102 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 10:18:48] [INFO ] Flow matrix only has 3331 transitions (discarded 398 similar events)
// Phase 1: matrix 3331 rows 972 cols
[2025-06-03 10:18:48] [INFO ] Computed 47 invariants in 36 ms
[2025-06-03 10:18:48] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 626/632 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/632 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 302/934 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:49] [INFO ] Deduced a trap composed of 5 places in 1163 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:51] [INFO ] Deduced a trap composed of 27 places in 1222 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:52] [INFO ] Deduced a trap composed of 46 places in 1242 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:53] [INFO ] Deduced a trap composed of 54 places in 1205 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:54] [INFO ] Deduced a trap composed of 54 places in 1205 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:56] [INFO ] Deduced a trap composed of 48 places in 1198 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:57] [INFO ] Deduced a trap composed of 53 places in 1189 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:58] [INFO ] Deduced a trap composed of 54 places in 1244 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:18:59] [INFO ] Deduced a trap composed of 55 places in 1256 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:01] [INFO ] Deduced a trap composed of 55 places in 1195 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:02] [INFO ] Deduced a trap composed of 55 places in 1180 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:03] [INFO ] Deduced a trap composed of 53 places in 1214 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:04] [INFO ] Deduced a trap composed of 55 places in 1202 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:05] [INFO ] Deduced a trap composed of 55 places in 1197 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:07] [INFO ] Deduced a trap composed of 55 places in 1199 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:08] [INFO ] Deduced a trap composed of 53 places in 1294 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:09] [INFO ] Deduced a trap composed of 53 places in 1192 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:10] [INFO ] Deduced a trap composed of 133 places in 1116 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:12] [INFO ] Deduced a trap composed of 54 places in 1280 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:13] [INFO ] Deduced a trap composed of 54 places in 1164 ms of which 44 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:14] [INFO ] Deduced a trap composed of 53 places in 1269 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:15] [INFO ] Deduced a trap composed of 54 places in 1269 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:16] [INFO ] Deduced a trap composed of 134 places in 1071 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:18] [INFO ] Deduced a trap composed of 139 places in 1179 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:19] [INFO ] Deduced a trap composed of 54 places in 1391 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:20] [INFO ] Deduced a trap composed of 54 places in 1257 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:21] [INFO ] Deduced a trap composed of 133 places in 1063 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:23] [INFO ] Deduced a trap composed of 138 places in 1058 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:24] [INFO ] Deduced a trap composed of 139 places in 1090 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:25] [INFO ] Deduced a trap composed of 144 places in 1071 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:26] [INFO ] Deduced a trap composed of 55 places in 1215 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:27] [INFO ] Deduced a trap composed of 55 places in 1186 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:28] [INFO ] Deduced a trap composed of 55 places in 1259 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:30] [INFO ] Deduced a trap composed of 55 places in 1239 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:31] [INFO ] Deduced a trap composed of 55 places in 1331 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:32] [INFO ] Deduced a trap composed of 55 places in 1220 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:34] [INFO ] Deduced a trap composed of 55 places in 1251 ms of which 95 ms to minimize.
SMT process timed out in 45620ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 3729/3729 transitions.
Applied a total of 0 rules in 123 ms. Remains 972 /972 variables (removed 0) and now considering 3729/3729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 972/972 places, 3729/3729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 3729/3729 transitions.
Applied a total of 0 rules in 124 ms. Remains 972 /972 variables (removed 0) and now considering 3729/3729 (removed 0) transitions.
[2025-06-03 10:19:34] [INFO ] Flow matrix only has 3331 transitions (discarded 398 similar events)
[2025-06-03 10:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:19:36] [INFO ] Implicit Places using invariants in 2223 ms returned []
[2025-06-03 10:19:36] [INFO ] Flow matrix only has 3331 transitions (discarded 398 similar events)
[2025-06-03 10:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:19:38] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:20:08] [INFO ] Performed 314/972 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:20:38] [INFO ] Performed 511/972 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:21:09] [INFO ] Performed 943/972 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 10:21:15] [INFO ] Implicit Places using invariants and state equation in 98472 ms returned []
Implicit Place search using SMT with State Equation took 100697 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:21:15] [INFO ] Redundant transitions in 248 ms returned []
Running 3667 sub problems to find dead transitions.
[2025-06-03 10:21:15] [INFO ] Flow matrix only has 3331 transitions (discarded 398 similar events)
[2025-06-03 10:21:15] [INFO ] Invariant cache hit.
[2025-06-03 10:21:15] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 0.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 1.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 0.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/970 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3667 unsolved
SMT process timed out in 35334ms, After SMT, problems are : Problem set: 0 solved, 3667 unsolved
Search for dead transitions found 0 dead transitions in 35345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136440 ms. Remains : 972/972 places, 3729/3729 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p1)]
Knowledge based reduction with 20 factoid took 799 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 228 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Applied a total of 0 rules in 110 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2025-06-03 10:21:52] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1107 cols
[2025-06-03 10:21:52] [INFO ] Computed 47 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:21:54] [INFO ] Implicit Places using invariants in 2244 ms returned []
[2025-06-03 10:21:54] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2025-06-03 10:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:21:55] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 10:22:22] [INFO ] Implicit Places using invariants and state equation in 27978 ms returned [1101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30227 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1106/1107 places, 2534/2534 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1106 transition count 2533
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 2 place count 1105 transition count 2533
Applied a total of 2 rules in 119 ms. Remains 1105 /1106 variables (removed 1) and now considering 2533/2534 (removed 1) transitions.
[2025-06-03 10:22:22] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1105 cols
[2025-06-03 10:22:22] [INFO ] Computed 46 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:22:24] [INFO ] Implicit Places using invariants in 2284 ms returned []
[2025-06-03 10:22:24] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 10:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:22:25] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 10:22:56] [INFO ] Performed 1100/1105 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:22:56] [INFO ] Implicit Places using invariants and state equation in 31551 ms returned []
Implicit Place search using SMT with State Equation took 33837 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1105/1107 places, 2533/2534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64293 ms. Remains : 1105/1107 places, 2533/2534 transitions.
Computed a total of 290 stabilizing places and 917 stable transitions
Computed a total of 290 stabilizing places and 917 stable transitions
Detected a total of 290/1105 stabilizing places and 917/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 380 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (909 resets) in 500 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (188 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (188 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (188 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (188 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (188 resets) in 116 ms. (341 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (188 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
[2025-06-03 10:22:57] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 10:22:57] [INFO ] Invariant cache hit.
[2025-06-03 10:22:57] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 760/766 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 302/1068 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/1094 variables, 26/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/1105 variables, 11/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1105 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2261/3366 variables, 1105/1151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3366 variables, 848/1999 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3366 variables, 0/1999 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3366 variables, 0/1999 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3366/3366 variables, and 1999 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1105/1105 constraints, ReadFeed: 848/848 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 762/766 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 302/1068 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:00] [INFO ] Deduced a trap composed of 65 places in 1046 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:02] [INFO ] Deduced a trap composed of 66 places in 1236 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:03] [INFO ] Deduced a trap composed of 66 places in 1136 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:04] [INFO ] Deduced a trap composed of 66 places in 1234 ms of which 160 ms to minimize.
SMT process timed out in 7259ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1105/1105 places, 2533/2533 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1105 transition count 2532
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 2 place count 1104 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1103 transition count 2531
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1103 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1102 transition count 2525
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1102 transition count 2525
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 0 with 134 rules applied. Total rules applied 140 place count 1102 transition count 3726
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 0 with 134 rules applied. Total rules applied 274 place count 968 transition count 3726
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 275 place count 968 transition count 3726
Applied a total of 275 rules in 557 ms. Remains 968 /1105 variables (removed 137) and now considering 3726/2533 (removed -1193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 968/1105 places, 3726/2533 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1418 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (126 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (126 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (139 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 51486 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 3
Probabilistic random walk after 51486 steps, saw 21614 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 10:23:08] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
// Phase 1: matrix 3328 rows 968 cols
[2025-06-03 10:23:08] [INFO ] Computed 46 invariants in 55 ms
[2025-06-03 10:23:08] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 896/900 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:10] [INFO ] Deduced a trap composed of 610 places in 1208 ms of which 317 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 31/931 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/931 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/957 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/957 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/968 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3328/4296 variables, 968/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4296 variables, 2178/3193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4296 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4296 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4296/4296 variables, and 3193 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4281 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 968/968 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 896/900 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:14] [INFO ] Deduced a trap composed of 77 places in 1179 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:15] [INFO ] Deduced a trap composed of 76 places in 1200 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:17] [INFO ] Deduced a trap composed of 173 places in 1406 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:18] [INFO ] Deduced a trap composed of 77 places in 1164 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:19] [INFO ] Deduced a trap composed of 76 places in 1166 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:20] [INFO ] Deduced a trap composed of 93 places in 1161 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:22] [INFO ] Deduced a trap composed of 125 places in 1377 ms of which 231 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:23] [INFO ] Deduced a trap composed of 147 places in 1183 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:24] [INFO ] Deduced a trap composed of 83 places in 1175 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:25] [INFO ] Deduced a trap composed of 147 places in 1257 ms of which 207 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/931 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:27] [INFO ] Deduced a trap composed of 5 places in 1248 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:28] [INFO ] Deduced a trap composed of 27 places in 1238 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:29] [INFO ] Deduced a trap composed of 27 places in 1237 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:31] [INFO ] Deduced a trap composed of 50 places in 1396 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:32] [INFO ] Deduced a trap composed of 51 places in 1296 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:33] [INFO ] Deduced a trap composed of 51 places in 1287 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:35] [INFO ] Deduced a trap composed of 51 places in 1295 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:36] [INFO ] Deduced a trap composed of 51 places in 1321 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:37] [INFO ] Deduced a trap composed of 51 places in 1275 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:39] [INFO ] Deduced a trap composed of 51 places in 1290 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:40] [INFO ] Deduced a trap composed of 52 places in 1239 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:41] [INFO ] Deduced a trap composed of 51 places in 1278 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:42] [INFO ] Deduced a trap composed of 57 places in 1223 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:44] [INFO ] Deduced a trap composed of 46 places in 1201 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:45] [INFO ] Deduced a trap composed of 46 places in 1187 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:46] [INFO ] Deduced a trap composed of 56 places in 1200 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:47] [INFO ] Deduced a trap composed of 50 places in 1275 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:49] [INFO ] Deduced a trap composed of 55 places in 1299 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:50] [INFO ] Deduced a trap composed of 56 places in 1487 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:51] [INFO ] Deduced a trap composed of 56 places in 1248 ms of which 98 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:53] [INFO ] Deduced a trap composed of 57 places in 1262 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:54] [INFO ] Deduced a trap composed of 57 places in 1502 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:55] [INFO ] Deduced a trap composed of 75 places in 1107 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:57] [INFO ] Deduced a trap composed of 56 places in 1248 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:58] [INFO ] Deduced a trap composed of 50 places in 1276 ms of which 103 ms to minimize.
SMT process timed out in 49647ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 122 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 968/968 places, 3726/3726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 121 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
[2025-06-03 10:23:58] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2025-06-03 10:23:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:24:00] [INFO ] Implicit Places using invariants in 2350 ms returned [424]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2353 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 967/968 places, 3726/3726 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 966 transition count 3725
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 966 transition count 3725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 965 transition count 3724
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 965 transition count 3724
Applied a total of 4 rules in 215 ms. Remains 965 /967 variables (removed 2) and now considering 3724/3726 (removed 2) transitions.
[2025-06-03 10:24:01] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
// Phase 1: matrix 3326 rows 965 cols
[2025-06-03 10:24:01] [INFO ] Computed 45 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:24:03] [INFO ] Implicit Places using invariants in 2360 ms returned []
[2025-06-03 10:24:03] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
[2025-06-03 10:24:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:24:04] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:24:35] [INFO ] Performed 321/965 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:25:05] [INFO ] Performed 491/965 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:25:35] [INFO ] Performed 876/965 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 10:25:42] [INFO ] Implicit Places using invariants and state equation in 99212 ms returned []
Implicit Place search using SMT with State Equation took 101575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 965/968 places, 3724/3726 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 104265 ms. Remains : 965/968 places, 3724/3726 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 20 factoid took 759 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 226 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 223 ms :[p1, p1, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 2279 reset in 669 ms.
Product exploration explored 100000 steps with 2281 reset in 712 ms.
Built C files in :
/tmp/ltsmin13667556122974830114
[2025-06-03 10:25:45] [INFO ] Too many transitions (2533) to apply POR reductions. Disabling POR matrices.
[2025-06-03 10:25:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13667556122974830114
Running compilation step : cd /tmp/ltsmin13667556122974830114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13667556122974830114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13667556122974830114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1105/1105 places, 2533/2533 transitions.
Applied a total of 0 rules in 125 ms. Remains 1105 /1105 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
[2025-06-03 10:25:48] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1105 cols
[2025-06-03 10:25:48] [INFO ] Computed 46 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:25:50] [INFO ] Implicit Places using invariants in 2142 ms returned []
[2025-06-03 10:25:50] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 10:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:25:52] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 10:26:22] [INFO ] Performed 1078/1105 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:26:23] [INFO ] Implicit Places using invariants and state equation in 32089 ms returned []
Implicit Place search using SMT with State Equation took 34236 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:26:23] [INFO ] Redundant transitions in 120 ms returned []
Running 2516 sub problems to find dead transitions.
[2025-06-03 10:26:23] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 10:26:23] [INFO ] Invariant cache hit.
[2025-06-03 10:26:23] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1103 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2516 unsolved
SMT process timed out in 31673ms, After SMT, problems are : Problem set: 0 solved, 2516 unsolved
Search for dead transitions found 0 dead transitions in 31680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66175 ms. Remains : 1105/1105 places, 2533/2533 transitions.
Built C files in :
/tmp/ltsmin16635083048190262208
[2025-06-03 10:26:54] [INFO ] Too many transitions (2533) to apply POR reductions. Disabling POR matrices.
[2025-06-03 10:26:54] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16635083048190262208
Running compilation step : cd /tmp/ltsmin16635083048190262208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16635083048190262208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16635083048190262208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 10:26:58] [INFO ] Flatten gal took : 72 ms
[2025-06-03 10:26:58] [INFO ] Flatten gal took : 72 ms
[2025-06-03 10:26:58] [INFO ] Time to serialize gal into /tmp/LTL6821785768710120439.gal : 14 ms
[2025-06-03 10:26:58] [INFO ] Time to serialize properties into /tmp/LTL11747526736678486774.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6821785768710120439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10494535238287890671.hoa' '-atoms' '/tmp/LTL11747526736678486774.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11747526736678486774.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10494535238287890671.hoa
Detected timeout of ITS tools.
[2025-06-03 10:27:13] [INFO ] Flatten gal took : 64 ms
[2025-06-03 10:27:13] [INFO ] Flatten gal took : 68 ms
[2025-06-03 10:27:13] [INFO ] Time to serialize gal into /tmp/LTL8891256139831003595.gal : 13 ms
[2025-06-03 10:27:13] [INFO ] Time to serialize properties into /tmp/LTL38676065012733333.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8891256139831003595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL38676065012733333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !(((X(G((F("((Node9HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(LeafSetOfLx5IsSentToNode9>=1))"))||("((Node0ThinksNode4ShouldBeNodeMast...500
Formula 0 simplified : XF(!"((Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11>=1)&&(NodesCanDetectThatNode4HasCrashed>=1))" & G!"((Node9HasAskedItsLeafSe...479
Detected timeout of ITS tools.
[2025-06-03 10:27:28] [INFO ] Flatten gal took : 62 ms
[2025-06-03 10:27:28] [INFO ] Applying decomposition
[2025-06-03 10:27:28] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12718692931317257818.txt' '-o' '/tmp/graph12718692931317257818.bin' '-w' '/tmp/graph12718692931317257818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12718692931317257818.bin' '-l' '-1' '-v' '-w' '/tmp/graph12718692931317257818.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:27:28] [INFO ] Decomposing Gal with order
[2025-06-03 10:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:27:29] [INFO ] Removed a total of 2271 redundant transitions.
[2025-06-03 10:27:29] [INFO ] Flatten gal took : 377 ms
[2025-06-03 10:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1290 labels/synchronizations in 138 ms.
[2025-06-03 10:27:29] [INFO ] Time to serialize gal into /tmp/LTL6839663732356384305.gal : 25 ms
[2025-06-03 10:27:29] [INFO ] Time to serialize properties into /tmp/LTL4775194553746032052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6839663732356384305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4775194553746032052.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(G((F("((i19.u79.Node9HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(i19.u79.LeafSetOfLx5IsSentToNode9>=1))"))||("((i13.u12.Node0Thi...580
Formula 0 simplified : XF(!"((i13.u12.Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11>=1)&&(i11.u98.NodesCanDetectThatNode4HasCrashed>=1))" & G!"((i19.u7...559
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 finished in 556822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1269 transition count 2835
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1249 transition count 2835
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 40 place count 1249 transition count 2812
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 86 place count 1226 transition count 2812
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 104 place count 1208 transition count 2749
Iterating global reduction 2 with 18 rules applied. Total rules applied 122 place count 1208 transition count 2749
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 122 place count 1208 transition count 2744
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1203 transition count 2744
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 1194 transition count 2695
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 1194 transition count 2695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1193 transition count 2689
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1193 transition count 2689
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 202 place count 1168 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 1162 transition count 2658
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 1162 transition count 2658
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 1156 transition count 2622
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 1156 transition count 2622
Applied a total of 226 rules in 616 ms. Remains 1156 /1269 variables (removed 113) and now considering 2622/2855 (removed 233) transitions.
[2025-06-03 10:27:45] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1156 cols
[2025-06-03 10:27:45] [INFO ] Computed 63 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:27:47] [INFO ] Implicit Places using invariants in 2496 ms returned [257, 269, 393, 484, 502, 573, 583, 612, 623, 631, 649, 671, 696, 723, 840, 927, 973]
[2025-06-03 10:27:47] [INFO ] Actually due to overlaps returned [623, 973, 269, 393, 484, 502, 573, 583, 612, 631, 649, 671, 696, 723, 927]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2504 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1141/1269 places, 2622/2855 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1132 transition count 2613
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1132 transition count 2613
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1123 transition count 2604
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1123 transition count 2604
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1114 transition count 2550
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1114 transition count 2550
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1110 transition count 2546
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1106 transition count 2542
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1106 transition count 2542
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 1102 transition count 2518
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 1102 transition count 2518
Applied a total of 78 rules in 598 ms. Remains 1102 /1141 variables (removed 39) and now considering 2518/2622 (removed 104) transitions.
[2025-06-03 10:27:48] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1102 cols
[2025-06-03 10:27:48] [INFO ] Computed 48 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:27:50] [INFO ] Implicit Places using invariants in 2179 ms returned [257, 803]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2181 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1100/1269 places, 2518/2855 transitions.
Applied a total of 0 rules in 163 ms. Remains 1100 /1100 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6063 ms. Remains : 1100/1269 places, 2518/2855 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10
Product exploration explored 100000 steps with 2277 reset in 724 ms.
Product exploration explored 100000 steps with 2280 reset in 666 ms.
Computed a total of 285 stabilizing places and 902 stable transitions
Computed a total of 285 stabilizing places and 902 stable transitions
Detected a total of 285/1100 stabilizing places and 902/2518 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (910 resets) in 416 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (188 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (188 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2025-06-03 10:27:52] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1100 cols
[2025-06-03 10:27:52] [INFO ] Computed 46 invariants in 26 ms
[2025-06-03 10:27:52] [INFO ] State equation strengthened by 838 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 1027/1030 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:27:53] [INFO ] Deduced a trap composed of 85 places in 1183 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:27:54] [INFO ] Deduced a trap composed of 85 places in 890 ms of which 120 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/1031 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 31/1062 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1062 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1088 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/1100 variables, 12/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1100 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2246/3346 variables, 1100/1148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3346 variables, 838/1986 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3346 variables, 0/1986 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3346 variables, 0/1986 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3346/3346 variables, and 1986 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1100/1100 constraints, ReadFeed: 838/838 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1010/1012 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1012 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1031 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:27:57] [INFO ] Deduced a trap composed of 105 places in 1192 ms of which 219 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:27:58] [INFO ] Deduced a trap composed of 165 places in 1197 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:00] [INFO ] Deduced a trap composed of 105 places in 1148 ms of which 216 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:01] [INFO ] Deduced a trap composed of 121 places in 1315 ms of which 221 ms to minimize.
SMT process timed out in 8946ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 2518/2518 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1100 transition count 2517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1099 transition count 2517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1098 transition count 2516
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1098 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1097 transition count 2510
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1097 transition count 2510
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 138 place count 1097 transition count 3723
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 270 place count 965 transition count 3723
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 965 transition count 3723
Applied a total of 271 rules in 570 ms. Remains 965 /1100 variables (removed 135) and now considering 3723/2518 (removed -1205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 965/1100 places, 3723/2518 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1127 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 56041 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 56041 steps, saw 23486 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 10:28:05] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
// Phase 1: matrix 3325 rows 965 cols
[2025-06-03 10:28:05] [INFO ] Computed 46 invariants in 24 ms
[2025-06-03 10:28:05] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:06] [INFO ] Deduced a trap composed of 145 places in 1240 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:08] [INFO ] Deduced a trap composed of 90 places in 1192 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:09] [INFO ] Deduced a trap composed of 122 places in 1346 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:10] [INFO ] Deduced a trap composed of 74 places in 1141 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:11] [INFO ] Deduced a trap composed of 73 places in 1165 ms of which 101 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/927 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:13] [INFO ] Deduced a trap composed of 5 places in 1015 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:14] [INFO ] Deduced a trap composed of 27 places in 1083 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:15] [INFO ] Deduced a trap composed of 46 places in 1151 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:16] [INFO ] Deduced a trap composed of 62 places in 1197 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:17] [INFO ] Deduced a trap composed of 75 places in 1102 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:18] [INFO ] Deduced a trap composed of 75 places in 1128 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:19] [INFO ] Deduced a trap composed of 90 places in 1162 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:21] [INFO ] Deduced a trap composed of 85 places in 1099 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:22] [INFO ] Deduced a trap composed of 92 places in 1123 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:23] [INFO ] Deduced a trap composed of 94 places in 1129 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:24] [INFO ] Deduced a trap composed of 92 places in 1123 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:25] [INFO ] Deduced a trap composed of 97 places in 1120 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:26] [INFO ] Deduced a trap composed of 94 places in 1115 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:27] [INFO ] Deduced a trap composed of 101 places in 1110 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:29] [INFO ] Deduced a trap composed of 85 places in 1092 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:30] [INFO ] Deduced a trap composed of 92 places in 1120 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:31] [INFO ] Deduced a trap composed of 94 places in 1089 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:32] [INFO ] Deduced a trap composed of 92 places in 1104 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:33] [INFO ] Deduced a trap composed of 97 places in 1104 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:34] [INFO ] Deduced a trap composed of 94 places in 1100 ms of which 153 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:35] [INFO ] Deduced a trap composed of 194 places in 1043 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:36] [INFO ] Deduced a trap composed of 195 places in 1252 ms of which 277 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:38] [INFO ] Deduced a trap composed of 195 places in 1115 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:39] [INFO ] Deduced a trap composed of 195 places in 1096 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:40] [INFO ] Deduced a trap composed of 195 places in 1099 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:41] [INFO ] Deduced a trap composed of 195 places in 1101 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:42] [INFO ] Deduced a trap composed of 195 places in 1083 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:43] [INFO ] Deduced a trap composed of 195 places in 1087 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:44] [INFO ] Deduced a trap composed of 195 places in 1078 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:45] [INFO ] Deduced a trap composed of 195 places in 1082 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:46] [INFO ] Deduced a trap composed of 195 places in 1062 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:48] [INFO ] Deduced a trap composed of 207 places in 1056 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:49] [INFO ] Deduced a trap composed of 206 places in 1211 ms of which 284 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/953 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/965 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/965 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4290/4290 variables, and 1049 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 965/965 constraints, ReadFeed: 0/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/927 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:52] [INFO ] Deduced a trap composed of 27 places in 1328 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:53] [INFO ] Deduced a trap composed of 46 places in 1377 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:54] [INFO ] Deduced a trap composed of 54 places in 1382 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:56] [INFO ] Deduced a trap composed of 53 places in 1264 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:57] [INFO ] Deduced a trap composed of 53 places in 1267 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:28:58] [INFO ] Deduced a trap composed of 53 places in 1376 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:00] [INFO ] Deduced a trap composed of 54 places in 1272 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:01] [INFO ] Deduced a trap composed of 53 places in 1272 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:02] [INFO ] Deduced a trap composed of 53 places in 1401 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:04] [INFO ] Deduced a trap composed of 52 places in 1265 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:05] [INFO ] Deduced a trap composed of 54 places in 1254 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:06] [INFO ] Deduced a trap composed of 62 places in 1148 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:08] [INFO ] Deduced a trap composed of 55 places in 1406 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:09] [INFO ] Deduced a trap composed of 54 places in 1188 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:10] [INFO ] Deduced a trap composed of 75 places in 1099 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:11] [INFO ] Deduced a trap composed of 46 places in 1166 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:12] [INFO ] Deduced a trap composed of 54 places in 1218 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:14] [INFO ] Deduced a trap composed of 48 places in 1185 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:15] [INFO ] Deduced a trap composed of 60 places in 1202 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:16] [INFO ] Deduced a trap composed of 88 places in 1130 ms of which 146 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:17] [INFO ] Deduced a trap composed of 53 places in 1245 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:18] [INFO ] Deduced a trap composed of 55 places in 1268 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:20] [INFO ] Deduced a trap composed of 54 places in 1199 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:21] [INFO ] Deduced a trap composed of 62 places in 1098 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:22] [INFO ] Deduced a trap composed of 61 places in 1330 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:23] [INFO ] Deduced a trap composed of 104 places in 1229 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:25] [INFO ] Deduced a trap composed of 55 places in 1198 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:26] [INFO ] Deduced a trap composed of 75 places in 1298 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:27] [INFO ] Deduced a trap composed of 55 places in 1219 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:28] [INFO ] Deduced a trap composed of 71 places in 1093 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:29] [INFO ] Deduced a trap composed of 56 places in 1199 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:31] [INFO ] Deduced a trap composed of 97 places in 1128 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:32] [INFO ] Deduced a trap composed of 53 places in 1200 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:33] [INFO ] Deduced a trap composed of 54 places in 1225 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:34] [INFO ] Deduced a trap composed of 54 places in 1215 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:29:35] [INFO ] Deduced a trap composed of 62 places in 1114 ms of which 109 ms to minimize.
SMT process timed out in 90528ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 122 ms. Remains 965 /965 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 965/965 places, 3723/3723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 128 ms. Remains 965 /965 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
[2025-06-03 10:29:36] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
[2025-06-03 10:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:29:38] [INFO ] Implicit Places using invariants in 2335 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2341 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 964/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 122 ms. Remains 964 /964 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2592 ms. Remains : 964/965 places, 3723/3723 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1100/1100 places, 2518/2518 transitions.
Applied a total of 0 rules in 110 ms. Remains 1100 /1100 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
[2025-06-03 10:29:39] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1100 cols
[2025-06-03 10:29:39] [INFO ] Computed 46 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:29:41] [INFO ] Implicit Places using invariants in 2188 ms returned []
[2025-06-03 10:29:41] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
[2025-06-03 10:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:29:42] [INFO ] State equation strengthened by 838 read => feed constraints.
[2025-06-03 10:30:08] [INFO ] Implicit Places using invariants and state equation in 26772 ms returned [1094]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28968 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1099/1100 places, 2518/2518 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1099 transition count 2517
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 2 place count 1098 transition count 2517
Applied a total of 2 rules in 120 ms. Remains 1098 /1099 variables (removed 1) and now considering 2517/2518 (removed 1) transitions.
[2025-06-03 10:30:08] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1098 cols
[2025-06-03 10:30:08] [INFO ] Computed 45 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:30:10] [INFO ] Implicit Places using invariants in 2215 ms returned []
[2025-06-03 10:30:10] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2025-06-03 10:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:30:11] [INFO ] State equation strengthened by 838 read => feed constraints.
[2025-06-03 10:30:36] [INFO ] Implicit Places using invariants and state equation in 26342 ms returned []
Implicit Place search using SMT with State Equation took 28569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1098/1100 places, 2517/2518 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57768 ms. Remains : 1098/1100 places, 2517/2518 transitions.
Computed a total of 283 stabilizing places and 901 stable transitions
Computed a total of 283 stabilizing places and 901 stable transitions
Detected a total of 283/1098 stabilizing places and 901/2517 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23562 steps (534 resets) in 165 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2276 reset in 624 ms.
Product exploration explored 100000 steps with 2281 reset in 657 ms.
Built C files in :
/tmp/ltsmin7712912188367729308
[2025-06-03 10:30:38] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2025-06-03 10:30:38] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7712912188367729308
Running compilation step : cd /tmp/ltsmin7712912188367729308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7712912188367729308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7712912188367729308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1098/1098 places, 2517/2517 transitions.
Applied a total of 0 rules in 112 ms. Remains 1098 /1098 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2025-06-03 10:30:41] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2025-06-03 10:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:30:43] [INFO ] Implicit Places using invariants in 2070 ms returned []
[2025-06-03 10:30:43] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2025-06-03 10:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:30:45] [INFO ] State equation strengthened by 838 read => feed constraints.
[2025-06-03 10:31:13] [INFO ] Implicit Places using invariants and state equation in 29693 ms returned []
Implicit Place search using SMT with State Equation took 31767 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:31:13] [INFO ] Redundant transitions in 116 ms returned []
Running 2500 sub problems to find dead transitions.
[2025-06-03 10:31:13] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2025-06-03 10:31:13] [INFO ] Invariant cache hit.
[2025-06-03 10:31:13] [INFO ] State equation strengthened by 838 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 31590ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 31596ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63602 ms. Remains : 1098/1098 places, 2517/2517 transitions.
Built C files in :
/tmp/ltsmin13726598915094122723
[2025-06-03 10:31:45] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2025-06-03 10:31:45] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13726598915094122723
Running compilation step : cd /tmp/ltsmin13726598915094122723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13726598915094122723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13726598915094122723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 10:31:48] [INFO ] Flatten gal took : 61 ms
[2025-06-03 10:31:48] [INFO ] Flatten gal took : 64 ms
[2025-06-03 10:31:48] [INFO ] Time to serialize gal into /tmp/LTL9991148180507915865.gal : 12 ms
[2025-06-03 10:31:48] [INFO ] Time to serialize properties into /tmp/LTL10886168359961705156.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9991148180507915865.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3523260257317631003.hoa' '-atoms' '/tmp/LTL10886168359961705156.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10886168359961705156.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3523260257317631003.hoa
Detected timeout of ITS tools.
[2025-06-03 10:32:03] [INFO ] Flatten gal took : 62 ms
[2025-06-03 10:32:03] [INFO ] Flatten gal took : 65 ms
[2025-06-03 10:32:03] [INFO ] Time to serialize gal into /tmp/LTL13179103266944122918.gal : 12 ms
[2025-06-03 10:32:03] [INFO ] Time to serialize properties into /tmp/LTL112802253406020547.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13179103266944122918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL112802253406020547.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node0HasTheLeafSetOfLx3ToReplaceNode4<1)")||(G("((Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13>=1)&&(Node15NotifyThatH...176
Formula 0 simplified : G(F!"((Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13>=1)&&(Node15NotifyThatHeIsActive>=1))" & FG!"(Node0HasTheLeafSetOfLx3ToRep...169
Detected timeout of ITS tools.
[2025-06-03 10:32:19] [INFO ] Flatten gal took : 61 ms
[2025-06-03 10:32:19] [INFO ] Applying decomposition
[2025-06-03 10:32:19] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3882923505196868467.txt' '-o' '/tmp/graph3882923505196868467.bin' '-w' '/tmp/graph3882923505196868467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3882923505196868467.bin' '-l' '-1' '-v' '-w' '/tmp/graph3882923505196868467.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:32:19] [INFO ] Decomposing Gal with order
[2025-06-03 10:32:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:32:19] [INFO ] Removed a total of 2255 redundant transitions.
[2025-06-03 10:32:19] [INFO ] Flatten gal took : 311 ms
[2025-06-03 10:32:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1415 labels/synchronizations in 99 ms.
[2025-06-03 10:32:19] [INFO ] Time to serialize gal into /tmp/LTL6929404030301962545.gal : 26 ms
[2025-06-03 10:32:19] [INFO ] Time to serialize properties into /tmp/LTL12477441898949808251.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6929404030301962545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12477441898949808251.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i14.i0.u6.Node0HasTheLeafSetOfLx3ToReplaceNode4<1)")||(G("((i10.u15.Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13>=1)&&...203
Formula 0 simplified : G(F!"((i10.u15.Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13>=1)&&(i10.u118.Node15NotifyThatHeIsActive>=1))" & FG!"(i14.i0.u6.N...196
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 finished in 290392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(F(p1))||F((G(F(!p2))||(F(!p2)&&X(!p3))))))))'
Support contains 8 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1248 transition count 2799
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1248 transition count 2799
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 1234 transition count 2755
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 1234 transition count 2755
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 1226 transition count 2707
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 1226 transition count 2707
Applied a total of 86 rules in 290 ms. Remains 1226 /1269 variables (removed 43) and now considering 2707/2855 (removed 148) transitions.
[2025-06-03 10:32:35] [INFO ] Flow matrix only has 2435 transitions (discarded 272 similar events)
// Phase 1: matrix 2435 rows 1226 cols
[2025-06-03 10:32:35] [INFO ] Computed 63 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:32:38] [INFO ] Implicit Places using invariants in 2794 ms returned [13, 280, 294, 422, 540, 615, 625, 657, 669, 678, 696, 721, 746, 776, 895, 983, 1030]
[2025-06-03 10:32:38] [INFO ] Actually due to overlaps returned [669, 1030, 13, 294, 422, 540, 615, 625, 657, 678, 696, 721, 746, 776, 983]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2797 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1211/1269 places, 2707/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1198 transition count 2694
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1198 transition count 2694
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1185 transition count 2681
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1185 transition count 2681
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1172 transition count 2668
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1172 transition count 2668
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1159 transition count 2590
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1159 transition count 2590
Applied a total of 104 rules in 362 ms. Remains 1159 /1211 variables (removed 52) and now considering 2590/2707 (removed 117) transitions.
[2025-06-03 10:32:38] [INFO ] Flow matrix only has 2318 transitions (discarded 272 similar events)
// Phase 1: matrix 2318 rows 1159 cols
[2025-06-03 10:32:38] [INFO ] Computed 48 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:32:40] [INFO ] Implicit Places using invariants in 2469 ms returned [278, 846]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2471 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1157/1269 places, 2590/2855 transitions.
Applied a total of 0 rules in 69 ms. Remains 1157 /1157 variables (removed 0) and now considering 2590/2590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5990 ms. Remains : 1157/1269 places, 2590/2855 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND p3 (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11
Stuttering criterion allowed to conclude after 63 steps with 1 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11 finished in 6226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1245 transition count 2791
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1245 transition count 2791
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1229 transition count 2735
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1229 transition count 2735
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1221 transition count 2687
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1221 transition count 2687
Applied a total of 96 rules in 300 ms. Remains 1221 /1269 variables (removed 48) and now considering 2687/2855 (removed 168) transitions.
[2025-06-03 10:32:41] [INFO ] Flow matrix only has 2415 transitions (discarded 272 similar events)
// Phase 1: matrix 2415 rows 1221 cols
[2025-06-03 10:32:41] [INFO ] Computed 63 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:32:44] [INFO ] Implicit Places using invariants in 2669 ms returned [13, 280, 294, 420, 514, 534, 610, 620, 652, 664, 673, 691, 716, 741, 771, 890, 978, 1025]
[2025-06-03 10:32:44] [INFO ] Actually due to overlaps returned [664, 1025, 13, 294, 420, 514, 534, 610, 620, 652, 673, 691, 716, 741, 771, 978]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2671 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1205/1269 places, 2687/2855 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1191 transition count 2673
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1191 transition count 2673
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1177 transition count 2659
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1177 transition count 2659
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1163 transition count 2645
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1163 transition count 2645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 98 place count 1149 transition count 2561
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 1149 transition count 2561
Applied a total of 112 rules in 354 ms. Remains 1149 /1205 variables (removed 56) and now considering 2561/2687 (removed 126) transitions.
[2025-06-03 10:32:44] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1149 cols
[2025-06-03 10:32:44] [INFO ] Computed 47 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:32:46] [INFO ] Implicit Places using invariants in 2331 ms returned [278, 837]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2334 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1269 places, 2561/2855 transitions.
Applied a total of 0 rules in 69 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5730 ms. Remains : 1147/1269 places, 2561/2855 transitions.
Stuttering acceptance computed with spot in 286 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12
Product exploration explored 100000 steps with 1605 reset in 619 ms.
Product exploration explored 100000 steps with 1604 reset in 577 ms.
Computed a total of 315 stabilizing places and 928 stable transitions
Computed a total of 315 stabilizing places and 928 stable transitions
Detected a total of 315/1147 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 169 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (640 resets) in 371 ms. (107 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (172 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2025-06-03 10:32:48] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2025-06-03 10:32:48] [INFO ] Computed 45 invariants in 26 ms
[2025-06-03 10:32:48] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:32:50] [INFO ] Deduced a trap composed of 114 places in 1173 ms of which 172 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/1112 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/1140 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1140 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1147 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1147 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2289/3436 variables, 1147/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 833/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3436 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3436 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 2026 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3039 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1147/1147 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:32:53] [INFO ] Deduced a trap composed of 110 places in 1289 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:32:54] [INFO ] Deduced a trap composed of 194 places in 1420 ms of which 406 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/1112 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:32:56] [INFO ] Deduced a trap composed of 50 places in 1124 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:32:57] [INFO ] Deduced a trap composed of 139 places in 1285 ms of which 255 ms to minimize.
SMT process timed out in 8641ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 226 place count 1095 transition count 3062
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 348 place count 973 transition count 3062
Applied a total of 348 rules in 341 ms. Remains 973 /1147 variables (removed 174) and now considering 3062/2561 (removed -501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 973/1147 places, 3062/2561 transitions.
RANDOM walk for 40000 steps (1040 resets) in 805 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 57528 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57528 steps, saw 24177 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-03 10:33:01] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
// Phase 1: matrix 2672 rows 973 cols
[2025-06-03 10:33:01] [INFO ] Computed 45 invariants in 46 ms
[2025-06-03 10:33:01] [INFO ] State equation strengthened by 1508 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:02] [INFO ] Deduced a trap composed of 73 places in 1022 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/938 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/938 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/966 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/973 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2672/3645 variables, 973/1019 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3645 variables, 1508/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3645 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3645 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3645/3645 variables, and 2527 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3108 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 973/973 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:05] [INFO ] Deduced a trap composed of 105 places in 1231 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:07] [INFO ] Deduced a trap composed of 145 places in 1107 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:08] [INFO ] Deduced a trap composed of 123 places in 1114 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:09] [INFO ] Deduced a trap composed of 90 places in 1014 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:10] [INFO ] Deduced a trap composed of 80 places in 1058 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:11] [INFO ] Deduced a trap composed of 73 places in 1041 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:12] [INFO ] Deduced a trap composed of 171 places in 1163 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:13] [INFO ] Deduced a trap composed of 171 places in 1165 ms of which 204 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/938 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:14] [INFO ] Deduced a trap composed of 5 places in 962 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:15] [INFO ] Deduced a trap composed of 27 places in 1037 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:16] [INFO ] Deduced a trap composed of 46 places in 1039 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:18] [INFO ] Deduced a trap composed of 120 places in 1002 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:19] [INFO ] Deduced a trap composed of 138 places in 1086 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:20] [INFO ] Deduced a trap composed of 139 places in 1191 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:21] [INFO ] Deduced a trap composed of 138 places in 1149 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:22] [INFO ] Deduced a trap composed of 46 places in 1097 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:23] [INFO ] Deduced a trap composed of 120 places in 1258 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:24] [INFO ] Deduced a trap composed of 27 places in 903 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:25] [INFO ] Deduced a trap composed of 57 places in 1106 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:27] [INFO ] Deduced a trap composed of 120 places in 1083 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:28] [INFO ] Deduced a trap composed of 121 places in 1063 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:29] [INFO ] Deduced a trap composed of 121 places in 1026 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:30] [INFO ] Deduced a trap composed of 121 places in 1069 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:31] [INFO ] Deduced a trap composed of 121 places in 1151 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:32] [INFO ] Deduced a trap composed of 121 places in 1120 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:33] [INFO ] Deduced a trap composed of 121 places in 1177 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:34] [INFO ] Deduced a trap composed of 121 places in 1033 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:35] [INFO ] Deduced a trap composed of 121 places in 1064 ms of which 135 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:37] [INFO ] Deduced a trap composed of 121 places in 1014 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:38] [INFO ] Deduced a trap composed of 125 places in 1120 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:39] [INFO ] Deduced a trap composed of 124 places in 1214 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:40] [INFO ] Deduced a trap composed of 124 places in 1003 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:41] [INFO ] Deduced a trap composed of 120 places in 1014 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:42] [INFO ] Deduced a trap composed of 120 places in 997 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:43] [INFO ] Deduced a trap composed of 88 places in 988 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:44] [INFO ] Deduced a trap composed of 71 places in 1002 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:45] [INFO ] Deduced a trap composed of 125 places in 1238 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:46] [INFO ] Deduced a trap composed of 124 places in 1006 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:48] [INFO ] Deduced a trap composed of 121 places in 1107 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:49] [INFO ] Deduced a trap composed of 121 places in 1211 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:33:50] [INFO ] Deduced a trap composed of 121 places in 1231 ms of which 157 ms to minimize.
SMT process timed out in 49265ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 105 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 973/973 places, 3062/3062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 102 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
[2025-06-03 10:33:50] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2025-06-03 10:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:33:53] [INFO ] Implicit Places using invariants in 2310 ms returned []
[2025-06-03 10:33:53] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2025-06-03 10:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:33:54] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2025-06-03 10:34:25] [INFO ] Performed 562/973 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:34:48] [INFO ] Implicit Places using invariants and state equation in 55863 ms returned []
Implicit Place search using SMT with State Equation took 58178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:34:49] [INFO ] Redundant transitions in 157 ms returned []
Running 3000 sub problems to find dead transitions.
[2025-06-03 10:34:49] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2025-06-03 10:34:49] [INFO ] Invariant cache hit.
[2025-06-03 10:34:49] [INFO ] State equation strengthened by 1508 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/971 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
SMT process timed out in 33994ms, After SMT, problems are : Problem set: 0 solved, 3000 unsolved
Search for dead transitions found 0 dead transitions in 34002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92459 ms. Remains : 973/973 places, 3062/3062 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 402 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 108 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2025-06-03 10:35:24] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2025-06-03 10:35:24] [INFO ] Computed 45 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:35:26] [INFO ] Implicit Places using invariants in 2216 ms returned []
[2025-06-03 10:35:26] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:35:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:35:27] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 10:35:57] [INFO ] Performed 971/1147 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:36:18] [INFO ] Implicit Places using invariants and state equation in 52608 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 54829 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1146/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 66 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55004 ms. Remains : 1146/1147 places, 2561/2561 transitions.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (641 resets) in 583 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 49148 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 49148 steps, saw 21193 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 10:36:22] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2025-06-03 10:36:22] [INFO ] Computed 44 invariants in 39 ms
[2025-06-03 10:36:22] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:24] [INFO ] Deduced a trap composed of 114 places in 1415 ms of which 257 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:26] [INFO ] Deduced a trap composed of 138 places in 1258 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:27] [INFO ] Deduced a trap composed of 174 places in 1298 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:28] [INFO ] Deduced a trap composed of 114 places in 1285 ms of which 163 ms to minimize.
SMT process timed out in 5835ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 106 place count 1093 transition count 2508
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 228 place count 1093 transition count 3061
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 350 place count 971 transition count 3061
Applied a total of 350 rules in 343 ms. Remains 971 /1146 variables (removed 175) and now considering 3061/2561 (removed -500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 971/1146 places, 3061/2561 transitions.
RANDOM walk for 40000 steps (1040 resets) in 1220 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (140 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (139 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 47737 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 4
Probabilistic random walk after 47737 steps, saw 20120 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 10:36:32] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
// Phase 1: matrix 2671 rows 971 cols
[2025-06-03 10:36:32] [INFO ] Computed 44 invariants in 46 ms
[2025-06-03 10:36:32] [INFO ] State equation strengthened by 1508 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:34] [INFO ] Deduced a trap composed of 90 places in 1301 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:35] [INFO ] Deduced a trap composed of 80 places in 1132 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:36] [INFO ] Deduced a trap composed of 73 places in 1161 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:37] [INFO ] Deduced a trap composed of 73 places in 1173 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:39] [INFO ] Deduced a trap composed of 145 places in 1234 ms of which 154 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/937 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:40] [INFO ] Deduced a trap composed of 5 places in 1038 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:41] [INFO ] Deduced a trap composed of 46 places in 1055 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:42] [INFO ] Deduced a trap composed of 107 places in 1099 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:43] [INFO ] Deduced a trap composed of 108 places in 1019 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:44] [INFO ] Deduced a trap composed of 108 places in 1250 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:45] [INFO ] Deduced a trap composed of 109 places in 1097 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:47] [INFO ] Deduced a trap composed of 108 places in 1274 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:48] [INFO ] Deduced a trap composed of 108 places in 1229 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:49] [INFO ] Deduced a trap composed of 108 places in 1071 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:50] [INFO ] Deduced a trap composed of 108 places in 1240 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:51] [INFO ] Deduced a trap composed of 108 places in 1073 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:53] [INFO ] Deduced a trap composed of 108 places in 1080 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:54] [INFO ] Deduced a trap composed of 108 places in 1053 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:55] [INFO ] Deduced a trap composed of 108 places in 1208 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:56] [INFO ] Deduced a trap composed of 95 places in 1081 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:36:57] [INFO ] Deduced a trap composed of 89 places in 1003 ms of which 133 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/965 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/971 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2671/3642 variables, 971/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3642 variables, 1508/2544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3642 variables, 0/2544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3642 variables, 0/2544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3642/3642 variables, and 2544 constraints, problems are : Problem set: 0 solved, 4 unsolved in 28059 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 971/971 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/937 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:02] [INFO ] Deduced a trap composed of 46 places in 1158 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:03] [INFO ] Deduced a trap composed of 120 places in 1101 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:04] [INFO ] Deduced a trap composed of 71 places in 1343 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:06] [INFO ] Deduced a trap composed of 120 places in 1184 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:07] [INFO ] Deduced a trap composed of 57 places in 1066 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:08] [INFO ] Deduced a trap composed of 88 places in 1153 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:09] [INFO ] Deduced a trap composed of 121 places in 979 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:10] [INFO ] Deduced a trap composed of 121 places in 947 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:11] [INFO ] Deduced a trap composed of 125 places in 1173 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:12] [INFO ] Deduced a trap composed of 124 places in 1163 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:13] [INFO ] Deduced a trap composed of 124 places in 1086 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:15] [INFO ] Deduced a trap composed of 121 places in 1150 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:15] [INFO ] Deduced a trap composed of 121 places in 921 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:17] [INFO ] Deduced a trap composed of 120 places in 1061 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:18] [INFO ] Deduced a trap composed of 120 places in 925 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:19] [INFO ] Deduced a trap composed of 120 places in 1224 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:20] [INFO ] Deduced a trap composed of 120 places in 1264 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:21] [INFO ] Deduced a trap composed of 120 places in 1322 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:23] [INFO ] Deduced a trap composed of 120 places in 1168 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:24] [INFO ] Deduced a trap composed of 119 places in 1101 ms of which 132 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:25] [INFO ] Deduced a trap composed of 120 places in 916 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:26] [INFO ] Deduced a trap composed of 71 places in 1007 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:27] [INFO ] Deduced a trap composed of 120 places in 1281 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:28] [INFO ] Deduced a trap composed of 121 places in 1088 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:29] [INFO ] Deduced a trap composed of 121 places in 937 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:31] [INFO ] Deduced a trap composed of 125 places in 1092 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:31] [INFO ] Deduced a trap composed of 125 places in 920 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:33] [INFO ] Deduced a trap composed of 126 places in 1149 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:34] [INFO ] Deduced a trap composed of 122 places in 1161 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:35] [INFO ] Deduced a trap composed of 122 places in 1257 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:36] [INFO ] Deduced a trap composed of 122 places in 1080 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:37] [INFO ] Deduced a trap composed of 121 places in 1090 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:39] [INFO ] Deduced a trap composed of 121 places in 1056 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:40] [INFO ] Deduced a trap composed of 122 places in 1079 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:41] [INFO ] Deduced a trap composed of 122 places in 1087 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:42] [INFO ] Deduced a trap composed of 122 places in 1250 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:43] [INFO ] Deduced a trap composed of 122 places in 1112 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:44] [INFO ] Deduced a trap composed of 125 places in 898 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:45] [INFO ] Deduced a trap composed of 126 places in 922 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:37:46] [INFO ] Deduced a trap composed of 125 places in 1063 ms of which 136 ms to minimize.
SMT process timed out in 74189ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3061/3061 transitions.
Applied a total of 0 rules in 103 ms. Remains 971 /971 variables (removed 0) and now considering 3061/3061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 971/971 places, 3061/3061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3061/3061 transitions.
Applied a total of 0 rules in 162 ms. Remains 971 /971 variables (removed 0) and now considering 3061/3061 (removed 0) transitions.
[2025-06-03 10:37:47] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2025-06-03 10:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:37:49] [INFO ] Implicit Places using invariants in 2526 ms returned []
[2025-06-03 10:37:49] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2025-06-03 10:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:37:51] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2025-06-03 10:38:21] [INFO ] Performed 461/971 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:38:51] [INFO ] Performed 968/971 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:38:53] [INFO ] Implicit Places using invariants and state equation in 63739 ms returned []
Implicit Place search using SMT with State Equation took 66271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:38:53] [INFO ] Redundant transitions in 161 ms returned []
Running 2999 sub problems to find dead transitions.
[2025-06-03 10:38:53] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2025-06-03 10:38:53] [INFO ] Invariant cache hit.
[2025-06-03 10:38:53] [INFO ] State equation strengthened by 1508 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/969 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2999 unsolved
SMT process timed out in 33276ms, After SMT, problems are : Problem set: 0 solved, 2999 unsolved
Search for dead transitions found 0 dead transitions in 33284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99892 ms. Remains : 971/971 places, 3061/3061 transitions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1606 reset in 631 ms.
Product exploration explored 100000 steps with 1604 reset in 632 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2561
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 25 place count 1146 transition count 2561
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 1146 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1133 transition count 2548
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1133 transition count 2548
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 1133 transition count 2548
Deduced a syphon composed of 40 places in 1 ms
Applied a total of 79 rules in 313 ms. Remains 1133 /1146 variables (removed 13) and now considering 2548/2561 (removed 13) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:39:29] [INFO ] Redundant transitions in 153 ms returned []
Running 2531 sub problems to find dead transitions.
[2025-06-03 10:39:29] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2025-06-03 10:39:29] [INFO ] Computed 44 invariants in 29 ms
[2025-06-03 10:39:29] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
SMT process timed out in 32086ms, After SMT, problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 32093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1146 places, 2548/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32574 ms. Remains : 1133/1146 places, 2548/2561 transitions.
Built C files in :
/tmp/ltsmin3774518277507497860
[2025-06-03 10:40:01] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3774518277507497860
Running compilation step : cd /tmp/ltsmin3774518277507497860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3774518277507497860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3774518277507497860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 66 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2025-06-03 10:40:04] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2025-06-03 10:40:04] [INFO ] Computed 44 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:40:07] [INFO ] Implicit Places using invariants in 2304 ms returned []
[2025-06-03 10:40:07] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:40:08] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 10:40:36] [INFO ] Implicit Places using invariants and state equation in 29252 ms returned []
Implicit Place search using SMT with State Equation took 31560 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2025-06-03 10:40:36] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:40:36] [INFO ] Invariant cache hit.
[2025-06-03 10:40:36] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 31529ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 31534ms
Finished structural reductions in LTL mode , in 1 iterations and 63166 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Built C files in :
/tmp/ltsmin2792714178969646771
[2025-06-03 10:41:08] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2792714178969646771
Running compilation step : cd /tmp/ltsmin2792714178969646771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2792714178969646771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2792714178969646771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 10:41:11] [INFO ] Flatten gal took : 60 ms
[2025-06-03 10:41:11] [INFO ] Flatten gal took : 63 ms
[2025-06-03 10:41:11] [INFO ] Time to serialize gal into /tmp/LTL12527900078995168170.gal : 11 ms
[2025-06-03 10:41:11] [INFO ] Time to serialize properties into /tmp/LTL13958494757585282376.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12527900078995168170.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1663977147514780068.hoa' '-atoms' '/tmp/LTL13958494757585282376.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13958494757585282376.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1663977147514780068.hoa
Detected timeout of ITS tools.
[2025-06-03 10:41:26] [INFO ] Flatten gal took : 60 ms
[2025-06-03 10:41:26] [INFO ] Flatten gal took : 64 ms
[2025-06-03 10:41:26] [INFO ] Time to serialize gal into /tmp/LTL15638926364661671690.gal : 11 ms
[2025-06-03 10:41:26] [INFO ] Time to serialize properties into /tmp/LTL13408339232586942929.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15638926364661671690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13408339232586942929.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(("((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtThe...262
Formula 0 simplified : X(!"((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtTheLef...252
Detected timeout of ITS tools.
[2025-06-03 10:41:41] [INFO ] Flatten gal took : 66 ms
[2025-06-03 10:41:41] [INFO ] Applying decomposition
[2025-06-03 10:41:41] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3381958287383597793.txt' '-o' '/tmp/graph3381958287383597793.bin' '-w' '/tmp/graph3381958287383597793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3381958287383597793.bin' '-l' '-1' '-v' '-w' '/tmp/graph3381958287383597793.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:41:41] [INFO ] Decomposing Gal with order
[2025-06-03 10:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:41:41] [INFO ] Removed a total of 1872 redundant transitions.
[2025-06-03 10:41:42] [INFO ] Flatten gal took : 210 ms
[2025-06-03 10:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1346 labels/synchronizations in 109 ms.
[2025-06-03 10:41:42] [INFO ] Time to serialize gal into /tmp/LTL3782416946425266911.gal : 28 ms
[2025-06-03 10:41:42] [INFO ] Time to serialize properties into /tmp/LTL13616356754971166094.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3782416946425266911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13616356754971166094.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(("((i4.i1.i1.u98.Node7ManageTheCrashOfNode2<1)||(i4.i1.i1.u39.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((i4.i1.i1.u98.Node...320
Formula 0 simplified : X(!"((i4.i1.i1.u98.Node7ManageTheCrashOfNode2<1)||(i4.i1.i1.u39.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((i4.i1.i1.u98.Node7Ma...310
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12 finished in 556172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1245 transition count 2791
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1245 transition count 2791
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1229 transition count 2735
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1229 transition count 2735
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1221 transition count 2687
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1221 transition count 2687
Applied a total of 96 rules in 456 ms. Remains 1221 /1269 variables (removed 48) and now considering 2687/2855 (removed 168) transitions.
[2025-06-03 10:41:57] [INFO ] Flow matrix only has 2415 transitions (discarded 272 similar events)
// Phase 1: matrix 2415 rows 1221 cols
[2025-06-03 10:41:57] [INFO ] Computed 63 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:42:00] [INFO ] Implicit Places using invariants in 3058 ms returned [13, 280, 294, 420, 514, 534, 609, 619, 651, 663, 672, 691, 716, 741, 771, 890, 978, 1025]
[2025-06-03 10:42:00] [INFO ] Actually due to overlaps returned [663, 1025, 13, 294, 420, 514, 534, 609, 619, 651, 672, 691, 716, 741, 771, 978]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 3060 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1205/1269 places, 2687/2855 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1191 transition count 2673
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1191 transition count 2673
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1177 transition count 2659
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1177 transition count 2659
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1163 transition count 2645
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1163 transition count 2645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 98 place count 1149 transition count 2561
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 1149 transition count 2561
Applied a total of 112 rules in 526 ms. Remains 1149 /1205 variables (removed 56) and now considering 2561/2687 (removed 126) transitions.
[2025-06-03 10:42:01] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1149 cols
[2025-06-03 10:42:01] [INFO ] Computed 47 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:42:04] [INFO ] Implicit Places using invariants in 2663 ms returned [278, 837]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2665 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1269 places, 2561/2855 transitions.
Applied a total of 0 rules in 64 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6772 ms. Remains : 1147/1269 places, 2561/2855 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Product exploration explored 100000 steps with 1609 reset in 680 ms.
Product exploration explored 100000 steps with 1617 reset in 560 ms.
Computed a total of 315 stabilizing places and 928 stable transitions
Computed a total of 315 stabilizing places and 928 stable transitions
Detected a total of 315/1147 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (640 resets) in 312 ms. (127 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (172 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
[2025-06-03 10:42:05] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2025-06-03 10:42:05] [INFO ] Computed 45 invariants in 21 ms
[2025-06-03 10:42:05] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:07] [INFO ] Deduced a trap composed of 122 places in 1206 ms of which 119 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/1110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:08] [INFO ] Deduced a trap composed of 50 places in 1084 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:10] [INFO ] Deduced a trap composed of 65 places in 1494 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:11] [INFO ] Deduced a trap composed of 67 places in 1387 ms of which 121 ms to minimize.
SMT process timed out in 5777ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 1094 transition count 2508
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 237 place count 1094 transition count 3722
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 368 place count 963 transition count 3722
Applied a total of 368 rules in 571 ms. Remains 963 /1147 variables (removed 184) and now considering 3722/2561 (removed -1161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 963/1147 places, 3722/2561 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1146 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (145 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (146 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 47778 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 47778 steps, saw 20083 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 10:42:15] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2025-06-03 10:42:15] [INFO ] Computed 45 invariants in 29 ms
[2025-06-03 10:42:15] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:17] [INFO ] Deduced a trap composed of 71 places in 1059 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/952 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/963 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3324/4287 variables, 963/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4287 variables, 2178/3187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4287 variables, 0/3187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4287 variables, 0/3187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4287/4287 variables, and 3187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4344 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:21] [INFO ] Deduced a trap composed of 83 places in 1040 ms of which 74 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/897 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/926 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:22] [INFO ] Deduced a trap composed of 5 places in 1130 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:23] [INFO ] Deduced a trap composed of 27 places in 1147 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:25] [INFO ] Deduced a trap composed of 46 places in 1189 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:26] [INFO ] Deduced a trap composed of 46 places in 1170 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:27] [INFO ] Deduced a trap composed of 55 places in 1184 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:28] [INFO ] Deduced a trap composed of 55 places in 1142 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:29] [INFO ] Deduced a trap composed of 56 places in 1159 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:31] [INFO ] Deduced a trap composed of 54 places in 1298 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:32] [INFO ] Deduced a trap composed of 53 places in 1371 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:33] [INFO ] Deduced a trap composed of 55 places in 1161 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:35] [INFO ] Deduced a trap composed of 53 places in 1348 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:36] [INFO ] Deduced a trap composed of 56 places in 1174 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:37] [INFO ] Deduced a trap composed of 52 places in 1166 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:38] [INFO ] Deduced a trap composed of 53 places in 1345 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:39] [INFO ] Deduced a trap composed of 71 places in 1018 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:41] [INFO ] Deduced a trap composed of 27 places in 1302 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:42] [INFO ] Deduced a trap composed of 56 places in 1352 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:43] [INFO ] Deduced a trap composed of 57 places in 1197 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:45] [INFO ] Deduced a trap composed of 57 places in 1350 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:46] [INFO ] Deduced a trap composed of 46 places in 1213 ms of which 81 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:47] [INFO ] Deduced a trap composed of 46 places in 1171 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:48] [INFO ] Deduced a trap composed of 53 places in 1407 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:50] [INFO ] Deduced a trap composed of 53 places in 1318 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:51] [INFO ] Deduced a trap composed of 54 places in 1299 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:52] [INFO ] Deduced a trap composed of 53 places in 1325 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:53] [INFO ] Deduced a trap composed of 62 places in 1020 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:55] [INFO ] Deduced a trap composed of 54 places in 1164 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:56] [INFO ] Deduced a trap composed of 54 places in 1306 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:57] [INFO ] Deduced a trap composed of 53 places in 1198 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:42:58] [INFO ] Deduced a trap composed of 54 places in 1254 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:43:00] [INFO ] Deduced a trap composed of 53 places in 1210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:43:01] [INFO ] Deduced a trap composed of 53 places in 1256 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:43:02] [INFO ] Deduced a trap composed of 54 places in 1270 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:43:04] [INFO ] Deduced a trap composed of 54 places in 1258 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:43:05] [INFO ] Deduced a trap composed of 54 places in 1378 ms of which 94 ms to minimize.
SMT process timed out in 49768ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 134 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 117 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2025-06-03 10:43:05] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:43:07] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2025-06-03 10:43:07] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:43:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:43:09] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:43:39] [INFO ] Performed 369/963 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:44:09] [INFO ] Performed 595/963 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:44:38] [INFO ] Implicit Places using invariants and state equation in 90864 ms returned []
Implicit Place search using SMT with State Equation took 92889 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:44:38] [INFO ] Redundant transitions in 231 ms returned []
Running 3660 sub problems to find dead transitions.
[2025-06-03 10:44:38] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:44:38] [INFO ] Invariant cache hit.
[2025-06-03 10:44:38] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 35243ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 35252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128507 ms. Remains : 963/963 places, 3722/3722 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 109 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2025-06-03 10:45:14] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2025-06-03 10:45:14] [INFO ] Computed 45 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:45:17] [INFO ] Implicit Places using invariants in 2651 ms returned []
[2025-06-03 10:45:17] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:45:18] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 10:45:48] [INFO ] Performed 1128/1147 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:45:49] [INFO ] Implicit Places using invariants and state equation in 31664 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 34317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1146/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 65 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34496 ms. Remains : 1146/1147 places, 2561/2561 transitions.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (639 resets) in 327 ms. (121 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (172 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
[2025-06-03 10:45:49] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2025-06-03 10:45:49] [INFO ] Computed 44 invariants in 22 ms
[2025-06-03 10:45:49] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:45:50] [INFO ] Deduced a trap composed of 113 places in 977 ms of which 114 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/1110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1136 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/1146 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1146 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2289/3435 variables, 1146/1191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3435 variables, 833/2024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3435 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3435 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3435/3435 variables, and 2024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2806 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1146/1146 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:45:53] [INFO ] Deduced a trap composed of 109 places in 1134 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:45:55] [INFO ] Deduced a trap composed of 121 places in 1101 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:45:56] [INFO ] Deduced a trap composed of 145 places in 1142 ms of which 140 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/1110 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:45:57] [INFO ] Deduced a trap composed of 50 places in 1201 ms of which 105 ms to minimize.
SMT process timed out in 8244ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 108 place count 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 239 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 370 place count 961 transition count 3721
Applied a total of 370 rules in 553 ms. Remains 961 /1146 variables (removed 185) and now considering 3721/2561 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 961/1146 places, 3721/2561 transitions.
RANDOM walk for 40000 steps (1129 resets) in 960 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 45923 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 45923 steps, saw 19321 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 10:46:01] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2025-06-03 10:46:01] [INFO ] Computed 44 invariants in 23 ms
[2025-06-03 10:46:01] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:03] [INFO ] Deduced a trap composed of 77 places in 1194 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/925 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/951 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/961 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3323/4284 variables, 961/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4284 variables, 2178/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4284 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4284 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4284/4284 variables, and 3184 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4263 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 961/961 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:07] [INFO ] Deduced a trap composed of 94 places in 1339 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:08] [INFO ] Deduced a trap composed of 87 places in 1259 ms of which 76 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/896 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/925 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:10] [INFO ] Deduced a trap composed of 5 places in 1289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:11] [INFO ] Deduced a trap composed of 27 places in 1279 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:13] [INFO ] Deduced a trap composed of 46 places in 1428 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:14] [INFO ] Deduced a trap composed of 46 places in 1392 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:16] [INFO ] Deduced a trap composed of 56 places in 1471 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:17] [INFO ] Deduced a trap composed of 55 places in 1447 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:18] [INFO ] Deduced a trap composed of 55 places in 1319 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:20] [INFO ] Deduced a trap composed of 52 places in 1152 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:21] [INFO ] Deduced a trap composed of 52 places in 1308 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:22] [INFO ] Deduced a trap composed of 56 places in 1336 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:24] [INFO ] Deduced a trap composed of 53 places in 1415 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:25] [INFO ] Deduced a trap composed of 55 places in 1482 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:27] [INFO ] Deduced a trap composed of 56 places in 1535 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:28] [INFO ] Deduced a trap composed of 71 places in 1185 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:29] [INFO ] Deduced a trap composed of 54 places in 1189 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:31] [INFO ] Deduced a trap composed of 53 places in 1380 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:32] [INFO ] Deduced a trap composed of 62 places in 1075 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:33] [INFO ] Deduced a trap composed of 54 places in 1444 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:35] [INFO ] Deduced a trap composed of 48 places in 1374 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:36] [INFO ] Deduced a trap composed of 53 places in 1350 ms of which 99 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:37] [INFO ] Deduced a trap composed of 54 places in 1328 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:39] [INFO ] Deduced a trap composed of 53 places in 1311 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:40] [INFO ] Deduced a trap composed of 62 places in 1143 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:41] [INFO ] Deduced a trap composed of 48 places in 1219 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:42] [INFO ] Deduced a trap composed of 48 places in 1228 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:44] [INFO ] Deduced a trap composed of 59 places in 1433 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:45] [INFO ] Deduced a trap composed of 54 places in 1293 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:46] [INFO ] Deduced a trap composed of 97 places in 1216 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:48] [INFO ] Deduced a trap composed of 48 places in 1283 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:49] [INFO ] Deduced a trap composed of 55 places in 1268 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:50] [INFO ] Deduced a trap composed of 55 places in 1222 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:46:51] [INFO ] Deduced a trap composed of 55 places in 1266 ms of which 103 ms to minimize.
SMT process timed out in 50036ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 198 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 197 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2025-06-03 10:46:52] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:46:54] [INFO ] Implicit Places using invariants in 2243 ms returned []
[2025-06-03 10:46:54] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:46:56] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:47:26] [INFO ] Performed 316/961 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:47:56] [INFO ] Performed 557/961 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:48:26] [INFO ] Performed 919/961 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 10:48:34] [INFO ] Implicit Places using invariants and state equation in 99763 ms returned []
Implicit Place search using SMT with State Equation took 102008 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:48:34] [INFO ] Redundant transitions in 236 ms returned []
Running 3659 sub problems to find dead transitions.
[2025-06-03 10:48:34] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:48:34] [INFO ] Invariant cache hit.
[2025-06-03 10:48:34] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 35079ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 35089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137547 ms. Remains : 961/961 places, 3721/3721 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1617 reset in 741 ms.
Product exploration explored 100000 steps with 1612 reset in 594 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2561
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 25 place count 1146 transition count 2561
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 1146 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1133 transition count 2548
Deduced a syphon composed of 24 places in 2 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1133 transition count 2548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 2 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1133 transition count 2548
Deduced a syphon composed of 41 places in 2 ms
Applied a total of 80 rules in 465 ms. Remains 1133 /1146 variables (removed 13) and now considering 2548/2561 (removed 13) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:49:12] [INFO ] Redundant transitions in 130 ms returned []
Running 2531 sub problems to find dead transitions.
[2025-06-03 10:49:12] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2025-06-03 10:49:12] [INFO ] Computed 44 invariants in 42 ms
[2025-06-03 10:49:12] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 1.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 0.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 0.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 0.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 1.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 1.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 1.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 1.0)
(s951 0.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 1.0)
(s959 1.0)
(s960 0.0)
(s961 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
SMT process timed out in 31624ms, After SMT, problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 31630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1146 places, 2548/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32239 ms. Remains : 1133/1146 places, 2548/2561 transitions.
Built C files in :
/tmp/ltsmin13503310457628005630
[2025-06-03 10:49:44] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13503310457628005630
Running compilation step : cd /tmp/ltsmin13503310457628005630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13503310457628005630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13503310457628005630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 67 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2025-06-03 10:49:47] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2025-06-03 10:49:47] [INFO ] Computed 44 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:49:49] [INFO ] Implicit Places using invariants in 2171 ms returned []
[2025-06-03 10:49:49] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:49:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:49:50] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 10:50:20] [INFO ] Performed 1051/1146 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:50:23] [INFO ] Implicit Places using invariants and state equation in 33731 ms returned []
Implicit Place search using SMT with State Equation took 35907 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2025-06-03 10:50:23] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2025-06-03 10:50:23] [INFO ] Invariant cache hit.
[2025-06-03 10:50:23] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 31839ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 31844ms
Finished structural reductions in LTL mode , in 1 iterations and 67824 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Built C files in :
/tmp/ltsmin8774168212879908577
[2025-06-03 10:50:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8774168212879908577
Running compilation step : cd /tmp/ltsmin8774168212879908577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8774168212879908577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8774168212879908577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 10:50:58] [INFO ] Flatten gal took : 69 ms
[2025-06-03 10:50:58] [INFO ] Flatten gal took : 69 ms
[2025-06-03 10:50:58] [INFO ] Time to serialize gal into /tmp/LTL3952111261749769986.gal : 12 ms
[2025-06-03 10:50:58] [INFO ] Time to serialize properties into /tmp/LTL15201463029415547303.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3952111261749769986.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8678542847613562473.hoa' '-atoms' '/tmp/LTL15201463029415547303.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15201463029415547303.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8678542847613562473.hoa
Detected timeout of ITS tools.
[2025-06-03 10:51:13] [INFO ] Flatten gal took : 61 ms
[2025-06-03 10:51:13] [INFO ] Flatten gal took : 65 ms
[2025-06-03 10:51:13] [INFO ] Time to serialize gal into /tmp/LTL7671490587224078472.gal : 13 ms
[2025-06-03 10:51:13] [INFO ] Time to serialize properties into /tmp/LTL3625083265211830964.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7671490587224078472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3625083265211830964.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2025-06-03 10:51:28] [INFO ] Flatten gal took : 62 ms
[2025-06-03 10:51:28] [INFO ] Applying decomposition
[2025-06-03 10:51:28] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6278250113362712055.txt' '-o' '/tmp/graph6278250113362712055.bin' '-w' '/tmp/graph6278250113362712055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6278250113362712055.bin' '-l' '-1' '-v' '-w' '/tmp/graph6278250113362712055.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:51:28] [INFO ] Decomposing Gal with order
[2025-06-03 10:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:51:29] [INFO ] Removed a total of 2900 redundant transitions.
[2025-06-03 10:51:29] [INFO ] Flatten gal took : 297 ms
[2025-06-03 10:51:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1240 labels/synchronizations in 130 ms.
[2025-06-03 10:51:29] [INFO ] Time to serialize gal into /tmp/LTL15791360524672337734.gal : 28 ms
[2025-06-03 10:51:29] [INFO ] Time to serialize properties into /tmp/LTL14148795852777879889.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15791360524672337734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14148795852777879889.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((u62.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i10.u108.Node11NotifyThatHeIsActive<1))"))||("((i19.u109.Nod...242
Formula 0 simplified : XXG(!"((i19.u109.Node11ManageTheCrashOfNode4>=1)&&(i19.u176.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((u62.Node2ThinksNode11Sh...232
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 finished in 587358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||X(p2)||(G(p4)&&p3))))'
Support contains 7 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1246 transition count 2792
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1246 transition count 2792
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 1231 transition count 2737
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 1231 transition count 2737
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 1224 transition count 2695
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 1224 transition count 2695
Applied a total of 90 rules in 297 ms. Remains 1224 /1269 variables (removed 45) and now considering 2695/2855 (removed 160) transitions.
[2025-06-03 10:51:44] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1224 cols
[2025-06-03 10:51:45] [INFO ] Computed 63 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:51:48] [INFO ] Implicit Places using invariants in 3246 ms returned [13, 281, 295, 421, 515, 535, 610, 620, 676, 694, 719, 744, 774, 981, 1028]
[2025-06-03 10:51:48] [INFO ] Actually due to overlaps returned [1028, 13, 295, 421, 515, 535, 610, 620, 676, 694, 719, 744, 774, 981]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 3249 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1210/1269 places, 2695/2855 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1197 transition count 2682
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1184 transition count 2669
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1184 transition count 2669
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1171 transition count 2656
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1171 transition count 2656
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 91 place count 1158 transition count 2578
Iterating global reduction 0 with 13 rules applied. Total rules applied 104 place count 1158 transition count 2578
Applied a total of 104 rules in 443 ms. Remains 1158 /1210 variables (removed 52) and now considering 2578/2695 (removed 117) transitions.
[2025-06-03 10:51:48] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1158 cols
[2025-06-03 10:51:48] [INFO ] Computed 49 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:51:51] [INFO ] Implicit Places using invariants in 2782 ms returned [279]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2789 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1157/1269 places, 2578/2855 transitions.
Applied a total of 0 rules in 64 ms. Remains 1157 /1157 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6847 ms. Remains : 1157/1269 places, 2578/2855 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 1056 ms.
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Computed a total of 325 stabilizing places and 945 stable transitions
Computed a total of 325 stabilizing places and 945 stable transitions
Detected a total of 325/1157 stabilizing places and 945/2578 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1) p2), (X p2), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2))))), (X (NOT p3)), (X (NOT p4)), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2))))), (X (NOT (AND p3 p4 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p2)))), (X (NOT (AND (NOT p0) p4 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p4 (NOT p2)))), (X (NOT (AND p0 p3 p4 (NOT p2)))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2))))), (X (NOT p0)), (X (NOT (AND p0 (NOT p4) (NOT p2)))), (X (NOT (AND p0 p4 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p4 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2)))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2)))))), (X (X (NOT (AND p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p0) p4 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p4 (NOT p2))))), (X (X (NOT (AND p0 p3 p4 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (AND p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p1) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 47 factoid took 25 ms. Reduced automaton from 5 states, 20 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 finished in 9106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||G(!p2))))) U (G((!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||(!p1&&G(!p2)))))))||(p3&&(!p0 U (G((!p0||(!p1&&G(!p2))))||(!p1&&(!p0||(!p1&&G(!p2))))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||F(p1)))) U (G(!p1)||(!p1&&F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1269/1269 places, 2855/2855 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1269 transition count 2834
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1248 transition count 2834
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 42 place count 1248 transition count 2811
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 88 place count 1225 transition count 2811
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 1208 transition count 2754
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 1208 transition count 2754
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 122 place count 1208 transition count 2749
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1203 transition count 2749
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 1194 transition count 2700
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 1194 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1193 transition count 2694
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1193 transition count 2694
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 202 place count 1168 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 1161 transition count 2662
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 1161 transition count 2662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1154 transition count 2620
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1154 transition count 2620
Applied a total of 230 rules in 913 ms. Remains 1154 /1269 variables (removed 115) and now considering 2620/2855 (removed 235) transitions.
[2025-06-03 10:51:55] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1154 cols
[2025-06-03 10:51:55] [INFO ] Computed 63 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:51:58] [INFO ] Implicit Places using invariants in 2615 ms returned [9, 254, 266, 390, 481, 499, 570, 580, 609, 620, 628, 647, 669, 694, 721, 838, 925, 971]
[2025-06-03 10:51:58] [INFO ] Actually due to overlaps returned [620, 971, 9, 266, 390, 481, 499, 570, 580, 609, 628, 647, 669, 694, 721, 925]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2618 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1138/1269 places, 2620/2855 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1128 transition count 2610
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1128 transition count 2610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1118 transition count 2600
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1118 transition count 2600
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1108 transition count 2540
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1108 transition count 2540
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 1104 transition count 2536
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 1100 transition count 2532
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 1100 transition count 2532
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 1096 transition count 2508
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 1096 transition count 2508
Applied a total of 84 rules in 567 ms. Remains 1096 /1138 variables (removed 42) and now considering 2508/2620 (removed 112) transitions.
[2025-06-03 10:51:58] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1096 cols
[2025-06-03 10:51:59] [INFO ] Computed 47 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:52:01] [INFO ] Implicit Places using invariants in 2458 ms returned [252, 798]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2464 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1094/1269 places, 2508/2855 transitions.
Applied a total of 0 rules in 87 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6655 ms. Remains : 1094/1269 places, 2508/2855 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Product exploration explored 100000 steps with 2293 reset in 659 ms.
Product exploration explored 100000 steps with 2291 reset in 667 ms.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (908 resets) in 414 ms. (96 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (188 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (188 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2025-06-03 10:52:03] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2025-06-03 10:52:03] [INFO ] Computed 45 invariants in 25 ms
[2025-06-03 10:52:03] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:04] [INFO ] Deduced a trap composed of 102 places in 1225 ms of which 105 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/1057 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1083 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/1094 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2236/3330 variables, 1094/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3330 variables, 833/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3330 variables, 0/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3330 variables, 0/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3330/3330 variables, and 1973 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3308 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1094/1094 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:08] [INFO ] Deduced a trap composed of 76 places in 1114 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:09] [INFO ] Deduced a trap composed of 112 places in 1165 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:10] [INFO ] Deduced a trap composed of 131 places in 1120 ms of which 128 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/1028 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1028 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/1057 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:11] [INFO ] Deduced a trap composed of 47 places in 1110 ms of which 145 ms to minimize.
SMT process timed out in 8430ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1094 transition count 3722
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 963 transition count 3722
Applied a total of 262 rules in 298 ms. Remains 963 /1094 variables (removed 131) and now considering 3722/2508 (removed -1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 963/1094 places, 3722/2508 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1013 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 49464 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49464 steps, saw 20779 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 10:52:15] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2025-06-03 10:52:15] [INFO ] Computed 45 invariants in 23 ms
[2025-06-03 10:52:15] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:16] [INFO ] Deduced a trap composed of 71 places in 1204 ms of which 101 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:18] [INFO ] Deduced a trap composed of 5 places in 1356 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:19] [INFO ] Deduced a trap composed of 27 places in 1306 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:21] [INFO ] Deduced a trap composed of 46 places in 1425 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:22] [INFO ] Deduced a trap composed of 53 places in 1469 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:24] [INFO ] Deduced a trap composed of 48 places in 1376 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:25] [INFO ] Deduced a trap composed of 53 places in 1356 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:26] [INFO ] Deduced a trap composed of 54 places in 1396 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:28] [INFO ] Deduced a trap composed of 54 places in 1403 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:29] [INFO ] Deduced a trap composed of 54 places in 1461 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:31] [INFO ] Deduced a trap composed of 52 places in 1494 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:32] [INFO ] Deduced a trap composed of 53 places in 1523 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:34] [INFO ] Deduced a trap composed of 52 places in 1481 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:35] [INFO ] Deduced a trap composed of 53 places in 1381 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:37] [INFO ] Deduced a trap composed of 54 places in 1407 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:38] [INFO ] Deduced a trap composed of 54 places in 1541 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:40] [INFO ] Deduced a trap composed of 62 places in 1210 ms of which 109 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/952 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/963 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3324/4287 variables, 963/1025 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4287 variables, 2178/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4287 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4287 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4287/4287 variables, and 3203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27722 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:45] [INFO ] Deduced a trap composed of 27 places in 1530 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:46] [INFO ] Deduced a trap composed of 46 places in 1358 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:47] [INFO ] Deduced a trap composed of 53 places in 1344 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:49] [INFO ] Deduced a trap composed of 54 places in 1550 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:50] [INFO ] Deduced a trap composed of 62 places in 1440 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:52] [INFO ] Deduced a trap composed of 55 places in 1439 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:53] [INFO ] Deduced a trap composed of 56 places in 1420 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:55] [INFO ] Deduced a trap composed of 55 places in 1575 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:56] [INFO ] Deduced a trap composed of 71 places in 1215 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:57] [INFO ] Deduced a trap composed of 54 places in 1261 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:52:59] [INFO ] Deduced a trap composed of 53 places in 1515 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:00] [INFO ] Deduced a trap composed of 62 places in 1187 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:02] [INFO ] Deduced a trap composed of 57 places in 1356 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:03] [INFO ] Deduced a trap composed of 46 places in 1349 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:04] [INFO ] Deduced a trap composed of 57 places in 1337 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:06] [INFO ] Deduced a trap composed of 88 places in 1223 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:07] [INFO ] Deduced a trap composed of 55 places in 1419 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:08] [INFO ] Deduced a trap composed of 55 places in 1460 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:10] [INFO ] Deduced a trap composed of 58 places in 1230 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:11] [INFO ] Deduced a trap composed of 54 places in 1145 ms of which 43 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:12] [INFO ] Deduced a trap composed of 75 places in 1044 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:13] [INFO ] Deduced a trap composed of 54 places in 1139 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:14] [INFO ] Deduced a trap composed of 90 places in 1035 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:15] [INFO ] Deduced a trap composed of 56 places in 1130 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:17] [INFO ] Deduced a trap composed of 56 places in 1328 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:18] [INFO ] Deduced a trap composed of 55 places in 1386 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:19] [INFO ] Deduced a trap composed of 85 places in 1026 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:20] [INFO ] Deduced a trap composed of 56 places in 1323 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:22] [INFO ] Deduced a trap composed of 56 places in 1372 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:23] [INFO ] Deduced a trap composed of 56 places in 1122 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:24] [INFO ] Deduced a trap composed of 55 places in 1145 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:25] [INFO ] Deduced a trap composed of 85 places in 1079 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:27] [INFO ] Deduced a trap composed of 59 places in 1257 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:53:28] [INFO ] Deduced a trap composed of 59 places in 1242 ms of which 94 ms to minimize.
SMT process timed out in 72819ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 115 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 180 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2025-06-03 10:53:28] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:53:30] [INFO ] Implicit Places using invariants in 2208 ms returned []
[2025-06-03 10:53:30] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:53:32] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:54:02] [INFO ] Performed 359/963 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:54:32] [INFO ] Performed 753/963 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:54:44] [INFO ] Implicit Places using invariants and state equation in 73993 ms returned []
Implicit Place search using SMT with State Equation took 76205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:54:45] [INFO ] Redundant transitions in 306 ms returned []
Running 3660 sub problems to find dead transitions.
[2025-06-03 10:54:45] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2025-06-03 10:54:45] [INFO ] Invariant cache hit.
[2025-06-03 10:54:45] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 35224ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 35234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111938 ms. Remains : 963/963 places, 3722/3722 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 112 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2025-06-03 10:55:21] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2025-06-03 10:55:21] [INFO ] Computed 45 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:55:23] [INFO ] Implicit Places using invariants in 2618 ms returned []
[2025-06-03 10:55:23] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2025-06-03 10:55:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:55:25] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 10:55:51] [INFO ] Implicit Places using invariants and state equation in 27683 ms returned [1088]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30309 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1093/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 70 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30492 ms. Remains : 1093/1094 places, 2508/2508 transitions.
Computed a total of 278 stabilizing places and 892 stable transitions
Computed a total of 278 stabilizing places and 892 stable transitions
Detected a total of 278/1093 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (909 resets) in 338 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (188 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2025-06-03 10:55:51] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2025-06-03 10:55:51] [INFO ] Computed 44 invariants in 24 ms
[2025-06-03 10:55:51] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:55:53] [INFO ] Deduced a trap composed of 80 places in 1012 ms of which 79 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/1057 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1083 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/1093 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1093 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2236/3329 variables, 1093/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3329 variables, 833/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3329 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3329 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3329/3329 variables, and 1971 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1093/1093 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:55:56] [INFO ] Deduced a trap composed of 76 places in 1036 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:55:57] [INFO ] Deduced a trap composed of 94 places in 1131 ms of which 90 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/1028 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1028 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/1057 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:55:58] [INFO ] Deduced a trap composed of 47 places in 1040 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:00] [INFO ] Deduced a trap composed of 61 places in 995 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:01] [INFO ] Deduced a trap composed of 59 places in 1063 ms of which 106 ms to minimize.
SMT process timed out in 9251ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2508/2508 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2507
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 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 133 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 264 place count 961 transition count 3721
Applied a total of 264 rules in 433 ms. Remains 961 /1093 variables (removed 132) and now considering 3721/2508 (removed -1213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 961/1093 places, 3721/2508 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1325 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 47103 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 47103 steps, saw 19806 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 10:56:04] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2025-06-03 10:56:05] [INFO ] Computed 44 invariants in 39 ms
[2025-06-03 10:56:05] [INFO ] State equation strengthened by 2178 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:06] [INFO ] Deduced a trap composed of 77 places in 1142 ms of which 73 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/925 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/951 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/961 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3323/4284 variables, 961/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4284 variables, 2178/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4284 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4284 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4284/4284 variables, and 3184 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3951 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 961/961 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:10] [INFO ] Deduced a trap composed of 94 places in 1198 ms of which 81 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/896 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/925 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:12] [INFO ] Deduced a trap composed of 5 places in 1342 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:13] [INFO ] Deduced a trap composed of 27 places in 1332 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:15] [INFO ] Deduced a trap composed of 46 places in 1460 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:16] [INFO ] Deduced a trap composed of 53 places in 1686 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:18] [INFO ] Deduced a trap composed of 54 places in 1274 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:19] [INFO ] Deduced a trap composed of 54 places in 1306 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:20] [INFO ] Deduced a trap composed of 54 places in 1294 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:22] [INFO ] Deduced a trap composed of 54 places in 1449 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:23] [INFO ] Deduced a trap composed of 54 places in 1336 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:25] [INFO ] Deduced a trap composed of 54 places in 1447 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:26] [INFO ] Deduced a trap composed of 54 places in 1333 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:27] [INFO ] Deduced a trap composed of 54 places in 1328 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:29] [INFO ] Deduced a trap composed of 53 places in 1268 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:30] [INFO ] Deduced a trap composed of 62 places in 1293 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:31] [INFO ] Deduced a trap composed of 46 places in 1363 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:33] [INFO ] Deduced a trap composed of 53 places in 1282 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:34] [INFO ] Deduced a trap composed of 55 places in 1123 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:35] [INFO ] Deduced a trap composed of 58 places in 1290 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:36] [INFO ] Deduced a trap composed of 56 places in 1509 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:38] [INFO ] Deduced a trap composed of 27 places in 1478 ms of which 58 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:39] [INFO ] Deduced a trap composed of 57 places in 1223 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:41] [INFO ] Deduced a trap composed of 46 places in 1343 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:42] [INFO ] Deduced a trap composed of 57 places in 1273 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:43] [INFO ] Deduced a trap composed of 54 places in 1148 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:44] [INFO ] Deduced a trap composed of 58 places in 1277 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:46] [INFO ] Deduced a trap composed of 54 places in 1327 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:47] [INFO ] Deduced a trap composed of 54 places in 1262 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:48] [INFO ] Deduced a trap composed of 54 places in 1405 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:50] [INFO ] Deduced a trap composed of 54 places in 1306 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:51] [INFO ] Deduced a trap composed of 54 places in 1259 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:52] [INFO ] Deduced a trap composed of 54 places in 1356 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:56:54] [INFO ] Deduced a trap composed of 54 places in 1324 ms of which 100 ms to minimize.
SMT process timed out in 49355ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 120 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 129 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2025-06-03 10:56:54] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:56:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:56:56] [INFO ] Implicit Places using invariants in 2243 ms returned []
[2025-06-03 10:56:56] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:56:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:56:58] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2025-06-03 10:57:28] [INFO ] Performed 388/961 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 10:57:58] [INFO ] Performed 596/961 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 10:58:26] [INFO ] Implicit Places using invariants and state equation in 90005 ms returned []
Implicit Place search using SMT with State Equation took 92251 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:58:27] [INFO ] Redundant transitions in 245 ms returned []
Running 3659 sub problems to find dead transitions.
[2025-06-03 10:58:27] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2025-06-03 10:58:27] [INFO ] Invariant cache hit.
[2025-06-03 10:58:27] [INFO ] State equation strengthened by 2178 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 35208ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 35215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127853 ms. Remains : 961/961 places, 3721/3721 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2290 reset in 919 ms.
Product exploration explored 100000 steps with 2289 reset in 650 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2508/2508 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2508
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1093 transition count 2508
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 178 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:59:05] [INFO ] Redundant transitions in 192 ms returned []
Running 2491 sub problems to find dead transitions.
[2025-06-03 10:59:05] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2025-06-03 10:59:05] [INFO ] Computed 44 invariants in 38 ms
[2025-06-03 10:59:05] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1091 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 31861ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 31867ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1093 places, 2508/2508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32249 ms. Remains : 1093/1093 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin3114393623473682349
[2025-06-03 10:59:37] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3114393623473682349
Running compilation step : cd /tmp/ltsmin3114393623473682349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3114393623473682349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3114393623473682349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2508/2508 transitions.
Applied a total of 0 rules in 114 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2025-06-03 10:59:40] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2025-06-03 10:59:40] [INFO ] Computed 44 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:42] [INFO ] Implicit Places using invariants in 2165 ms returned []
[2025-06-03 10:59:42] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2025-06-03 10:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:43] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 11:00:09] [INFO ] Implicit Places using invariants and state equation in 26666 ms returned []
Implicit Place search using SMT with State Equation took 28833 ms to find 0 implicit places.
Running 2491 sub problems to find dead transitions.
[2025-06-03 11:00:09] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2025-06-03 11:00:09] [INFO ] Invariant cache hit.
[2025-06-03 11:00:09] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1091 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 31716ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 31720ms
Finished structural reductions in LTL mode , in 1 iterations and 60670 ms. Remains : 1093/1093 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin9248589455509117330
[2025-06-03 11:00:40] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9248589455509117330
Running compilation step : cd /tmp/ltsmin9248589455509117330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9248589455509117330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9248589455509117330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 11:00:44] [INFO ] Flatten gal took : 55 ms
[2025-06-03 11:00:44] [INFO ] Flatten gal took : 56 ms
[2025-06-03 11:00:44] [INFO ] Time to serialize gal into /tmp/LTL17668429634203124056.gal : 11 ms
[2025-06-03 11:00:44] [INFO ] Time to serialize properties into /tmp/LTL13599229845669091648.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17668429634203124056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7860516567209888600.hoa' '-atoms' '/tmp/LTL13599229845669091648.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13599229845669091648.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7860516567209888600.hoa
Detected timeout of ITS tools.
[2025-06-03 11:00:59] [INFO ] Flatten gal took : 54 ms
[2025-06-03 11:00:59] [INFO ] Flatten gal took : 56 ms
[2025-06-03 11:00:59] [INFO ] Time to serialize gal into /tmp/LTL6833421146900663270.gal : 16 ms
[2025-06-03 11:00:59] [INFO ] Time to serialize properties into /tmp/LTL1486371073995005427.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6833421146900663270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1486371073995005427.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2025-06-03 11:01:14] [INFO ] Flatten gal took : 55 ms
[2025-06-03 11:01:14] [INFO ] Applying decomposition
[2025-06-03 11:01:14] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4565656518684247287.txt' '-o' '/tmp/graph4565656518684247287.bin' '-w' '/tmp/graph4565656518684247287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4565656518684247287.bin' '-l' '-1' '-v' '-w' '/tmp/graph4565656518684247287.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:01:14] [INFO ] Decomposing Gal with order
[2025-06-03 11:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:01:14] [INFO ] Removed a total of 3378 redundant transitions.
[2025-06-03 11:01:14] [INFO ] Flatten gal took : 155 ms
[2025-06-03 11:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1473 labels/synchronizations in 112 ms.
[2025-06-03 11:01:15] [INFO ] Time to serialize gal into /tmp/LTL17375927198251048604.gal : 15 ms
[2025-06-03 11:01:15] [INFO ] Time to serialize properties into /tmp/LTL11637994007381894172.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17375927198251048604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11637994007381894172.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((u44.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i15.u93.Node11NotifyThatHeIsActive<1))"))||("((i0.i3.u94.Nod...244
Formula 0 simplified : XXG(!"((i0.i3.u94.Node11ManageTheCrashOfNode4>=1)&&(i0.i3.u163.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((u44.Node2ThinksNode1...234
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 finished in 575510 ms.
[2025-06-03 11:01:30] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7812231554893758311
[2025-06-03 11:01:30] [INFO ] Too many transitions (2855) to apply POR reductions. Disabling POR matrices.
[2025-06-03 11:01:30] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7812231554893758311
Running compilation step : cd /tmp/ltsmin7812231554893758311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 11:01:30] [INFO ] Applying decomposition
[2025-06-03 11:01:30] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2568624847639609670.txt' '-o' '/tmp/graph2568624847639609670.bin' '-w' '/tmp/graph2568624847639609670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2568624847639609670.bin' '-l' '-1' '-v' '-w' '/tmp/graph2568624847639609670.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:01:30] [INFO ] Decomposing Gal with order
[2025-06-03 11:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:01:30] [INFO ] Removed a total of 2349 redundant transitions.
[2025-06-03 11:01:30] [INFO ] Flatten gal took : 195 ms
[2025-06-03 11:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1749 labels/synchronizations in 79 ms.
[2025-06-03 11:01:30] [INFO ] Time to serialize gal into /tmp/LTLFireability6704950796927756186.gal : 21 ms
[2025-06-03 11:01:30] [INFO ] Time to serialize properties into /tmp/LTLFireability5105953182349940264.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6704950796927756186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5105953182349940264.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 5 LTL properties
Checking formula 0 : !((X(X(((!("(((i6.u0.ThereIsAMasterInTheLeafSet>=1)&&(i6.u0.Node1WantsToManageTheCrashOfNode15>=1))&&((i2.i0.u33.Node1HasDetectedCrash...3339
Formula 0 simplified : XX(("(((i6.u0.ThereIsAMasterInTheLeafSet>=1)&&(i6.u0.Node1WantsToManageTheCrashOfNode15>=1))&&((i2.i0.u33.Node1HasDetectedCrashOfNod...3225
Compilation finished in 12203 ms.
Running link step : cd /tmp/ltsmin7812231554893758311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin7812231554893758311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||[](!(LTLAPp2==true)))))) U ([]((!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))))))||((LTLAPp3==true)&&(!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7812231554893758311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||[](!(LTLAPp2==true)))))) U ([]((!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))))))||((LTLAPp3==true)&&(!(LTLAPp0==true) U ([]((!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))||(!(LTLAPp1==true)&&(!(LTLAPp0==true)||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7812231554893758311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp4==true)||<>((LTLAPp5==true))))) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&<>((LTLAPp6==true)))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524300316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;