About the Execution of ITS-Tools for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1615399.00 | 0.00 | 0.00 | FFFTFTFFFFFFTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533700932.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 ShieldPPPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533700932
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K 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 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 955K May 29 14:33 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 ShieldPPPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749337673737
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 23:07:54] [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-07 23:07:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:07:55] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2025-06-07 23:07:55] [INFO ] Transformed 3903 places.
[2025-06-07 23:07:55] [INFO ] Transformed 3553 transitions.
[2025-06-07 23:07:55] [INFO ] Found NUPN structural information;
[2025-06-07 23:07:55] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 542 places :
Symmetric choice reduction at 0 with 542 rule applications. Total rules 542 place count 3361 transition count 3011
Iterating global reduction 0 with 542 rules applied. Total rules applied 1084 place count 3361 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1085 place count 3360 transition count 3010
Iterating global reduction 0 with 1 rules applied. Total rules applied 1086 place count 3360 transition count 3010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1087 place count 3359 transition count 3009
Iterating global reduction 0 with 1 rules applied. Total rules applied 1088 place count 3359 transition count 3009
Applied a total of 1088 rules in 1543 ms. Remains 3359 /3903 variables (removed 544) and now considering 3009/3553 (removed 544) transitions.
// Phase 1: matrix 3009 rows 3359 cols
[2025-06-07 23:07:57] [INFO ] Computed 551 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:07:58] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2025-06-07 23:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:01] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 4386 ms to find 0 implicit places.
Running 3008 sub problems to find dead transitions.
[2025-06-07 23:08:01] [INFO ] Invariant cache hit.
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3358/6368 variables, and 0 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3359 constraints, PredecessorRefiner: 3008/3008 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3008 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3358/6368 variables, and 0 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3359 constraints, PredecessorRefiner: 0/3008 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61158ms problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 61183ms
Starting structural reductions in LTL mode, iteration 1 : 3359/3903 places, 3009/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67143 ms. Remains : 3359/3903 places, 3009/3553 transitions.
Support contains 35 out of 3359 places after structural reductions.
[2025-06-07 23:09:03] [INFO ] Flatten gal took : 199 ms
[2025-06-07 23:09:03] [INFO ] Flatten gal took : 134 ms
[2025-06-07 23:09:03] [INFO ] Input system was already deterministic with 3009 transitions.
RANDOM walk for 40000 steps (8 resets) in 1959 ms. (20 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
[2025-06-07 23:09:04] [INFO ] Invariant cache hit.
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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 276/294 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3065/3359 variables, 522/551 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3359 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3009/6368 variables, 3359/3910 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6368 variables, 0/3910 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/6368 variables, 0/3910 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6368/6368 variables, and 3910 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3359/3359 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 276/294 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3065/3359 variables, 522/551 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:09] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:09] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:10] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:10] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:10] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:11] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:11] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:11] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:11] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:12] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:12] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:12] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:12] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:13] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:13] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:13] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 18 ms to minimize.
SMT process timed out in 8981ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 3359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 3359 transition count 2318
Reduce places removed 691 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 693 rules applied. Total rules applied 1384 place count 2668 transition count 2316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1386 place count 2666 transition count 2316
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1386 place count 2666 transition count 1923
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2172 place count 2273 transition count 1923
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2174 place count 2271 transition count 1921
Iterating global reduction 3 with 2 rules applied. Total rules applied 2176 place count 2271 transition count 1921
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2176 place count 2271 transition count 1919
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2180 place count 2269 transition count 1919
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 4 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3878 place count 1420 transition count 1070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3879 place count 1420 transition count 1069
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3881 place count 1419 transition count 1068
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4083 place count 1318 transition count 1068
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 4169 place count 1275 transition count 1068
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4170 place count 1275 transition count 1067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4171 place count 1274 transition count 1067
Partial Free-agglomeration rule applied 147 times.
Drop transitions (Partial Free agglomeration) removed 147 transitions
Iterating global reduction 5 with 147 rules applied. Total rules applied 4318 place count 1274 transition count 1067
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4319 place count 1273 transition count 1066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4320 place count 1272 transition count 1066
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4320 place count 1272 transition count 1064
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4324 place count 1270 transition count 1064
Applied a total of 4324 rules in 850 ms. Remains 1270 /3359 variables (removed 2089) and now considering 1064/3009 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 1270/3359 places, 1064/3009 transitions.
RANDOM walk for 40000 steps (8 resets) in 834 ms. (47 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 12/12 properties
// Phase 1: matrix 1064 rows 1270 cols
[2025-06-07 23:09:15] [INFO ] Computed 550 invariants in 5 ms
[2025-06-07 23:09:15] [INFO ] State equation strengthened by 9 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 65/81 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/87 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 169/358 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 28/237 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 11/369 variables, 11/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 11/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 20/389 variables, 10/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 243/632 variables, 126/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/632 variables, 35/430 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/632 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 15/647 variables, 16/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 15/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/647 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 28/675 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/675 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 315/990 variables, 181/656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/990 variables, 53/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/990 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 17/1007 variables, 19/728 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1007 variables, 17/745 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1007 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 30/1037 variables, 15/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1037 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 282/1319 variables, 167/927 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1319 variables, 51/978 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1319 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1319 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 11/1330 variables, 14/993 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1330 variables, 11/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1330 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 16/1346 variables, 8/1012 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1346 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 209/1555 variables, 131/1143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1555 variables, 42/1185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1555 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 8/1563 variables, 13/1198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1563 variables, 8/1206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1563 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 6/1569 variables, 3/1209 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1569 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 114/1683 variables, 64/1273 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1683 variables, 19/1292 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1683 variables, 1/1293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1683 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 7/1690 variables, 9/1302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1690 variables, 7/1309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1690 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 9/1699 variables, 5/1314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1699 variables, 1/1315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1699 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 85/1784 variables, 52/1367 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1784 variables, 19/1386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1784 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (OVERLAPS) 2/1786 variables, 2/1388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1786 variables, 2/1390 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1786 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (OVERLAPS) 4/1790 variables, 2/1392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1790 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 88/1878 variables, 46/1438 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1878 variables, 12/1450 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1878 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 6/1884 variables, 8/1458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1884 variables, 6/1464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1884 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 8/1892 variables, 4/1468 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1892 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 74/1966 variables, 46/1514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1966 variables, 16/1530 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1966 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (OVERLAPS) 2/1968 variables, 2/1532 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1968 variables, 2/1534 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1968 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (OVERLAPS) 4/1972 variables, 2/1536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1972 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (OVERLAPS) 75/2047 variables, 39/1575 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2047 variables, 9/1584 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2047 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (OVERLAPS) 6/2053 variables, 8/1592 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2053 variables, 6/1598 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2053 variables, 0/1598 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 89 (OVERLAPS) 8/2061 variables, 4/1602 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2061 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 91 (OVERLAPS) 51/2112 variables, 36/1638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2112 variables, 13/1651 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2112 variables, 0/1651 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 94 (OVERLAPS) 39/2151 variables, 18/1669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2151 variables, 5/1674 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2151 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 97 (OVERLAPS) 4/2155 variables, 4/1678 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2155 variables, 4/1682 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2155 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 100 (OVERLAPS) 8/2163 variables, 4/1686 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2163 variables, 0/1686 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 102 (OVERLAPS) 41/2204 variables, 28/1714 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2204 variables, 9/1723 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 105 (OVERLAPS) 39/2243 variables, 18/1741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2243 variables, 5/1746 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2243 variables, 0/1746 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 108 (OVERLAPS) 4/2247 variables, 4/1750 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2247 variables, 4/1754 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2247 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 111 (OVERLAPS) 8/2255 variables, 4/1758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2255 variables, 0/1758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 113 (OVERLAPS) 38/2293 variables, 28/1786 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2293 variables, 9/1795 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2293 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 116 (OVERLAPS) 27/2320 variables, 14/1809 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2320 variables, 3/1812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2320 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 119 (OVERLAPS) 4/2324 variables, 4/1816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2324 variables, 2/1818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2324 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 122 (OVERLAPS) 2/2326 variables, 1/1819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2326 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 124 (OVERLAPS) 8/2334 variables, 8/1827 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2334 variables, 2/1829 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2334 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 127 (OVERLAPS) 0/2334 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2334/2334 variables, and 1829 constraints, problems are : Problem set: 0 solved, 12 unsolved in 12492 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1270/1270 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 65/81 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/87 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 169/358 variables, 85/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 28/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:28] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 11/369 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 11/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 20/389 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 243/632 variables, 126/413 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/632 variables, 35/448 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:29] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/632 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 15/647 variables, 16/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/647 variables, 15/480 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/647 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 28/675 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:30] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/675 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/675 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 315/990 variables, 181/676 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/990 variables, 53/729 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:31] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:31] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:31] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:31] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:31] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/990 variables, 5/734 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/990 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 17/1007 variables, 19/753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1007 variables, 17/770 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1007 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 30/1037 variables, 15/785 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1037 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 282/1319 variables, 167/952 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1319 variables, 51/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1319 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1319 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1319 variables, 3/1008 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1319 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 11/1330 variables, 14/1022 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1330 variables, 11/1033 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1330 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 16/1346 variables, 8/1041 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1346 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 209/1555 variables, 131/1172 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1555 variables, 42/1214 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:36] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1555 variables, 10/1224 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1555 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 8/1563 variables, 13/1237 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1563 variables, 8/1245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1563 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 6/1569 variables, 3/1248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1569 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 114/1683 variables, 64/1312 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1683 variables, 19/1331 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1683 variables, 1/1332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:39] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:39] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:39] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1683 variables, 3/1335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1683 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (OVERLAPS) 7/1690 variables, 9/1344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1690 variables, 7/1351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1690 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (OVERLAPS) 9/1699 variables, 5/1356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1699 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1699 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (OVERLAPS) 85/1784 variables, 52/1409 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1784 variables, 19/1428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1784 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 2/1786 variables, 2/1430 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1786 variables, 2/1432 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1786 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (OVERLAPS) 4/1790 variables, 2/1434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1790 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (OVERLAPS) 88/1878 variables, 46/1480 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1878 variables, 12/1492 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1878 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (OVERLAPS) 6/1884 variables, 8/1500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1884 variables, 6/1506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1884 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (OVERLAPS) 8/1892 variables, 4/1510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1892 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (OVERLAPS) 74/1966 variables, 46/1556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1966 variables, 16/1572 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:47] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 90 (INCLUDED_ONLY) 0/1966 variables, 4/1576 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1966 variables, 0/1576 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 92 (OVERLAPS) 2/1968 variables, 2/1578 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1968 variables, 2/1580 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1968 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 95 (OVERLAPS) 4/1972 variables, 2/1582 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1972 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 97 (OVERLAPS) 75/2047 variables, 39/1621 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2047 variables, 9/1630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2047 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 100 (OVERLAPS) 6/2053 variables, 8/1638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2053 variables, 6/1644 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2053 variables, 0/1644 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 103 (OVERLAPS) 8/2061 variables, 4/1648 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2061 variables, 0/1648 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 105 (OVERLAPS) 51/2112 variables, 36/1684 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2112 variables, 13/1697 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2112 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 108 (OVERLAPS) 39/2151 variables, 18/1715 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2151 variables, 5/1720 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2151 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 111 (OVERLAPS) 4/2155 variables, 4/1724 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2155 variables, 4/1728 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2155 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 114 (OVERLAPS) 8/2163 variables, 4/1732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2163 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 116 (OVERLAPS) 41/2204 variables, 28/1760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2204 variables, 9/1769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2204 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 119 (OVERLAPS) 39/2243 variables, 18/1787 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2243 variables, 5/1792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2243 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 122 (OVERLAPS) 4/2247 variables, 4/1796 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2247 variables, 4/1800 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2247 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 125 (OVERLAPS) 8/2255 variables, 4/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2255 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 127 (OVERLAPS) 38/2293 variables, 28/1832 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2293 variables, 9/1841 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2293 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 130 (OVERLAPS) 27/2320 variables, 14/1855 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2320 variables, 3/1858 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2320 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 133 (OVERLAPS) 4/2324 variables, 4/1862 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2324 variables, 2/1864 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2324 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 136 (OVERLAPS) 2/2326 variables, 1/1865 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2326 variables, 0/1865 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 138 (OVERLAPS) 8/2334 variables, 8/1873 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2334 variables, 2/1875 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2334 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 141 (OVERLAPS) 0/2334 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2334/2334 variables, and 1875 constraints, problems are : Problem set: 0 solved, 12 unsolved in 40276 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1270/1270 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 29/29 constraints]
After SMT, in 52784ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3226 ms.
Support contains 16 out of 1270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1270/1270 places, 1064/1064 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 1270 transition count 1063
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 1269 transition count 1063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1268 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 6 place count 1267 transition count 1062
Applied a total of 6 rules in 96 ms. Remains 1267 /1270 variables (removed 3) and now considering 1062/1064 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1267/1270 places, 1062/1064 transitions.
RANDOM walk for 40000 steps (8 resets) in 518 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 101682 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 12
Probabilistic random walk after 101682 steps, saw 84561 distinct states, run finished after 3007 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 1062 rows 1267 cols
[2025-06-07 23:10:15] [INFO ] Computed 550 invariants in 3 ms
[2025-06-07 23:10:15] [INFO ] State equation strengthened by 9 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 65/81 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/87 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 103/190 variables, 87/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 167/357 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 29/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 10/367 variables, 10/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 10/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 20/387 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 243/630 variables, 126/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/630 variables, 35/429 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 15/645 variables, 16/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/645 variables, 15/460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/645 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 28/673 variables, 14/474 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/673 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 315/988 variables, 181/655 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/988 variables, 53/708 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/988 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 17/1005 variables, 19/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1005 variables, 17/744 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1005 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 30/1035 variables, 15/759 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1035 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 282/1317 variables, 167/926 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1317 variables, 51/977 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1317 variables, 1/978 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1317 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 11/1328 variables, 14/992 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1328 variables, 11/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1328 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 16/1344 variables, 8/1011 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1344 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 209/1553 variables, 131/1142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1553 variables, 42/1184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1553 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 8/1561 variables, 13/1197 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1561 variables, 8/1205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1561 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 6/1567 variables, 3/1208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1567 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 114/1681 variables, 64/1272 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1681 variables, 19/1291 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1681 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1681 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 7/1688 variables, 9/1301 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1688 variables, 7/1308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1688 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 9/1697 variables, 5/1313 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1697 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1697 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 85/1782 variables, 52/1366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1782 variables, 19/1385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1782 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (OVERLAPS) 2/1784 variables, 2/1387 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1784 variables, 2/1389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1784 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (OVERLAPS) 4/1788 variables, 2/1391 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1788 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 88/1876 variables, 46/1437 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1876 variables, 12/1449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1876 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 6/1882 variables, 8/1457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1882 variables, 6/1463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1882 variables, 0/1463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 8/1890 variables, 4/1467 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1890 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 74/1964 variables, 46/1513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1964 variables, 16/1529 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1964 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (OVERLAPS) 2/1966 variables, 2/1531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1966 variables, 2/1533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1966 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (OVERLAPS) 4/1970 variables, 2/1535 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1970 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (OVERLAPS) 75/2045 variables, 39/1574 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2045 variables, 9/1583 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2045 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (OVERLAPS) 6/2051 variables, 8/1591 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2051 variables, 6/1597 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2051 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 89 (OVERLAPS) 8/2059 variables, 4/1601 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2059 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 91 (OVERLAPS) 51/2110 variables, 36/1637 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2110 variables, 13/1650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2110 variables, 0/1650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 94 (OVERLAPS) 39/2149 variables, 18/1668 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2149 variables, 5/1673 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2149 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 97 (OVERLAPS) 4/2153 variables, 4/1677 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2153 variables, 4/1681 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2153 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 100 (OVERLAPS) 8/2161 variables, 4/1685 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2161 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 102 (OVERLAPS) 41/2202 variables, 28/1713 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2202 variables, 9/1722 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2202 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 105 (OVERLAPS) 39/2241 variables, 18/1740 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2241 variables, 5/1745 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2241 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 108 (OVERLAPS) 4/2245 variables, 4/1749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2245 variables, 4/1753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2245 variables, 0/1753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 111 (OVERLAPS) 8/2253 variables, 4/1757 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2253 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 113 (OVERLAPS) 40/2293 variables, 28/1785 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2293 variables, 9/1794 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2293 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 116 (OVERLAPS) 25/2318 variables, 14/1808 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2318 variables, 4/1812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2318 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 119 (OVERLAPS) 2/2320 variables, 3/1815 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2320 variables, 2/1817 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2320 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 122 (OVERLAPS) 2/2322 variables, 1/1818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2322 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 124 (OVERLAPS) 7/2329 variables, 6/1824 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2329 variables, 2/1826 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2329 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 127 (OVERLAPS) 0/2329 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2329/2329 variables, and 1826 constraints, problems are : Problem set: 0 solved, 12 unsolved in 12877 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1267/1267 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 65/81 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/87 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 103/190 variables, 87/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 167/357 variables, 85/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 29/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:29] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:29] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 20/387 variables, 10/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/387 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 243/630 variables, 126/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 35/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:30] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:30] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/630 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 15/645 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/645 variables, 15/478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 28/673 variables, 14/492 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:30] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/673 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/673 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 315/988 variables, 181/674 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/988 variables, 53/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:31] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:31] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/988 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/988 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 17/1005 variables, 19/748 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 17/765 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 30/1035 variables, 15/780 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1035 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 282/1317 variables, 167/947 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1317 variables, 51/998 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1317 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:33] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:33] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:33] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:33] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:33] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1317 variables, 5/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1317 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 11/1328 variables, 14/1018 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1328 variables, 11/1029 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1328 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 16/1344 variables, 8/1037 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1344 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (OVERLAPS) 209/1553 variables, 131/1168 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1553 variables, 42/1210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:36] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1553 variables, 8/1218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1553 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 8/1561 variables, 13/1231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1561 variables, 8/1239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1561 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 6/1567 variables, 3/1242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1567 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (OVERLAPS) 114/1681 variables, 64/1306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1681 variables, 19/1325 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1681 variables, 1/1326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:39] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/1681 variables, 20/1346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:41] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1681 variables, 1/1347 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:42] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1681 variables, 1/1348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1681 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 7/1688 variables, 9/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1688 variables, 7/1364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1688 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 9/1697 variables, 5/1369 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1697 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1697 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 85/1782 variables, 52/1422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1782 variables, 19/1441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:45] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:45] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/1782 variables, 2/1443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1782 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (OVERLAPS) 2/1784 variables, 2/1445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1784 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1784 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (OVERLAPS) 4/1788 variables, 2/1449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1788 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (OVERLAPS) 88/1876 variables, 46/1495 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1876 variables, 12/1507 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1876 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (OVERLAPS) 6/1882 variables, 8/1515 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1882 variables, 6/1521 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1882 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (OVERLAPS) 8/1890 variables, 4/1525 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1890 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 90 (OVERLAPS) 74/1964 variables, 46/1571 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1964 variables, 16/1587 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1964 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 93 (OVERLAPS) 2/1966 variables, 2/1589 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1966 variables, 2/1591 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1966 variables, 0/1591 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 96 (OVERLAPS) 4/1970 variables, 2/1593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1970 variables, 0/1593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 98 (OVERLAPS) 75/2045 variables, 39/1632 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2045 variables, 9/1641 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2045 variables, 0/1641 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 101 (OVERLAPS) 6/2051 variables, 8/1649 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2051 variables, 6/1655 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:54] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 103 (INCLUDED_ONLY) 0/2051 variables, 1/1656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2051 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 105 (OVERLAPS) 8/2059 variables, 4/1660 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2059 variables, 0/1660 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 107 (OVERLAPS) 51/2110 variables, 36/1696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2110 variables, 13/1709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:58] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:58] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 109 (INCLUDED_ONLY) 0/2110 variables, 9/1718 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2110 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 111 (OVERLAPS) 39/2149 variables, 18/1736 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2149 variables, 5/1741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2149 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 114 (OVERLAPS) 4/2153 variables, 4/1745 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2153 variables, 4/1749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2153 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 117 (OVERLAPS) 8/2161 variables, 4/1753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2161 variables, 0/1753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 119 (OVERLAPS) 41/2202 variables, 28/1781 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2202 variables, 9/1790 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2202 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 122 (OVERLAPS) 39/2241 variables, 18/1808 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2241 variables, 5/1813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2241 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 125 (OVERLAPS) 4/2245 variables, 4/1817 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2245 variables, 4/1821 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/2245 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 128 (OVERLAPS) 8/2253 variables, 4/1825 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2253 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 130 (OVERLAPS) 40/2293 variables, 28/1853 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2293 variables, 9/1862 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2293 variables, 0/1862 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 133 (OVERLAPS) 25/2318 variables, 14/1876 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2318 variables, 4/1880 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2318 variables, 0/1880 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 136 (OVERLAPS) 2/2320 variables, 3/1883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2320 variables, 2/1885 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2320 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 139 (OVERLAPS) 2/2322 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2322 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 141 (OVERLAPS) 7/2329 variables, 6/1892 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2329 variables, 2/1894 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2329 variables, 0/1894 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 144 (OVERLAPS) 0/2329 variables, 0/1894 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2329/2329 variables, and 1894 constraints, problems are : Problem set: 0 solved, 12 unsolved in 44829 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1267/1267 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 51/51 constraints]
After SMT, in 57722ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2917 ms.
Support contains 16 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 1062/1062 transitions.
Applied a total of 0 rules in 34 ms. Remains 1267 /1267 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1267/1267 places, 1062/1062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 1062/1062 transitions.
Applied a total of 0 rules in 38 ms. Remains 1267 /1267 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2025-06-07 23:11:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:16] [INFO ] Implicit Places using invariants in 602 ms returned [1250, 1254]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 607 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1265/1267 places, 1062/1062 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1263 transition count 1060
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1263 transition count 1060
Applied a total of 4 rules in 58 ms. Remains 1263 /1265 variables (removed 2) and now considering 1060/1062 (removed 2) transitions.
// Phase 1: matrix 1060 rows 1263 cols
[2025-06-07 23:11:17] [INFO ] Computed 548 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:17] [INFO ] Implicit Places using invariants in 596 ms returned []
[2025-06-07 23:11:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-07 23:11:18] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1263/1267 places, 1060/1062 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2576 ms. Remains : 1263/1267 places, 1060/1062 transitions.
Computed a total of 800 stabilizing places and 800 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(p0)&&X((X(p2)||G(p3)||p1)))))'
Support contains 5 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 557 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:11:19] [INFO ] Computed 551 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:20] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2025-06-07 23:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:24] [INFO ] Implicit Places using invariants and state equation in 3155 ms returned []
Implicit Place search using SMT with State Equation took 4311 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:11:24] [INFO ] Invariant cache hit.
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60811ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65693 ms. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-00
Product exploration explored 100000 steps with 1 reset in 875 ms.
Stack based approach found an accepted trace after 5901 steps with 1 reset with depth 5899 and stack size 5899 in 60 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-00 finished in 67151 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 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3358 transition count 2308
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2658 transition count 2308
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1400 place count 2658 transition count 1912
Deduced a syphon composed of 396 places in 4 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2192 place count 2262 transition count 1912
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2196 place count 2258 transition count 1908
Iterating global reduction 2 with 4 rules applied. Total rules applied 2200 place count 2258 transition count 1908
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2200 place count 2258 transition count 1904
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2208 place count 2254 transition count 1904
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3908 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1404 transition count 1053
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3911 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4209 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4211 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4212 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4212 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4216 place count 1249 transition count 1048
Applied a total of 4216 rules in 705 ms. Remains 1249 /3359 variables (removed 2110) and now considering 1048/3009 (removed 1961) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2025-06-07 23:12:27] [INFO ] Computed 550 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:27] [INFO ] Implicit Places using invariants in 568 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 571 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3359 places, 1048/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 62 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2025-06-07 23:12:27] [INFO ] Computed 548 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:28] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-06-07 23:12:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 23:12:29] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3359 places, 1046/3009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3085 ms. Remains : 1245/3359 places, 1046/3009 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 792 ms.
Product exploration explored 100000 steps with 0 reset in 1055 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1245 stabilizing places and 2/1046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 32 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2025-06-07 23:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:32] [INFO ] Implicit Places using invariants in 584 ms returned []
[2025-06-07 23:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 23:12:33] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:12:33] [INFO ] Redundant transitions in 62 ms returned []
Running 1041 sub problems to find dead transitions.
[2025-06-07 23:12:33] [INFO ] Invariant cache hit.
[2025-06-07 23:12:33] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 545/545 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1242/2291 variables, and 545 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 545/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 545/545 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1242/2291 variables, and 545 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 545/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61993 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1245 stabilizing places and 2/1046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 754 ms.
Product exploration explored 100000 steps with 0 reset in 1006 ms.
Built C files in :
/tmp/ltsmin2116918099339537687
[2025-06-07 23:13:36] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2025-06-07 23:13:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:13:36] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2025-06-07 23:13:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:13:36] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2025-06-07 23:13:36] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:13:36] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2116918099339537687
Running compilation step : cd /tmp/ltsmin2116918099339537687;'/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/ltsmin2116918099339537687;'/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/ltsmin2116918099339537687;'/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 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2025-06-07 23:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:40] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-06-07 23:13:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 23:13:41] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:13:41] [INFO ] Redundant transitions in 16 ms returned []
Running 1041 sub problems to find dead transitions.
[2025-06-07 23:13:41] [INFO ] Invariant cache hit.
[2025-06-07 23:13:41] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 545/545 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1242/2291 variables, and 545 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 545/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 545/545 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1242/2291 variables, and 545 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 545/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61951 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Built C files in :
/tmp/ltsmin3110844264045322053
[2025-06-07 23:14:41] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2025-06-07 23:14:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:14:41] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2025-06-07 23:14:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:14:41] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2025-06-07 23:14:41] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:14:41] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3110844264045322053
Running compilation step : cd /tmp/ltsmin3110844264045322053;'/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/ltsmin3110844264045322053;'/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/ltsmin3110844264045322053;'/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-07 23:14:44] [INFO ] Flatten gal took : 37 ms
[2025-06-07 23:14:44] [INFO ] Flatten gal took : 35 ms
[2025-06-07 23:14:44] [INFO ] Time to serialize gal into /tmp/LTL4330323219885496550.gal : 10 ms
[2025-06-07 23:14:44] [INFO ] Time to serialize properties into /tmp/LTL9926942164324903367.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/LTL4330323219885496550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9690619324036255081.hoa' '-atoms' '/tmp/LTL9926942164324903367.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...317
Loading property file /tmp/LTL9926942164324903367.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9690619324036255081.hoa
Detected timeout of ITS tools.
[2025-06-07 23:15:00] [INFO ] Flatten gal took : 45 ms
[2025-06-07 23:15:00] [INFO ] Flatten gal took : 31 ms
[2025-06-07 23:15:00] [INFO ] Time to serialize gal into /tmp/LTL6655756761232525170.gal : 7 ms
[2025-06-07 23:15:00] [INFO ] Time to serialize properties into /tmp/LTL10143696082718852146.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6655756761232525170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10143696082718852146.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p634!=1)"))))
Formula 0 simplified : GF!"(p634!=1)"
Detected timeout of ITS tools.
[2025-06-07 23:15:15] [INFO ] Flatten gal took : 28 ms
[2025-06-07 23:15:15] [INFO ] Applying decomposition
[2025-06-07 23:15:15] [INFO ] Flatten gal took : 28 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/graph14668747037249860428.txt' '-o' '/tmp/graph14668747037249860428.bin' '-w' '/tmp/graph14668747037249860428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14668747037249860428.bin' '-l' '-1' '-v' '-w' '/tmp/graph14668747037249860428.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:15:15] [INFO ] Decomposing Gal with order
[2025-06-07 23:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:15:15] [INFO ] Removed a total of 308 redundant transitions.
[2025-06-07 23:15:15] [INFO ] Flatten gal took : 96 ms
[2025-06-07 23:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 19 ms.
[2025-06-07 23:15:15] [INFO ] Time to serialize gal into /tmp/LTL17711788530636951391.gal : 16 ms
[2025-06-07 23:15:15] [INFO ] Time to serialize properties into /tmp/LTL14978428904381989929.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/LTL17711788530636951391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14978428904381989929.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 : !((F(G("(i4.u65.p634!=1)"))))
Formula 0 simplified : GF!"(i4.u65.p634!=1)"
Reverse transition relation is NOT exact ! Due to transitions i4.t22, i4.t21, i4.u65.t149, i5.i0.t25, Intersection with reachable at each step enabled. (d...201
Computing Next relation with stutter on 3.73747e+82 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
841 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.54329,267004,1,0,491044,284,8314,1.33107e+06,588,1439,381001
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 179189 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) U p1) U ((p1 U p2) U X(p3))))'
Support contains 5 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 576 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:15:26] [INFO ] Computed 551 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:15:27] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2025-06-07 23:15:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:15:30] [INFO ] Implicit Places using invariants and state equation in 2979 ms returned []
Implicit Place search using SMT with State Equation took 4149 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60827ms
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65569 ms. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 441 ms :[(NOT p3), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04
Product exploration explored 100000 steps with 2889 reset in 283 ms.
Product exploration explored 100000 steps with 2803 reset in 308 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 148 ms. Reduced automaton from 9 states, 20 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
[2025-06-07 23:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3244/3352 variables, 546/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3352 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3002/6354 variables, 3352/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6354 variables, 0/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/6354 variables, 0/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6354/6354 variables, and 3903 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3352/3352 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3244/3352 variables, 546/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:37] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:37] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:37] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:38] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:38] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:38] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:38] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:39] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:39] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:39] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:39] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:39] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:40] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:41] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:41] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3352 variables, 20/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:41] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:41] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 12 ms to minimize.
SMT process timed out in 8409ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3352 transition count 2305
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 2655 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 2654 transition count 2304
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1396 place count 2654 transition count 1906
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2192 place count 2256 transition count 1906
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3890 place count 1407 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3891 place count 1407 transition count 1056
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3893 place count 1406 transition count 1055
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4095 place count 1305 transition count 1055
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4189 place count 1258 transition count 1055
Partial Free-agglomeration rule applied 149 times.
Drop transitions (Partial Free agglomeration) removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4338 place count 1258 transition count 1055
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4339 place count 1257 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4340 place count 1256 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4340 place count 1256 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4344 place count 1254 transition count 1052
Applied a total of 4344 rules in 488 ms. Remains 1254 /3352 variables (removed 2098) and now considering 1052/3002 (removed 1950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 1254/3352 places, 1052/3002 transitions.
RANDOM walk for 40000 steps (8 resets) in 555 ms. (71 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
// Phase 1: matrix 1052 rows 1254 cols
[2025-06-07 23:16:42] [INFO ] Computed 550 invariants in 3 ms
[2025-06-07 23:16:42] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 129/1013 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1013 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1013 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1013 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/1017 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1017 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1017 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/1025 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1025 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 155/1180 variables, 87/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1180 variables, 24/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1180 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 10/1190 variables, 14/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1190 variables, 10/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1190 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 12/1202 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1202 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 102/1304 variables, 63/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1304 variables, 22/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1304 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1304 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2/1306 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1306 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1306 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 3/1309 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1309 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1309 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 104/1413 variables, 55/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1413 variables, 16/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1413 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 8/1421 variables, 10/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1421 variables, 8/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1421 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 12/1433 variables, 6/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1433 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 76/1509 variables, 49/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1509 variables, 17/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1509 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 88/1597 variables, 43/1220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1597 variables, 11/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1597 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 8/1605 variables, 10/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1605 variables, 8/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1605 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 12/1617 variables, 6/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1617 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 76/1693 variables, 49/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1693 variables, 17/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1693 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 88/1781 variables, 43/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1781 variables, 11/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1781 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1789 variables, 10/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1789 variables, 8/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1789 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1801 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1801 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1877 variables, 49/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1877 variables, 17/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1877 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1965 variables, 43/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1965 variables, 11/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1965 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1973 variables, 10/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1973 variables, 8/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1973 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 12/1985 variables, 6/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1985 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 76/2061 variables, 49/1592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2061 variables, 17/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2061 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 82/2143 variables, 43/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2143 variables, 11/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2143 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 7/2150 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2150 variables, 7/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2150 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 8/2158 variables, 4/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2158 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 43/2201 variables, 29/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2201 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2201 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 54/2255 variables, 27/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2255 variables, 7/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2255 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2259 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2259 variables, 4/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2259 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/2263 variables, 2/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2263 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 28/2291 variables, 21/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2291 variables, 8/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2291 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 12/2303 variables, 6/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2303 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2303 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 1/2304 variables, 2/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2304 variables, 1/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2304 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/2306 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2306 variables, 1/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 1811 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3428 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 10/187 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 110/297 variables, 57/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/297 variables, 16/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 7/304 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/304 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:46] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 167/485 variables, 92/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/485 variables, 27/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:46] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 10/495 variables, 10/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/495 variables, 10/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 20/515 variables, 10/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/515 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 170/685 variables, 100/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/685 variables, 30/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:46] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:46] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 6/691 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/691 variables, 6/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 8/699 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/699 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 163/862 variables, 92/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/862 variables, 26/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 8/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 10/872 variables, 14/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/872 variables, 10/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/872 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 12/884 variables, 6/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/884 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 129/1013 variables, 73/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1013 variables, 25/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1013 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:48] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 4/1017 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1017 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:48] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1017 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1017 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/1025 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1025 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 155/1180 variables, 87/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 24/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:48] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1180 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 10/1190 variables, 14/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 10/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1190 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 12/1202 variables, 6/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1202 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 102/1304 variables, 63/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1304 variables, 22/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1304 variables, 1/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1304 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 2/1306 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1306 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1306 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 3/1309 variables, 2/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1309 variables, 1/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1309 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 104/1413 variables, 55/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1413 variables, 16/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1413 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 8/1421 variables, 10/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1421 variables, 8/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1421 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 12/1433 variables, 6/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1433 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 76/1509 variables, 49/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1509 variables, 17/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1509 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 88/1597 variables, 43/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1597 variables, 11/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1597 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 8/1605 variables, 10/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1605 variables, 8/1269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:50] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:50] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 101 (INCLUDED_ONLY) 0/1605 variables, 3/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1605 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1617 variables, 6/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1617 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1693 variables, 49/1327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1693 variables, 17/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1693 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1781 variables, 43/1387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1781 variables, 11/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:51] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:51] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:51] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:51] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:51] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:52] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:52] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 110 (INCLUDED_ONLY) 0/1781 variables, 7/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1781 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 8/1789 variables, 10/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1789 variables, 8/1423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1789 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 12/1801 variables, 6/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1801 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 76/1877 variables, 49/1478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1877 variables, 17/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:52] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:53] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 119 (INCLUDED_ONLY) 0/1877 variables, 7/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1877 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 88/1965 variables, 43/1545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1965 variables, 11/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1965 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 8/1973 variables, 10/1566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1973 variables, 8/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1973 variables, 0/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 12/1985 variables, 6/1580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1985 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (OVERLAPS) 76/2061 variables, 49/1629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2061 variables, 17/1646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2061 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (OVERLAPS) 82/2143 variables, 43/1689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2143 variables, 11/1700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:54] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:16:54] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 134 (INCLUDED_ONLY) 0/2143 variables, 2/1702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2143 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 7/2150 variables, 10/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2150 variables, 7/1719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2150 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 8/2158 variables, 4/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2158 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 43/2201 variables, 29/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2201 variables, 10/1762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2201 variables, 0/1762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 54/2255 variables, 27/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2255 variables, 7/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2255 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 4/2259 variables, 6/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2259 variables, 4/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2259 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 4/2263 variables, 2/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/2263 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 28/2291 variables, 21/1829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2291 variables, 8/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2291 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 12/2303 variables, 6/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2303 variables, 1/1844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2303 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 1/2304 variables, 2/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/2304 variables, 1/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/2304 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (OVERLAPS) 2/2306 variables, 2/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/2306 variables, 1/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/2306 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (OVERLAPS) 0/2306 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1850 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11979 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 35/35 constraints]
After SMT, in 15419ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 754 ms.
Support contains 5 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 31 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1254/1254 places, 1052/1052 transitions.
RANDOM walk for 40000 steps (8 resets) in 488 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 151696 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 151696 steps, saw 127275 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-07 23:17:02] [INFO ] Invariant cache hit.
[2025-06-07 23:17:02] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 129/1013 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1013 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1013 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1013 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/1017 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1017 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1017 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/1025 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1025 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 155/1180 variables, 87/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1180 variables, 24/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1180 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 10/1190 variables, 14/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1190 variables, 10/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1190 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 12/1202 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1202 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 102/1304 variables, 63/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1304 variables, 22/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1304 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1304 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2/1306 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1306 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1306 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 3/1309 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1309 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1309 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 104/1413 variables, 55/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1413 variables, 16/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1413 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 8/1421 variables, 10/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1421 variables, 8/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1421 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 12/1433 variables, 6/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1433 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 76/1509 variables, 49/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1509 variables, 17/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1509 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 88/1597 variables, 43/1220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1597 variables, 11/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1597 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 8/1605 variables, 10/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1605 variables, 8/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1605 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 12/1617 variables, 6/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1617 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 76/1693 variables, 49/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1693 variables, 17/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1693 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 88/1781 variables, 43/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1781 variables, 11/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1781 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1789 variables, 10/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1789 variables, 8/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1789 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1801 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1801 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1877 variables, 49/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1877 variables, 17/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1877 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1965 variables, 43/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1965 variables, 11/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1965 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1973 variables, 10/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1973 variables, 8/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1973 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 12/1985 variables, 6/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1985 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 76/2061 variables, 49/1592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2061 variables, 17/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2061 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 82/2143 variables, 43/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2143 variables, 11/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2143 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 7/2150 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2150 variables, 7/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2150 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 8/2158 variables, 4/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2158 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 43/2201 variables, 29/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2201 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2201 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 54/2255 variables, 27/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2255 variables, 7/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2255 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2259 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2259 variables, 4/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2259 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/2263 variables, 2/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2263 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 28/2291 variables, 21/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2291 variables, 8/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2291 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 12/2303 variables, 6/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2303 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2303 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 1/2304 variables, 2/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2304 variables, 1/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2304 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/2306 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2306 variables, 1/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 1811 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3421 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:05] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:05] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/187 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 110/297 variables, 57/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/297 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/304 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/318 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 167/485 variables, 92/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 27/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 10/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/495 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/515 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/515 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 170/685 variables, 100/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 30/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:06] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 8/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/685 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 6/691 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/691 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/699 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/699 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 163/862 variables, 92/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 26/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 3 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/862 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/862 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 10/872 variables, 14/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 10/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/872 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 12/884 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/884 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 129/1013 variables, 73/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1013 variables, 25/793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 3/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1013 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 4/1017 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1017 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1017 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/1025 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1025 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 155/1180 variables, 87/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 24/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:08] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 5/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1180 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 10/1190 variables, 14/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 10/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1190 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 12/1202 variables, 6/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1202 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 102/1304 variables, 63/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1304 variables, 22/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1304 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1304 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 2/1306 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1306 variables, 2/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1306 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 3/1309 variables, 2/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1309 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1309 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 104/1413 variables, 55/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1413 variables, 16/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1413 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 8/1421 variables, 10/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1421 variables, 8/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1421 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 12/1433 variables, 6/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1433 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 76/1509 variables, 49/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1509 variables, 17/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1509 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 88/1597 variables, 43/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1597 variables, 11/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:10] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:11] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/1597 variables, 8/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1597 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1605 variables, 10/1281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1605 variables, 8/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1605 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1617 variables, 6/1295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1617 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1693 variables, 49/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1693 variables, 17/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1693 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1781 variables, 43/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1781 variables, 11/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1781 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1789 variables, 10/1425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1789 variables, 8/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1789 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 12/1801 variables, 6/1439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1801 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 76/1877 variables, 49/1488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1877 variables, 17/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1877 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 88/1965 variables, 43/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1965 variables, 11/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1965 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 8/1973 variables, 10/1569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1973 variables, 8/1577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1973 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 12/1985 variables, 6/1583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1985 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 76/2061 variables, 49/1632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2061 variables, 17/1649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2061 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 82/2143 variables, 43/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2143 variables, 11/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2143 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 7/2150 variables, 10/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2150 variables, 7/1720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2150 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 8/2158 variables, 4/1724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2158 variables, 0/1724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 43/2201 variables, 29/1753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2201 variables, 10/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2201 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 54/2255 variables, 27/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2255 variables, 7/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2255 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 4/2259 variables, 6/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2259 variables, 4/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2259 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 4/2263 variables, 2/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2263 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 28/2291 variables, 21/1830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2291 variables, 8/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/2291 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 12/2303 variables, 6/1844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2303 variables, 1/1845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2303 variables, 0/1845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 1/2304 variables, 2/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2304 variables, 1/1848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2304 variables, 0/1848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 2/2306 variables, 2/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/2306 variables, 1/1851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/2306 variables, 0/1851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (OVERLAPS) 0/2306 variables, 0/1851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1851 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11208 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 34/34 constraints]
After SMT, in 14637ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 714 ms.
Support contains 5 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 32 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1254/1254 places, 1052/1052 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 31 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2025-06-07 23:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:17:18] [INFO ] Implicit Places using invariants in 597 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 598 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1252/1254 places, 1052/1052 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1250 transition count 1050
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1250 transition count 1050
Applied a total of 4 rules in 56 ms. Remains 1250 /1252 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1250 cols
[2025-06-07 23:17:18] [INFO ] Computed 548 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:17:18] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-07 23:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:17:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 23:17:20] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1250/1254 places, 1050/1052 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2565 ms. Remains : 1250/1254 places, 1050/1052 transitions.
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 151472 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 151472 steps, saw 127234 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-07 23:17:23] [INFO ] Invariant cache hit.
[2025-06-07 23:17:23] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 128/1012 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1012 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1012 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 4/1016 variables, 4/773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1016 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1016 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 8/1024 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1024 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 153/1177 variables, 85/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1177 variables, 23/889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1177 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 10/1187 variables, 14/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1187 variables, 10/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1187 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 12/1199 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1199 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 101/1300 variables, 63/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1300 variables, 23/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1300 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 1/1301 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1301 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 2/1303 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1303 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 104/1407 variables, 55/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1407 variables, 16/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1407 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 8/1415 variables, 10/1089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1415 variables, 8/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1415 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 12/1427 variables, 6/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1427 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 76/1503 variables, 49/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1503 variables, 17/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1503 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 88/1591 variables, 43/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1591 variables, 11/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1591 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 8/1599 variables, 10/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1599 variables, 8/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1599 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 12/1611 variables, 6/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1611 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 76/1687 variables, 49/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1687 variables, 17/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1687 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 88/1775 variables, 43/1356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1775 variables, 11/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1775 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 8/1783 variables, 10/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1783 variables, 8/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1783 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 12/1795 variables, 6/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1795 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 76/1871 variables, 49/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1871 variables, 17/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1871 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 88/1959 variables, 43/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1959 variables, 11/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1959 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 8/1967 variables, 10/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1967 variables, 8/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1967 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 12/1979 variables, 6/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1979 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 76/2055 variables, 49/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2055 variables, 17/1601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2055 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 82/2137 variables, 43/1644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2137 variables, 11/1655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2137 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 7/2144 variables, 10/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2144 variables, 7/1672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2144 variables, 0/1672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 8/2152 variables, 4/1676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2152 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 43/2195 variables, 29/1705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2195 variables, 10/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2195 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 54/2249 variables, 27/1742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2249 variables, 7/1749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2249 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 4/2253 variables, 6/1755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2253 variables, 4/1759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2253 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2257 variables, 2/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2257 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 28/2285 variables, 21/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2285 variables, 8/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2285 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 12/2297 variables, 6/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2297 variables, 1/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2297 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 1/2298 variables, 2/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2298 variables, 1/1800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2298 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 2/2300 variables, 2/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2300 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2300 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 0/2300 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1803 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1250/1250 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/187 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 110/297 variables, 57/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/297 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/304 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/318 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 167/485 variables, 92/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 27/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 10/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/495 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/515 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/515 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 170/685 variables, 100/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 30/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:27] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 8/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/685 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 6/691 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/691 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/699 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/699 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 163/862 variables, 92/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 26/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:28] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/862 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/862 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 10/872 variables, 14/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 10/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/872 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 12/884 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/884 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 128/1012 variables, 73/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1012 variables, 25/793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:29] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1012 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1012 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 4/1016 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1016 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1016 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 8/1024 variables, 4/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1024 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 153/1177 variables, 85/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1177 variables, 23/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:29] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:29] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:29] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:30] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:30] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:30] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:30] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1177 variables, 7/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1177 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 10/1187 variables, 14/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1187 variables, 10/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1187 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 12/1199 variables, 6/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1199 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 101/1300 variables, 63/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1300 variables, 23/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1300 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 1/1301 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1301 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1301 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 2/1303 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1303 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 104/1407 variables, 55/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1407 variables, 16/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1407 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 8/1415 variables, 10/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1415 variables, 8/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1415 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 12/1427 variables, 6/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1427 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 76/1503 variables, 49/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1503 variables, 17/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1503 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 88/1591 variables, 43/1244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1591 variables, 11/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1591 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 8/1599 variables, 10/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1599 variables, 8/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1599 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 12/1611 variables, 6/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1611 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 76/1687 variables, 49/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1687 variables, 17/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1687 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 88/1775 variables, 43/1388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1775 variables, 11/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:32] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:32] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:32] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:32] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 106 (INCLUDED_ONLY) 0/1775 variables, 4/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1775 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 8/1783 variables, 10/1413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1783 variables, 8/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1783 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 12/1795 variables, 6/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1795 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 76/1871 variables, 49/1476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1871 variables, 17/1493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1871 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 88/1959 variables, 43/1536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1959 variables, 11/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1959 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 8/1967 variables, 10/1557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1967 variables, 8/1565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1967 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 12/1979 variables, 6/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1979 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 76/2055 variables, 49/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2055 variables, 17/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2055 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 82/2137 variables, 43/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2137 variables, 11/1691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2137 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 7/2144 variables, 10/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2144 variables, 7/1708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2144 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 8/2152 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2152 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 43/2195 variables, 29/1741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2195 variables, 10/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2195 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 54/2249 variables, 27/1778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2249 variables, 7/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2249 variables, 0/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 4/2253 variables, 6/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2253 variables, 4/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2253 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 4/2257 variables, 2/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2257 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 28/2285 variables, 21/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/2285 variables, 8/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2285 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 12/2297 variables, 6/1832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2297 variables, 1/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/2297 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 1/2298 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2298 variables, 1/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2298 variables, 0/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 2/2300 variables, 2/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2300 variables, 1/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2300 variables, 0/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 0/2300 variables, 0/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1839 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10766 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1250/1250 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 30/30 constraints]
After SMT, in 14207ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 645 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1250/1250 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2025-06-07 23:17:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:17:38] [INFO ] Implicit Places using invariants in 609 ms returned []
[2025-06-07 23:17:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:17:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 23:17:40] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:17:40] [INFO ] Redundant transitions in 9 ms returned []
Running 1044 sub problems to find dead transitions.
[2025-06-07 23:17:40] [INFO ] Invariant cache hit.
[2025-06-07 23:17:40] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1246 variables, 535/535 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:17:59] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:00] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1246 variables, 20/555 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:02] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:02] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:02] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:03] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:04] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1246 variables, 20/575 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:07] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:08] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:09] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:09] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1246 variables, 20/595 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1246/2300 variables, and 595 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 535/548 constraints, State Equation: 0/1250 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1246 variables, 535/535 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1246 variables, 60/595 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:13] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:13] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:14] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1246 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:18] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:19] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:20] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:21] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:21] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1246 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:25] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:25] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:25] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:25] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:25] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:26] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:27] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:28] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1246 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:31] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:32] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:33] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:34] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:35] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:35] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:35] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:35] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1246 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:18:40] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
(s43 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1246/2300 variables, and 676 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 535/548 constraints, State Equation: 0/1250 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1044 constraints, Known Traps: 141/141 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62167 ms. Remains : 1250/1250 places, 1050/1050 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 25 factoid took 507 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 363 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:18:41] [INFO ] Computed 551 invariants in 13 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:18:48] [INFO ] [Real]Absence check using 551 positive place invariants in 4816 ms returned sat
[2025-06-07 23:18:56] [INFO ] [Real]Absence check using state equation in 8357 ms returned unknown
Could not prove EG (NOT p3)
Support contains 5 out of 3352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Applied a total of 0 rules in 302 ms. Remains 3352 /3352 variables (removed 0) and now considering 3002/3002 (removed 0) transitions.
[2025-06-07 23:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:18:58] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2025-06-07 23:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:19:01] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:19:01] [INFO ] Invariant cache hit.
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60814ms
Finished structural reductions in LTL mode , in 1 iterations and 65197 ms. Remains : 3352/3352 places, 3002/3002 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 154 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 383 ms. (104 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
[2025-06-07 23:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3244/3352 variables, 546/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3352 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3002/6354 variables, 3352/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6354 variables, 0/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/6354 variables, 0/3903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6354/6354 variables, and 3903 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3352/3352 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3244/3352 variables, 546/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:06] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:07] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:07] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:07] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:07] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:08] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:08] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:08] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:08] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:08] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:09] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:09] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:09] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:09] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:09] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3352 variables, 20/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:10] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:11] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:11] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 15 ms to minimize.
SMT process timed out in 8499ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3352 transition count 2305
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 2655 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 2654 transition count 2304
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1396 place count 2654 transition count 1906
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2192 place count 2256 transition count 1906
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3890 place count 1407 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3891 place count 1407 transition count 1056
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3893 place count 1406 transition count 1055
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4095 place count 1305 transition count 1055
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4189 place count 1258 transition count 1055
Partial Free-agglomeration rule applied 149 times.
Drop transitions (Partial Free agglomeration) removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4338 place count 1258 transition count 1055
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4339 place count 1257 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4340 place count 1256 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4340 place count 1256 transition count 1052
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4344 place count 1254 transition count 1052
Applied a total of 4344 rules in 492 ms. Remains 1254 /3352 variables (removed 2098) and now considering 1052/3002 (removed 1950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 1254/3352 places, 1052/3002 transitions.
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
// Phase 1: matrix 1052 rows 1254 cols
[2025-06-07 23:20:12] [INFO ] Computed 550 invariants in 2 ms
[2025-06-07 23:20:12] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 129/1013 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1013 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1013 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1013 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/1017 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1017 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1017 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/1025 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1025 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 155/1180 variables, 87/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1180 variables, 24/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1180 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 10/1190 variables, 14/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1190 variables, 10/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1190 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 12/1202 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1202 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 102/1304 variables, 63/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1304 variables, 22/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1304 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1304 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2/1306 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1306 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1306 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 3/1309 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1309 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1309 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 104/1413 variables, 55/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1413 variables, 16/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1413 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 8/1421 variables, 10/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1421 variables, 8/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1421 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 12/1433 variables, 6/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1433 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 76/1509 variables, 49/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1509 variables, 17/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1509 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 88/1597 variables, 43/1220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1597 variables, 11/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1597 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 8/1605 variables, 10/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1605 variables, 8/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1605 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 12/1617 variables, 6/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1617 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 76/1693 variables, 49/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1693 variables, 17/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1693 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 88/1781 variables, 43/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1781 variables, 11/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1781 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1789 variables, 10/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1789 variables, 8/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1789 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1801 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1801 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1877 variables, 49/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1877 variables, 17/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1877 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1965 variables, 43/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1965 variables, 11/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1965 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1973 variables, 10/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1973 variables, 8/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1973 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 12/1985 variables, 6/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1985 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 76/2061 variables, 49/1592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2061 variables, 17/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2061 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 82/2143 variables, 43/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2143 variables, 11/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2143 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 7/2150 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2150 variables, 7/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2150 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 8/2158 variables, 4/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2158 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 43/2201 variables, 29/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2201 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2201 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 54/2255 variables, 27/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2255 variables, 7/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2255 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2259 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2259 variables, 4/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2259 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/2263 variables, 2/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2263 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 28/2291 variables, 21/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2291 variables, 8/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2291 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 12/2303 variables, 6/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2303 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2303 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 1/2304 variables, 2/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2304 variables, 1/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2304 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/2306 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2306 variables, 1/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 1811 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:15] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 10/187 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 110/297 variables, 57/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/297 variables, 16/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 7/304 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/304 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 167/485 variables, 92/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/485 variables, 27/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 10/495 variables, 10/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/495 variables, 10/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 20/515 variables, 10/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/515 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 170/685 variables, 100/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/685 variables, 30/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:16] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:16] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 6/691 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/691 variables, 6/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 8/699 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/699 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 163/862 variables, 92/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/862 variables, 26/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 8/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 10/872 variables, 14/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/872 variables, 10/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/872 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 12/884 variables, 6/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/884 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 129/1013 variables, 73/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1013 variables, 25/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1013 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:17] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 4/1017 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1017 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:18] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1017 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1017 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/1025 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1025 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 155/1180 variables, 87/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 24/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:18] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1180 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 10/1190 variables, 14/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 10/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1190 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 12/1202 variables, 6/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1202 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 102/1304 variables, 63/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1304 variables, 22/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1304 variables, 1/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1304 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 2/1306 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1306 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1306 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 3/1309 variables, 2/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1309 variables, 1/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1309 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 104/1413 variables, 55/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1413 variables, 16/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1413 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 8/1421 variables, 10/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1421 variables, 8/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1421 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 12/1433 variables, 6/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1433 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 76/1509 variables, 49/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1509 variables, 17/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1509 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 88/1597 variables, 43/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1597 variables, 11/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1597 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 8/1605 variables, 10/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1605 variables, 8/1269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:20] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:20] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:20] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 101 (INCLUDED_ONLY) 0/1605 variables, 3/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1605 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1617 variables, 6/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1617 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1693 variables, 49/1327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1693 variables, 17/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1693 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1781 variables, 43/1387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1781 variables, 11/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:21] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 110 (INCLUDED_ONLY) 0/1781 variables, 7/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1781 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 8/1789 variables, 10/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1789 variables, 8/1423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1789 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 12/1801 variables, 6/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1801 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 76/1877 variables, 49/1478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1877 variables, 17/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:22] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:22] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:22] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:23] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:23] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:23] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:23] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 119 (INCLUDED_ONLY) 0/1877 variables, 7/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1877 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 88/1965 variables, 43/1545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1965 variables, 11/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1965 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 8/1973 variables, 10/1566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1973 variables, 8/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1973 variables, 0/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 12/1985 variables, 6/1580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1985 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (OVERLAPS) 76/2061 variables, 49/1629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2061 variables, 17/1646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2061 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (OVERLAPS) 82/2143 variables, 43/1689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2143 variables, 11/1700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:24] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:24] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 134 (INCLUDED_ONLY) 0/2143 variables, 2/1702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2143 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 7/2150 variables, 10/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2150 variables, 7/1719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2150 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 8/2158 variables, 4/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2158 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 43/2201 variables, 29/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2201 variables, 10/1762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2201 variables, 0/1762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 54/2255 variables, 27/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2255 variables, 7/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2255 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 4/2259 variables, 6/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2259 variables, 4/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2259 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 4/2263 variables, 2/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/2263 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 28/2291 variables, 21/1829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2291 variables, 8/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2291 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 12/2303 variables, 6/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2303 variables, 1/1844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2303 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 1/2304 variables, 2/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/2304 variables, 1/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/2304 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (OVERLAPS) 2/2306 variables, 2/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/2306 variables, 1/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/2306 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (OVERLAPS) 0/2306 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1850 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12214 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 35/35 constraints]
After SMT, in 15729ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 729 ms.
Support contains 5 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 29 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1254/1254 places, 1052/1052 transitions.
RANDOM walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 151774 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 151774 steps, saw 127336 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-07 23:20:31] [INFO ] Invariant cache hit.
[2025-06-07 23:20:31] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 129/1013 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1013 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1013 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1013 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/1017 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1017 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1017 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/1025 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1025 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 155/1180 variables, 87/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1180 variables, 24/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1180 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 10/1190 variables, 14/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1190 variables, 10/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1190 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 12/1202 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1202 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 102/1304 variables, 63/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1304 variables, 22/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1304 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1304 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2/1306 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1306 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1306 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 3/1309 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1309 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1309 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 104/1413 variables, 55/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1413 variables, 16/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1413 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 8/1421 variables, 10/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1421 variables, 8/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1421 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 12/1433 variables, 6/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1433 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 76/1509 variables, 49/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1509 variables, 17/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1509 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 88/1597 variables, 43/1220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1597 variables, 11/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1597 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 8/1605 variables, 10/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1605 variables, 8/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1605 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 12/1617 variables, 6/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1617 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 76/1693 variables, 49/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1693 variables, 17/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1693 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 88/1781 variables, 43/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1781 variables, 11/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1781 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1789 variables, 10/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1789 variables, 8/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1789 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1801 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1801 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1877 variables, 49/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1877 variables, 17/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1877 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1965 variables, 43/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1965 variables, 11/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1965 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1973 variables, 10/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1973 variables, 8/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1973 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 12/1985 variables, 6/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1985 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 76/2061 variables, 49/1592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2061 variables, 17/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2061 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 82/2143 variables, 43/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2143 variables, 11/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2143 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 7/2150 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2150 variables, 7/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2150 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 8/2158 variables, 4/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2158 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 43/2201 variables, 29/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2201 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2201 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 54/2255 variables, 27/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2255 variables, 7/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2255 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2259 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2259 variables, 4/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2259 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/2263 variables, 2/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2263 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 28/2291 variables, 21/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2291 variables, 8/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2291 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 12/2303 variables, 6/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2303 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2303 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 1/2304 variables, 2/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2304 variables, 1/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2304 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/2306 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2306 variables, 1/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 0/2306 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 1811 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:35] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/187 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 110/297 variables, 57/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/297 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/304 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:35] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/318 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 167/485 variables, 92/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 27/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 10/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/495 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/515 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/515 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 170/685 variables, 100/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 30/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:36] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 8/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/685 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 6/691 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/691 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/699 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/699 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 163/862 variables, 92/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 26/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/862 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/862 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 10/872 variables, 14/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 10/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/872 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 12/884 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/884 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 129/1013 variables, 73/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1013 variables, 25/793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1013 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:37] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 3/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1013 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 4/1017 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1017 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1017 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/1025 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1025 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 155/1180 variables, 87/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1180 variables, 24/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:38] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1180 variables, 5/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1180 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 10/1190 variables, 14/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1190 variables, 10/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1190 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 12/1202 variables, 6/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1202 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 102/1304 variables, 63/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1304 variables, 22/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1304 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1304 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 2/1306 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1306 variables, 2/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1306 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 3/1309 variables, 2/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1309 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1309 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 104/1413 variables, 55/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1413 variables, 16/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1413 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 8/1421 variables, 10/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1421 variables, 8/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1421 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 12/1433 variables, 6/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1433 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 76/1509 variables, 49/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1509 variables, 17/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1509 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 88/1597 variables, 43/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1597 variables, 11/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:40] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:41] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/1597 variables, 8/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1597 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 8/1605 variables, 10/1281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1605 variables, 8/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1605 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 12/1617 variables, 6/1295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1617 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 76/1693 variables, 49/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1693 variables, 17/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1693 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 88/1781 variables, 43/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1781 variables, 11/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1781 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 8/1789 variables, 10/1425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1789 variables, 8/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:42] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 113 (INCLUDED_ONLY) 0/1789 variables, 1/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1789 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 12/1801 variables, 6/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1801 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 76/1877 variables, 49/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1877 variables, 17/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1877 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 88/1965 variables, 43/1549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1965 variables, 11/1560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1965 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 8/1973 variables, 10/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1973 variables, 8/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1973 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (OVERLAPS) 12/1985 variables, 6/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1985 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 76/2061 variables, 49/1633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2061 variables, 17/1650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2061 variables, 0/1650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 82/2143 variables, 43/1693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2143 variables, 11/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2143 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (OVERLAPS) 7/2150 variables, 10/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/2150 variables, 7/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2150 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (OVERLAPS) 8/2158 variables, 4/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2158 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 43/2201 variables, 29/1754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2201 variables, 10/1764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/2201 variables, 0/1764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (OVERLAPS) 54/2255 variables, 27/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2255 variables, 7/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:45] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 144 (INCLUDED_ONLY) 0/2255 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2255 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 4/2259 variables, 6/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/2259 variables, 4/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2259 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 4/2263 variables, 2/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2263 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (OVERLAPS) 28/2291 variables, 21/1832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/2291 variables, 8/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2291 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (OVERLAPS) 12/2303 variables, 6/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/2303 variables, 1/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2303 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (OVERLAPS) 1/2304 variables, 2/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/2304 variables, 1/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/2304 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (OVERLAPS) 2/2306 variables, 2/1852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/2306 variables, 1/1853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/2306 variables, 0/1853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (OVERLAPS) 0/2306 variables, 0/1853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1853 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11982 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1254/1254 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 36/36 constraints]
After SMT, in 15450ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 737 ms.
Support contains 5 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 29 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1254/1254 places, 1052/1052 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Applied a total of 0 rules in 30 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2025-06-07 23:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:20:48] [INFO ] Implicit Places using invariants in 612 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1252/1254 places, 1052/1052 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1250 transition count 1050
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1250 transition count 1050
Applied a total of 4 rules in 56 ms. Remains 1250 /1252 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1250 cols
[2025-06-07 23:20:48] [INFO ] Computed 548 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:20:49] [INFO ] Implicit Places using invariants in 588 ms returned []
[2025-06-07 23:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:20:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 23:20:50] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1250/1254 places, 1050/1052 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2604 ms. Remains : 1250/1254 places, 1050/1052 transitions.
RANDOM walk for 40000 steps (8 resets) in 496 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 153367 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 3
Probabilistic random walk after 153367 steps, saw 128952 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-07 23:20:54] [INFO ] Invariant cache hit.
[2025-06-07 23:20:54] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/177 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/187 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 110/297 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/304 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/318 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 167/485 variables, 92/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 27/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/495 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/495 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 20/515 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 170/685 variables, 100/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 30/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/691 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/691 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/691 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 8/699 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/699 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 163/862 variables, 92/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/862 variables, 26/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/862 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 10/872 variables, 14/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/872 variables, 10/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/884 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/884 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 128/1012 variables, 73/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1012 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1012 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 4/1016 variables, 4/773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1016 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1016 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 8/1024 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1024 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 153/1177 variables, 85/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1177 variables, 23/889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1177 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 10/1187 variables, 14/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1187 variables, 10/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1187 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 12/1199 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1199 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 101/1300 variables, 63/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1300 variables, 23/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1300 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 1/1301 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1301 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 2/1303 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1303 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 104/1407 variables, 55/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1407 variables, 16/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1407 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 8/1415 variables, 10/1089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1415 variables, 8/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1415 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 12/1427 variables, 6/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1427 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 76/1503 variables, 49/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1503 variables, 17/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1503 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 88/1591 variables, 43/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1591 variables, 11/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1591 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 8/1599 variables, 10/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1599 variables, 8/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1599 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 12/1611 variables, 6/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1611 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 76/1687 variables, 49/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1687 variables, 17/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1687 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 88/1775 variables, 43/1356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1775 variables, 11/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1775 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 8/1783 variables, 10/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1783 variables, 8/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1783 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 12/1795 variables, 6/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1795 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 76/1871 variables, 49/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1871 variables, 17/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1871 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 88/1959 variables, 43/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1959 variables, 11/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1959 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 8/1967 variables, 10/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1967 variables, 8/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1967 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 12/1979 variables, 6/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1979 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 76/2055 variables, 49/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2055 variables, 17/1601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2055 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 82/2137 variables, 43/1644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2137 variables, 11/1655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2137 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 7/2144 variables, 10/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2144 variables, 7/1672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2144 variables, 0/1672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 8/2152 variables, 4/1676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/2152 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 43/2195 variables, 29/1705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2195 variables, 10/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2195 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 54/2249 variables, 27/1742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2249 variables, 7/1749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2249 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 4/2253 variables, 6/1755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2253 variables, 4/1759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2253 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 4/2257 variables, 2/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2257 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 28/2285 variables, 21/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2285 variables, 8/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2285 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 12/2297 variables, 6/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2297 variables, 1/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2297 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 1/2298 variables, 2/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2298 variables, 1/1800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2298 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 2/2300 variables, 2/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2300 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2300 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 0/2300 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1803 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1250/1250 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/92 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/172 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/177 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:57] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:57] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/187 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 110/297 variables, 57/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/297 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/297 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/304 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/318 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/318 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/318 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 167/485 variables, 92/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 27/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 10/495 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/495 variables, 10/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/495 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/515 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/515 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 170/685 variables, 100/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/685 variables, 30/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:58] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/685 variables, 8/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/685 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 6/691 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/691 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/691 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/699 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/699 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 163/862 variables, 92/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/862 variables, 26/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/862 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:20:59] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/862 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/862 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 10/872 variables, 14/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/872 variables, 10/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/872 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 12/884 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/884 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 128/1012 variables, 73/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1012 variables, 25/793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1012 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1012 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 4/1016 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1016 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1016 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 8/1024 variables, 4/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1024 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 153/1177 variables, 85/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1177 variables, 23/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:00] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:01] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1177 variables, 7/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1177 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 10/1187 variables, 14/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1187 variables, 10/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1187 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 12/1199 variables, 6/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1199 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 101/1300 variables, 63/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1300 variables, 23/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1300 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 1/1301 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1301 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1301 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 2/1303 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1303 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 104/1407 variables, 55/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1407 variables, 16/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1407 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 8/1415 variables, 10/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1415 variables, 8/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1415 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 12/1427 variables, 6/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1427 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 76/1503 variables, 49/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1503 variables, 17/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1503 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 88/1591 variables, 43/1244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1591 variables, 11/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1591 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 8/1599 variables, 10/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1599 variables, 8/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1599 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 12/1611 variables, 6/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1611 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 76/1687 variables, 49/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1687 variables, 17/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1687 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 88/1775 variables, 43/1388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1775 variables, 11/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:03] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:03] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:03] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 106 (INCLUDED_ONLY) 0/1775 variables, 4/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1775 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 8/1783 variables, 10/1413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1783 variables, 8/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1783 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 12/1795 variables, 6/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1795 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 76/1871 variables, 49/1476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1871 variables, 17/1493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1871 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 88/1959 variables, 43/1536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1959 variables, 11/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1959 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 8/1967 variables, 10/1557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1967 variables, 8/1565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1967 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 12/1979 variables, 6/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1979 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 76/2055 variables, 49/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2055 variables, 17/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2055 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 82/2137 variables, 43/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2137 variables, 11/1691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2137 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 7/2144 variables, 10/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/2144 variables, 7/1708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2144 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 8/2152 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2152 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 43/2195 variables, 29/1741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2195 variables, 10/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2195 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (OVERLAPS) 54/2249 variables, 27/1778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/2249 variables, 7/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2249 variables, 0/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 4/2253 variables, 6/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2253 variables, 4/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/2253 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 4/2257 variables, 2/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2257 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 28/2285 variables, 21/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/2285 variables, 8/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2285 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 12/2297 variables, 6/1832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2297 variables, 1/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/2297 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 1/2298 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2298 variables, 1/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2298 variables, 0/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 2/2300 variables, 2/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2300 variables, 1/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2300 variables, 0/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 0/2300 variables, 0/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1839 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10945 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1250/1250 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 30/30 constraints]
After SMT, in 14417ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 427 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1250/1250 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2025-06-07 23:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:21:09] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-06-07 23:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:21:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 23:21:10] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:21:10] [INFO ] Redundant transitions in 12 ms returned []
Running 1044 sub problems to find dead transitions.
[2025-06-07 23:21:10] [INFO ] Invariant cache hit.
[2025-06-07 23:21:10] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1246 variables, 535/535 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:30] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:31] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:32] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:32] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1246 variables, 20/555 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:33] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:34] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:35] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1246 variables, 20/575 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:39] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:40] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:40] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:40] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:40] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1246 variables, 20/595 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1246/2300 variables, and 595 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 535/548 constraints, State Equation: 0/1250 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1246 variables, 535/535 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1246 variables, 60/595 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:44] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:44] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:44] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:44] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:45] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:46] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1246 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:50] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:51] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:52] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1246 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:56] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:57] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:58] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:21:59] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1246 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:03] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:04] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:04] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:05] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:06] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:07] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:22:07] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1246 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1246/2300 variables, and 675 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 535/548 constraints, State Equation: 0/1250 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1044 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62132 ms. Remains : 1250/1250 places, 1050/1050 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 569 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 394 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:22:12] [INFO ] Computed 551 invariants in 11 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:22:19] [INFO ] [Real]Absence check using 551 positive place invariants in 4742 ms returned sat
[2025-06-07 23:22:27] [INFO ] [Real]Absence check using state equation in 8248 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 391 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1888 reset in 272 ms.
Product exploration explored 100000 steps with 1942 reset in 284 ms.
Applying partial POR strategy [false, true, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 372 ms :[(NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Performed 698 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3352 transition count 3002
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 698 place count 3352 transition count 3202
Deduced a syphon composed of 948 places in 7 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 948 place count 3352 transition count 3202
Performed 947 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1895 places in 6 ms
Iterating global reduction 1 with 947 rules applied. Total rules applied 1895 place count 3352 transition count 3203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1896 place count 3352 transition count 3202
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 2 with 349 rule applications. Total rules 2245 place count 3003 transition count 2853
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 349 rules applied. Total rules applied 2594 place count 3003 transition count 2853
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2595 place count 3003 transition count 2853
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2597 place count 3001 transition count 2851
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2599 place count 3001 transition count 2851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 1646 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2700 place count 3001 transition count 3278
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2802 place count 2899 transition count 3074
Deduced a syphon composed of 1544 places in 5 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2904 place count 2899 transition count 3074
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 1641 places in 4 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3001 place count 2899 transition count 3484
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 3098 place count 2802 transition count 3290
Deduced a syphon composed of 1544 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3195 place count 2802 transition count 3290
Deduced a syphon composed of 1544 places in 3 ms
Applied a total of 3195 rules in 2270 ms. Remains 2802 /3352 variables (removed 550) and now considering 3290/3002 (removed -288) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:22:31] [INFO ] Redundant transitions in 63 ms returned []
Running 3289 sub problems to find dead transitions.
// Phase 1: matrix 3290 rows 2802 cols
[2025-06-07 23:22:31] [INFO ] Computed 551 invariants in 37 ms
[2025-06-07 23:22:31] [INFO ] State equation strengthened by 345 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2801/6092 variables, and 0 constraints, problems are : Problem set: 0 solved, 3289 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/2802 constraints, ReadFeed: 0/345 constraints, PredecessorRefiner: 3289/2538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2801/6092 variables, and 0 constraints, problems are : Problem set: 0 solved, 3289 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/2802 constraints, ReadFeed: 0/345 constraints, PredecessorRefiner: 751/2538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62368ms problems are : Problem set: 0 solved, 3289 unsolved
Search for dead transitions found 0 dead transitions in 62373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/3352 places, 3290/3002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64721 ms. Remains : 2802/3352 places, 3290/3002 transitions.
Built C files in :
/tmp/ltsmin17245370832218016018
[2025-06-07 23:23:33] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17245370832218016018
Running compilation step : cd /tmp/ltsmin17245370832218016018;'/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/ltsmin17245370832218016018;'/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/ltsmin17245370832218016018;'/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 5 out of 3352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Applied a total of 0 rules in 298 ms. Remains 3352 /3352 variables (removed 0) and now considering 3002/3002 (removed 0) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:23:37] [INFO ] Computed 551 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:23:38] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2025-06-07 23:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:23:41] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 4193 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:23:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.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 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.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 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.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 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.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 1.0)
(s392 1.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 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.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 1.0)
(s421 1.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 1.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 1.0)
(s448 1.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 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 1.0)
(s489 1.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 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 1.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 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 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 1.0)
(s562 1.0)
(s563 1.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 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 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 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.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 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.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 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.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 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.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 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.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 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.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 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 1.0)
(s2422 1.0)
(s2423 1.0)
(s2424 1.0)
(s2425 1.0)
(s2426 1.0)
(s2427 1.0)
(s2428 1.0)
(s2429 1.0)
(s2430 1.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 1.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 1.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 1.0)
(s2450 1.0)
(s2451 1.0)
(s2452 1.0)
(s2453 1.0)
(s2454 1.0)
(s2455 1.0)
(s2456 1.0)
(s2457 1.0)
(s2458 1.0)
(s2459 1.0)
(s2460 1.0)
(s2461 1.0)
(s2462 1.0)
(s2463 1.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 1.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 1.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 1.0)
(s2486 1.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 1.0)
(s2497 1.0)
(s2498 1.0)
(s2499 1.0)
(s2500 1.0)
(s2501 1.0)
(s2502 1.0)
(s2503 1.0)
(s2504 1.0)
(s2505 1.0)
(s2506 1.0)
(s2507 1.0)
(s2508 1.0)
(s2509 1.0)
(s2510 1.0)
(s2511 1.0)
(s2512 1.0)
(s2513 1.0)
(s2514 1.0)
(s2515 1.0)
(s2516 1.0)
(s2517 1.0)
(s2518 1.0)
(s2519 1.0)
(s2520 1.0)
(s2521 1.0)
(s2522 1.0)
(s2523 1.0)
(s2524 1.0)
(s2525 1.0)
(s2526 1.0)
(s2527 1.0)
(s2528 1.0)
(s2529 1.0)
(s2530 1.0)
(s2531 1.0)
(s2532 1.0)
(s2533 1.0)
(s2534 1.0)
(s2535 1.0)
(s2536 1.0)
(s2537 1.0)
(s2538 1.0)
(s2539 1.0)
(s2540 1.0)
(s2541 1.0)
(s2542 1.0)
(s2543 1.0)
(s2544 1.0)
(s2545 1.0)
(s2546 1.0)
(s2547 1.0)
(s2548 1.0)
(s2549 1.0)
(s2550 1.0)
(s2551 1.0)
(s2552 1.0)
(s2553 1.0)
(s2554 1.0)
(s2555 1.0)
(s2556 1.0)
(s2557 1.0)
(s2558 1.0)
(s2559 1.0)
(s2560 1.0)
(s2561 1.0)
(s2562 1.0)
(s2563 1.0)
(s2564 1.0)
(s2565 1.0)
(s2566 1.0)
(s2567 1.0)
(s2568 1.0)
(s2569 1.0)
(s2570 1.0)
(s2571 1.0)
(s2572 1.0)
(s2573 1.0)
(s2574 1.0)
(s2575 1.0)
(s2576 1.0)
(s2577 1.0)
(s2578 1.0)
(s2579 1.0)
(s2580 1.0)
(s2581 1.0)
(s2582 1.0)
(s2583 1.0)
(s2584 1.0)
(s2585 1.0)
(s2586 1.0)
(s2587 1.0)
(s2588 1.0)
(s2589 1.0)
(s2590 1.0)
(s2591 1.0)
(s2592 1.0)
(s2593 1.0)
(s2594 1.0)
(s2595 1.0)
(s2596 1.0)
(s2597 1.0)
(s2598 1.0)
(s2599 1.0)
(s2600 1.0)
(s2601 1.0)
(s2602 1.0)
(s2603 1.0)
(s2604 1.0)
(s2605 1.0)
(s2606 1.0)
(s2607 1.0)
(s2608 1.0)
(s2609 1.0)
(s2610 1.0)
(s2611 1.0)
(s2612 1.0)
(s2613 1.0)
(s2614 1.0)
(s2615 1.0)
(s2616 1.0)
(s2617 1.0)
(s2618 1.0)
(s2619 1.0)
(s2620 1.0)
(s2621 1.0)
(s2622 1.0)
(s2623 1.0)
(s2624 1.0)
(s2625 1.0)
(s2626 1.0)
(s2627 1.0)
(s2628 1.0)
(s2629 1.0)
(s2630 1.0)
(s2631 1.0)
(s2632 1.0)
(s2633 1.0)
(s2634 1.0)
(s2635 1.0)
(s2636 1.0)
(s2637 1.0)
(s2638 1.0)
(s2639 1.0)
(s2640 1.0)
(s2641 1.0)
(s2642 1.0)
(s2643 1.0)
(s2644 1.0)
(s2645 1.0)
(s2646 1.0)
(s2647 1.0)
(s2648 1.0)
(s2649 1.0)
(s2650 1.0)
(s2651 1.0)
(s2652 1.0)
(s2653 1.0)
(s2654 1.0)
(s2655 1.0)
(s2656 1.0)
(s2657 1.0)
(s2658 1.0)
(s2659 1.0)
(s2660 1.0)
(s2661 1.0)
(s2662 1.0)
(s2663 1.0)
(s2664 1.0)
(s2665 1.0)
(s2666 1.0)
(s2667 1.0)
(s2668 1.0)
(s2669 1.0)
(s2670 1.0)
(s2671 1.0)
(s2672 1.0)
(s2673 1.0)
(s2674 1.0)
(s2675 1.0)
(s2676 1.0)
(s2677 1.0)
(s2678 1.0)
(s2679 1.0)
(s2680 1.0)
(s2681 1.0)
(s2682 1.0)
(s2683 1.0)
(s2684 1.0)
(s2685 1.0)
(s2686 1.0)
(s2687 1.0)
(s2688 1.0)
(s2689 1.0)
(s2690 1.0)
(s2691 1.0)
(s2692 1.0)
(s2693 1.0)
(s2694 1.0)
(s2695 1.0)
(s2696 1.0)
(s2697 1.0)
(s2698 1.0)
(s2699 1.0)
(s2700 1.0)
(s2701 1.0)
(s2702 1.0)
(s2703 1.0)
(s2704 1.0)
(s2705 1.0)
(s2706 1.0)
(s2707 1.0)
(s2708 1.0)
(s2709 1.0)
(s2710 1.0)
(s2711 1.0)
(s2712 1.0)
(s2713 1.0)
(s2714 1.0)
(s2715 1.0)
(s2716 1.0)
(s2717 1.0)
(s2718 1.0)
(s2719 1.0)
(s2720 1.0)
(s2721 1.0)
(s2722 1.0)
(s2723 1.0)
(s2724 1.0)
(s2725 1.0)
(s2726 1.0)
(s2727 1.0)
(s2728 1.0)
(s2729 1.0)
(s2730 1.0)
(s2731 1.0)
(s2732 1.0)
(s2733 1.0)
(s2734 1.0)
(s2735 1.0)
(s2736 1.0)
(s2737 1.0)
(s2738 1.0)
(s2739 1.0)
(s2740 1.0)
(s2741 1.0)
(s2742 1.0)
(s2743 1.0)
(s2744 1.0)
(s2745 1.0)
(s2746 1.0)
(s2747 1.0)
(s2748 1.0)
(s2749 1.0)
(s2750 1.0)
(s2751 1.0)
(s2752 1.0)
(s2753 1.0)
(s2754 1.0)
(s2755 1.0)
(s2756 1.0)
(s2757 1.0)
(s2758 1.0)
(s2759 1.0)
(s2760 1.0)
(s2761 1.0)
(s2762 1.0)
(s2763 1.0)
(s2764 1.0)
(s2765 1.0)
(s2766 1.0)
(s2767 1.0)
(s2768 1.0)
(s2769 1.0)
(s2770 1.0)
(s2771 1.0)
(s2772 1.0)
(s2773 1.0)
(s2774 1.0)
(s2775 1.0)
(s2776 1.0)
(s2777 1.0)
(s2778 1.0)
(s2779 1.0)
(s2780 1.0)
(s2781 1.0)
(s2782 1.0)
(s2783 1.0)
(s2784 1.0)
(s2785 1.0)
(s2786 1.0)
(s2787 1.0)
(s2788 1.0)
(s2789 1.0)
(s2790 1.0)
(s2791 1.0)
(s2792 1.0)
(s2793 1.0)
(s2794 1.0)
(s2795 1.0)
(s2796 1.0)
(s2797 1.0)
(s2798 1.0)
(s2799 1.0)
(s2800 1.0)
(s2801 1.0)
(s2802 1.0)
(s2803 1.0)
(s2804 1.0)
(s2805 1.0)
(s2806 1.0)
(s2807 1.0)
(s2808 1.0)
(s2809 1.0)
(s2810 1.0)
(s2811 1.0)
(s2812 1.0)
(s2813 1.0)
(s2814 1.0)
(s2815 1.0)
(s2816 1.0)
(s2817 1.0)
(s2818 1.0)
(s2819 1.0)
(s2820 1.0)
(s2821 1.0)
(s2822 1.0)
(s2823 1.0)
(s2824 1.0)
(s2825 1.0)
(s2826 1.0)
(s2827 1.0)
(s2828 1.0)
(s2829 1.0)
(s2830 1.0)
(s2831 1.0)
(s2832 1.0)
(s2833 1.0)
(s2834 1.0)
(s2835 1.0)
(s2836 1.0)
(s2837 1.0)
(s2838 1.0)
(s2839 1.0)
(s2840 1.0)
(s2841 1.0)
(s2842 1.0)
(s2843 1.0)
(s2844 1.0)
(s2845 1.0)
(s2846 1.0)
(s2847 1.0)
(s2848 1.0)
(s2849 1.0)
(s2850 1.0)
(s2851 1.0)
(s2852 1.0)
(s2853 1.0)
(s2854 1.0)
(s2855 1.0)
(s2856 1.0)
(s2857 1.0)
(s2858 1.0)
(s2859 1.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)
(s2940 1.0)
(s2941 1.0)
(s2942 1.0)
(s2943 1.0)
(s2944 1.0)
(s2945 1.0)
(s2946 1.0)
(s2947 1.0)
(s2948 1.0)
(s2949 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60843ms
Finished structural reductions in LTL mode , in 1 iterations and 65344 ms. Remains : 3352/3352 places, 3002/3002 transitions.
Built C files in :
/tmp/ltsmin8588768804245028402
[2025-06-07 23:24:42] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8588768804245028402
Running compilation step : cd /tmp/ltsmin8588768804245028402;'/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/ltsmin8588768804245028402;'/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/ltsmin8588768804245028402;'/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-07 23:24:45] [INFO ] Flatten gal took : 64 ms
[2025-06-07 23:24:45] [INFO ] Flatten gal took : 64 ms
[2025-06-07 23:24:45] [INFO ] Time to serialize gal into /tmp/LTL9080877288017644574.gal : 11 ms
[2025-06-07 23:24:45] [INFO ] Time to serialize properties into /tmp/LTL14001096540011955815.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/LTL9080877288017644574.gal' '-t' 'CGAL' '-hoa' '/tmp/aut73171141608140192.hoa' '-atoms' '/tmp/LTL14001096540011955815.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...316
Loading property file /tmp/LTL14001096540011955815.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut73171141608140192.hoa
Detected timeout of ITS tools.
[2025-06-07 23:25:00] [INFO ] Flatten gal took : 59 ms
[2025-06-07 23:25:00] [INFO ] Flatten gal took : 55 ms
[2025-06-07 23:25:00] [INFO ] Time to serialize gal into /tmp/LTL3698418099097553314.gal : 10 ms
[2025-06-07 23:25:00] [INFO ] Time to serialize properties into /tmp/LTL300497018523734014.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/LTL3698418099097553314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL300497018523734014.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...274
Read 1 LTL properties
Checking formula 0 : !((((F("(p3572==1)"))U("(p2941==1)"))U((("(p2941==1)")U("((p153==1)&&(p205==1))"))U(X("(p1725==1)")))))
Formula 0 simplified : (G!"(p3572==1)" R !"(p2941==1)") R ((!"(p2941==1)" R !"((p153==1)&&(p205==1))") R X!"(p1725==1)")
Detected timeout of ITS tools.
[2025-06-07 23:25:15] [INFO ] Flatten gal took : 52 ms
[2025-06-07 23:25:15] [INFO ] Applying decomposition
[2025-06-07 23:25:15] [INFO ] Flatten gal took : 51 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/graph15493113204768665371.txt' '-o' '/tmp/graph15493113204768665371.bin' '-w' '/tmp/graph15493113204768665371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15493113204768665371.bin' '-l' '-1' '-v' '-w' '/tmp/graph15493113204768665371.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:25:16] [INFO ] Decomposing Gal with order
[2025-06-07 23:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:25:16] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-07 23:25:16] [INFO ] Flatten gal took : 118 ms
[2025-06-07 23:25:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-07 23:25:16] [INFO ] Time to serialize gal into /tmp/LTL6309045944096474144.gal : 25 ms
[2025-06-07 23:25:16] [INFO ] Time to serialize properties into /tmp/LTL9922482646745089298.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/LTL6309045944096474144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9922482646745089298.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 : !((((F("(i44.i0.i2.u1106.p3572==1)"))U("(i36.i0.i1.u908.p2941==1)"))U((("(i36.i0.i1.u908.p2941==1)")U("((i4.i1.i3.u54.p153==1)&&(i4.i1...204
Formula 0 simplified : (G!"(i44.i0.i2.u1106.p3572==1)" R !"(i36.i0.i1.u908.p2941==1)") R ((!"(i36.i0.i1.u908.p2941==1)" R !"((i4.i1.i3.u54.p153==1)&&(i4.i1...200
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 606139 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&&G((F(p2)&&p1)))))'
Support contains 5 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3358 transition count 2308
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2658 transition count 2308
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1400 place count 2658 transition count 1915
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 2186 place count 2265 transition count 1915
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2191 place count 2260 transition count 1910
Iterating global reduction 2 with 5 rules applied. Total rules applied 2196 place count 2260 transition count 1910
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2196 place count 2260 transition count 1905
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2255 transition count 1905
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3900 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3901 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3903 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4105 place count 1306 transition count 1056
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4199 place count 1259 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4201 place count 1257 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4202 place count 1256 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4202 place count 1256 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4206 place count 1254 transition count 1052
Applied a total of 4206 rules in 662 ms. Remains 1254 /3359 variables (removed 2105) and now considering 1052/3009 (removed 1957) transitions.
// Phase 1: matrix 1052 rows 1254 cols
[2025-06-07 23:25:32] [INFO ] Computed 550 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:32] [INFO ] Implicit Places using invariants in 586 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 587 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/3359 places, 1052/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1250 transition count 1050
Applied a total of 4 rules in 59 ms. Remains 1250 /1252 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1250 cols
[2025-06-07 23:25:33] [INFO ] Computed 548 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:33] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-06-07 23:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 23:25:34] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1250/3359 places, 1050/3009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3035 ms. Remains : 1250/3359 places, 1050/3009 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 774 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 2 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-06 finished in 3965 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)))'
Support contains 1 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3358 transition count 2308
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 2658 transition count 2307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 2657 transition count 2307
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1402 place count 2657 transition count 1912
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2192 place count 2262 transition count 1912
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2197 place count 2257 transition count 1907
Iterating global reduction 3 with 5 rules applied. Total rules applied 2202 place count 2257 transition count 1907
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2202 place count 2257 transition count 1902
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2212 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 2 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3910 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3911 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3913 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4115 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4209 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4211 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4212 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4212 place count 1251 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4216 place count 1249 transition count 1047
Applied a total of 4216 rules in 626 ms. Remains 1249 /3359 variables (removed 2110) and now considering 1047/3009 (removed 1962) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2025-06-07 23:25:36] [INFO ] Computed 550 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:36] [INFO ] Implicit Places using invariants in 586 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 588 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3359 places, 1047/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1045
Applied a total of 4 rules in 56 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2025-06-07 23:25:36] [INFO ] Computed 548 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:37] [INFO ] Implicit Places using invariants in 568 ms returned []
[2025-06-07 23:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:38] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3359 places, 1045/3009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2979 ms. Remains : 1245/3359 places, 1045/3009 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 743 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-07 finished in 3809 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((X(X(p0))||F((G(p1)&&X(F(p2)))))))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3353 transition count 3003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3353 transition count 3003
Applied a total of 12 rules in 650 ms. Remains 3353 /3359 variables (removed 6) and now considering 3003/3009 (removed 6) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2025-06-07 23:25:40] [INFO ] Computed 551 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:41] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2025-06-07 23:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:25:44] [INFO ] Implicit Places using invariants and state equation in 2996 ms returned []
Implicit Place search using SMT with State Equation took 4110 ms to find 0 implicit places.
Running 3002 sub problems to find dead transitions.
[2025-06-07 23:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.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 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.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 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.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 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.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 1.0)
(s392 1.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 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.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 1.0)
(s421 1.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 1.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 1.0)
(s448 1.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 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 1.0)
(s489 1.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 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 1.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 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 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 1.0)
(s562 1.0)
(s563 1.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 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 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 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.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 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.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 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.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 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.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 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)timeout
(s695 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 3002/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3002 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 0/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 3002 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Starting structural reductions in LTL mode, iteration 1 : 3353/3359 places, 3003/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65549 ms. Remains : 3353/3359 places, 3003/3009 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 796 ms.
Product exploration explored 100000 steps with 2 reset in 1015 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/3353 stabilizing places and 799/3003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 260 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 31248 steps (6 resets) in 267 ms. (116 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 842 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 3 out of 3353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3353/3353 places, 3003/3003 transitions.
Applied a total of 0 rules in 316 ms. Remains 3353 /3353 variables (removed 0) and now considering 3003/3003 (removed 0) transitions.
[2025-06-07 23:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:26:51] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2025-06-07 23:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:26:54] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 4096 ms to find 0 implicit places.
Running 3002 sub problems to find dead transitions.
[2025-06-07 23:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 3002/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3002 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 0/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60771ms problems are : Problem set: 0 solved, 3002 unsolved
Search for dead transitions found 0 dead transitions in 60776ms
Finished structural reductions in LTL mode , in 1 iterations and 65195 ms. Remains : 3353/3353 places, 3003/3003 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/3353 stabilizing places and 799/3003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 262 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 22762 steps (4 resets) in 202 ms. (112 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 831 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 758 ms.
Product exploration explored 100000 steps with 0 reset in 1040 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 3 out of 3353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3353/3353 places, 3003/3003 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3353 transition count 3003
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 249 Pre rules applied. Total rules applied 699 place count 3353 transition count 3201
Deduced a syphon composed of 948 places in 5 ms
Iterating global reduction 1 with 249 rules applied. Total rules applied 948 place count 3353 transition count 3201
Performed 949 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 1 with 949 rules applied. Total rules applied 1897 place count 3353 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1898 place count 3353 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2250 place count 3001 transition count 2848
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2602 place count 3001 transition count 2848
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2603 place count 3001 transition count 2848
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2605 place count 2999 transition count 2846
Deduced a syphon composed of 1544 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2607 place count 2999 transition count 2846
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1645 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2708 place count 2999 transition count 3274
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2809 place count 2898 transition count 3072
Deduced a syphon composed of 1544 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2910 place count 2898 transition count 3072
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 1641 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3007 place count 2898 transition count 3482
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 3104 place count 2801 transition count 3288
Deduced a syphon composed of 1544 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3201 place count 2801 transition count 3288
Deduced a syphon composed of 1544 places in 4 ms
Applied a total of 3201 rules in 1671 ms. Remains 2801 /3353 variables (removed 552) and now considering 3288/3003 (removed -285) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:28:01] [INFO ] Redundant transitions in 60 ms returned []
Running 3287 sub problems to find dead transitions.
// Phase 1: matrix 3288 rows 2801 cols
[2025-06-07 23:28:01] [INFO ] Computed 551 invariants in 36 ms
[2025-06-07 23:28:01] [INFO ] State equation strengthened by 348 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2800/6089 variables, and 0 constraints, problems are : Problem set: 0 solved, 3287 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/2801 constraints, ReadFeed: 0/348 constraints, PredecessorRefiner: 3287/2546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3287 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2800/6089 variables, and 0 constraints, problems are : Problem set: 0 solved, 3287 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/2801 constraints, ReadFeed: 0/348 constraints, PredecessorRefiner: 741/2546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62310ms problems are : Problem set: 0 solved, 3287 unsolved
Search for dead transitions found 0 dead transitions in 62314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2801/3353 places, 3288/3003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64055 ms. Remains : 2801/3353 places, 3288/3003 transitions.
Built C files in :
/tmp/ltsmin6135451563573542631
[2025-06-07 23:29:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6135451563573542631
Running compilation step : cd /tmp/ltsmin6135451563573542631;'/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/ltsmin6135451563573542631;'/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/ltsmin6135451563573542631;'/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 3 out of 3353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3353/3353 places, 3003/3003 transitions.
Applied a total of 0 rules in 324 ms. Remains 3353 /3353 variables (removed 0) and now considering 3003/3003 (removed 0) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2025-06-07 23:29:07] [INFO ] Computed 551 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:29:08] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2025-06-07 23:29:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:29:11] [INFO ] Implicit Places using invariants and state equation in 3044 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
Running 3002 sub problems to find dead transitions.
[2025-06-07 23:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.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 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.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 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.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 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.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 1.0)
(s392 1.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 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.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 1.0)
(s421 1.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 1.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 1.0)
(s448 1.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 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 1.0)
(s489 1.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 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 1.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 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 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 1.0)
(s562 1.0)
(s563 1.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 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 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 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.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 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.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 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.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 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.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 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.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 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.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 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 3002/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3002 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/6356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3002 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3353 constraints, PredecessorRefiner: 0/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60820ms problems are : Problem set: 0 solved, 3002 unsolved
Search for dead transitions found 0 dead transitions in 60824ms
Finished structural reductions in LTL mode , in 1 iterations and 65385 ms. Remains : 3353/3353 places, 3003/3003 transitions.
Built C files in :
/tmp/ltsmin12629432208105342361
[2025-06-07 23:30:12] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12629432208105342361
Running compilation step : cd /tmp/ltsmin12629432208105342361;'/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/ltsmin12629432208105342361;'/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/ltsmin12629432208105342361;'/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-07 23:30:15] [INFO ] Flatten gal took : 53 ms
[2025-06-07 23:30:15] [INFO ] Flatten gal took : 54 ms
[2025-06-07 23:30:15] [INFO ] Time to serialize gal into /tmp/LTL11305151187243424243.gal : 10 ms
[2025-06-07 23:30:15] [INFO ] Time to serialize properties into /tmp/LTL10550120955772086632.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/LTL11305151187243424243.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8769537392460458291.hoa' '-atoms' '/tmp/LTL10550120955772086632.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/LTL10550120955772086632.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8769537392460458291.hoa
Detected timeout of ITS tools.
[2025-06-07 23:30:30] [INFO ] Flatten gal took : 54 ms
[2025-06-07 23:30:30] [INFO ] Flatten gal took : 53 ms
[2025-06-07 23:30:30] [INFO ] Time to serialize gal into /tmp/LTL5254585472562419409.gal : 10 ms
[2025-06-07 23:30:30] [INFO ] Time to serialize properties into /tmp/LTL974154990496814313.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/LTL5254585472562419409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL974154990496814313.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...274
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(p3355==1)")))||(F((G("(p2135==0)"))&&(X(F("(p887==0)"))))))))
Formula 0 simplified : F(XX!"(p3355==1)" & G(F!"(p2135==0)" | XG!"(p887==0)"))
Detected timeout of ITS tools.
[2025-06-07 23:30:45] [INFO ] Flatten gal took : 53 ms
[2025-06-07 23:30:45] [INFO ] Applying decomposition
[2025-06-07 23:30:45] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13157562943575593787.txt' '-o' '/tmp/graph13157562943575593787.bin' '-w' '/tmp/graph13157562943575593787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13157562943575593787.bin' '-l' '-1' '-v' '-w' '/tmp/graph13157562943575593787.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:30:46] [INFO ] Decomposing Gal with order
[2025-06-07 23:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:30:46] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-07 23:30:46] [INFO ] Flatten gal took : 103 ms
[2025-06-07 23:30:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-07 23:30:46] [INFO ] Time to serialize gal into /tmp/LTL4034294599557309230.gal : 24 ms
[2025-06-07 23:30:46] [INFO ] Time to serialize properties into /tmp/LTL218172881396897379.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/LTL4034294599557309230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL218172881396897379.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...253
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(i42.u1032.p3355==1)")))||(F((G("(i27.u660.p2135==0)"))&&(X(F("(i10.u279.p887==0)"))))))))
Formula 0 simplified : F(XX!"(i42.u1032.p3355==1)" & G(F!"(i27.u660.p2135==0)" | XG!"(i10.u279.p887==0)"))
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-10 finished in 322193 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((G(p1)||(F(p2)&&F(p3))))&&p0)))'
Support contains 6 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3351 transition count 3001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3351 transition count 3001
Applied a total of 16 rules in 653 ms. Remains 3351 /3359 variables (removed 8) and now considering 3001/3009 (removed 8) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2025-06-07 23:31:02] [INFO ] Computed 551 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:31:03] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2025-06-07 23:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:31:06] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned []
Implicit Place search using SMT with State Equation took 4259 ms to find 0 implicit places.
Running 3000 sub problems to find dead transitions.
[2025-06-07 23:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3350/6352 variables, and 0 constraints, problems are : Problem set: 0 solved, 3000 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3351 constraints, PredecessorRefiner: 3000/3000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3000 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3350/6352 variables, and 0 constraints, problems are : Problem set: 0 solved, 3000 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3351 constraints, PredecessorRefiner: 0/3000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 3000 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Starting structural reductions in LTL mode, iteration 1 : 3351/3359 places, 3001/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65702 ms. Remains : 3351/3359 places, 3001/3009 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-11 finished in 65972 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((F(p0)&&X(G(p1)))) U X(p2)))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 622 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:32:08] [INFO ] Computed 551 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:32:09] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2025-06-07 23:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:32:12] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 4173 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60770ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60774ms
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65577 ms. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 719 ms.
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 67353 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&&(p1||G(p2))))))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 3358 transition count 2307
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 2657 transition count 2307
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1402 place count 2657 transition count 1912
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2192 place count 2262 transition count 1912
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2196 place count 2258 transition count 1908
Iterating global reduction 2 with 4 rules applied. Total rules applied 2200 place count 2258 transition count 1908
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2200 place count 2258 transition count 1904
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2208 place count 2254 transition count 1904
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3904 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3905 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3907 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4109 place count 1304 transition count 1054
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4203 place count 1257 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4205 place count 1255 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4206 place count 1254 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4206 place count 1254 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4210 place count 1252 transition count 1050
Applied a total of 4210 rules in 615 ms. Remains 1252 /3359 variables (removed 2107) and now considering 1050/3009 (removed 1959) transitions.
// Phase 1: matrix 1050 rows 1252 cols
[2025-06-07 23:33:15] [INFO ] Computed 550 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:33:16] [INFO ] Implicit Places using invariants in 587 ms returned [1235, 1239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 589 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/3359 places, 1050/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 1048
Applied a total of 4 rules in 64 ms. Remains 1248 /1250 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1248 cols
[2025-06-07 23:33:16] [INFO ] Computed 548 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:33:16] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-06-07 23:33:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:33:17] [INFO ] State equation strengthened by 187 read => feed constraints.
[2025-06-07 23:33:20] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1248/3359 places, 1048/3009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5415 ms. Remains : 1248/3359 places, 1048/3009 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 765 ms.
Stack based approach found an accepted trace after 1218 steps with 0 reset with depth 1219 and stack size 1219 in 13 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 6300 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((p0&&X(X(G(p1))))))))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 648 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2025-06-07 23:33:21] [INFO ] Computed 551 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:33:23] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2025-06-07 23:33:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:33:26] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
Running 3001 sub problems to find dead transitions.
[2025-06-07 23:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 3001/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3001 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 timeout
1)
(s737 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/6354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3001 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3352 constraints, PredecessorRefiner: 0/3001 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60772ms problems are : Problem set: 0 solved, 3001 unsolved
Search for dead transitions found 0 dead transitions in 60778ms
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65691 ms. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 65998 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) U p1) U ((p1 U p2) U X(p3))))'
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((X(X(p0))||F((G(p1)&&X(F(p2)))))))'
[2025-06-07 23:34:27] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9324667415100182214
[2025-06-07 23:34:27] [INFO ] Too many transitions (3009) to apply POR reductions. Disabling POR matrices.
[2025-06-07 23:34:27] [INFO ] Applying decomposition
[2025-06-07 23:34:27] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9324667415100182214
Running compilation step : cd /tmp/ltsmin9324667415100182214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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-07 23:34:27] [INFO ] Flatten gal took : 55 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/graph286067521995052205.txt' '-o' '/tmp/graph286067521995052205.bin' '-w' '/tmp/graph286067521995052205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph286067521995052205.bin' '-l' '-1' '-v' '-w' '/tmp/graph286067521995052205.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:34:27] [INFO ] Decomposing Gal with order
[2025-06-07 23:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:34:28] [INFO ] Removed a total of 495 redundant transitions.
[2025-06-07 23:34:28] [INFO ] Flatten gal took : 99 ms
[2025-06-07 23:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-07 23:34:28] [INFO ] Time to serialize gal into /tmp/LTLFireability456171957143610162.gal : 23 ms
[2025-06-07 23:34:28] [INFO ] Time to serialize properties into /tmp/LTLFireability3090160251331204322.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/LTLFireability456171957143610162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3090160251331204322.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...275
Read 2 LTL properties
Checking formula 0 : !((((F("(i45.u1105.p3572==1)"))U("(i37.u907.p2941==1)"))U((("(i37.u907.p2941==1)")U("((i3.u52.p153==1)&&(i3.u66.p205==1))"))U(X("(i22....175
Formula 0 simplified : (G!"(i45.u1105.p3572==1)" R !"(i37.u907.p2941==1)") R ((!"(i37.u907.p2941==1)" R !"((i3.u52.p153==1)&&(i3.u66.p205==1))") R X!"(i22....171
Compilation finished in 7287 ms.
Running link step : cd /tmp/ltsmin9324667415100182214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin9324667415100182214;'/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' '((<>((LTLAPp0==true)) U (LTLAPp1==true)) U (((LTLAPp1==true) U (LTLAPp2==true)) U X((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 8439 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9324667415100182214;'/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((LTLAPp4==true)))||<>(([]((LTLAPp5==true))&&X(<>((LTLAPp6==true)))))))' '--buchi-type=spotba'
LTSmin run took 5582 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1614236 ms.
BK_STOP 1749339289136
--------------------
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r198-tall-174894533700932"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 ;