About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 722650.00 | 0.00 | 0.00 | 1 1 10 5 0 1 2 1 2 1 1 1 1 2 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700293.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 PolyORBLF-COL-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700293
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748915867951
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-03 01:57:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 01:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:57:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 01:57:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 01:57:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 608 ms
[2025-06-03 01:57:49] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-03 01:57:49] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2025-06-03 01:57:49] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 01:57:49] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 10, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 10, 6, 3, 1, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 01:57:49] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 01:57:49] [INFO ] Computed 26 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-03 01:57:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 01:57:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 01:57:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:50] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 11 ms to minimize.
[2025-06-03 01:57:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-03 01:57:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 01:57:50] [INFO ] Added : 25 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 41 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-03 01:57:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 01:57:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 22 ms.
[2025-06-03 01:57:50] [INFO ] Added : 1 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-03 01:57:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-03 01:57:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
[2025-06-03 01:57:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-03 01:57:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 01:57:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 01:57:51] [INFO ] Added : 47 causal constraints over 10 iterations in 142 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 32 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 01:57:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 01:57:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-03 01:57:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 01:57:51] [INFO ] Added : 54 causal constraints over 11 iterations in 151 ms. Result :sat
Minimization took 63 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 01:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 4 ms to minimize.
[2025-06-03 01:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-03 01:57:52] [INFO ] Added : 57 causal constraints over 12 iterations in 158 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 01:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 01:57:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 01:57:52] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 01:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 01:57:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:52] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 4 ms to minimize.
[2025-06-03 01:57:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2025-06-03 01:57:52] [INFO ] Added : 56 causal constraints over 12 iterations in 220 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 01:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-03 01:57:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 01:57:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 01:57:52] [INFO ] Added : 23 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-03 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-03 01:57:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 01:57:53] [INFO ] Added : 60 causal constraints over 12 iterations in 78 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 01:57:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 01:57:53] [INFO ] Added : 54 causal constraints over 11 iterations in 83 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 01:57:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 01:57:53] [INFO ] Added : 7 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 01:57:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 01:57:53] [INFO ] Added : 26 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 01:57:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 01:57:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 01:57:53] [INFO ] Added : 34 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 5, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 01:57:54] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 33 ms.
[2025-06-03 01:57:54] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
[2025-06-03 01:57:54] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2025-06-03 01:57:54] [INFO ] Computed 50 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 3, 2, 6, 2, 1, 1, 6, 1, 2, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 79 ms. (125 steps per ms)
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 186 ms. (213 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1] Max Struct:[6, 3, 6, 6]
[2025-06-03 01:57:54] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:54] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-03 01:57:54] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:54] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-03 01:57:54] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 17 ms returned sat
[2025-06-03 01:57:54] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-03 01:57:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:57:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-03 01:57:55] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 17 ms returned sat
[2025-06-03 01:57:56] [INFO ] [Nat]Absence check using state equation in 1253 ms returned sat
[2025-06-03 01:57:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:57:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 227 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:56] [INFO ] Deduced a trap composed of 73 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-03 01:57:56] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 3 ms to minimize.
[2025-06-03 01:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2025-06-03 01:57:56] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 60 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:59] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:59] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 11 ms to minimize.
[2025-06-03 01:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 284 ms
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:58:00] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2025-06-03 01:58:00] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 22 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 01:58:00] [INFO ] [Real]Absence check using 17 positive place invariants in 51 ms returned sat
[2025-06-03 01:58:00] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1] Max Struct:[1, 3, 1, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 480 transition count 854
Deduced a syphon composed of 60 places in 6 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 326 place count 372 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 372 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 350 place count 360 transition count 794
Applied a total of 350 rules in 247 ms. Remains 360 /536 variables (removed 176) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2025-06-03 01:58:00] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 360 cols
[2025-06-03 01:58:00] [INFO ] Computed 48 invariants in 18 ms
[2025-06-03 01:58:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 44 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-03 01:58:08] [INFO ] Deduced a trap composed of 44 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-03 01:58:08] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 119 places in 222 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:09] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:10] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:11] [INFO ] Deduced a trap composed of 204 places in 205 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:15] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:16] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:16] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:17] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1142 variables, and 60 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1142 variables, and 60 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40945ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 40962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41243 ms. Remains : 360/536 places, 794/968 transitions.
[2025-06-03 01:58:41] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2025-06-03 01:58:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (567 resets) in 3119 ms. (320 steps per ms)
BEST_FIRST walk for 1000001 steps (240 resets) in 1563 ms. (639 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 01:58:46] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2025-06-03 01:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 01:58:46] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-03 01:58:46] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 14 ms returned sat
[2025-06-03 01:58:46] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-06-03 01:58:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 01:58:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-03 01:58:46] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 15 ms returned sat
[2025-06-03 01:58:47] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2025-06-03 01:58:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:58:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 873 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:48] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:48] [INFO ] Deduced a trap composed of 113 places in 207 ms of which 46 ms to minimize.
[2025-06-03 01:58:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2025-06-03 01:58:48] [INFO ] Computed and/alt/rep : 414/1918/408 causal constraints (skipped 372 transitions) in 52 ms.
[2025-06-03 01:58:50] [INFO ] Added : 92 causal constraints over 19 iterations in 2041 ms. Result :sat
Minimization took 2860 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 19 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 360/360 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 01:58:54] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2025-06-03 01:58:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:58:55] [INFO ] Implicit Places using invariants in 1192 ms returned [324, 325, 326, 327, 328, 329]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1195 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/360 places, 794/794 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 348 transition count 788
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 348 transition count 788
Applied a total of 12 rules in 27 ms. Remains 348 /354 variables (removed 6) and now considering 788/794 (removed 6) transitions.
[2025-06-03 01:58:55] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
// Phase 1: matrix 776 rows 348 cols
[2025-06-03 01:58:55] [INFO ] Computed 42 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:58:56] [INFO ] Implicit Places using invariants in 1311 ms returned []
[2025-06-03 01:58:56] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:58:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:58:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:59:01] [INFO ] Implicit Places using invariants and state equation in 5063 ms returned []
Implicit Place search using SMT with State Equation took 6376 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/360 places, 788/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7616 ms. Remains : 348/360 places, 788/794 transitions.
[2025-06-03 01:59:01] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:59:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (545 resets) in 2842 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (241 resets) in 1413 ms. (707 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 01:59:06] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:59:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 01:59:06] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-03 01:59:06] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-03 01:59:06] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-03 01:59:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 01:59:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-03 01:59:06] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-03 01:59:06] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-06-03 01:59:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:59:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 552 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:07] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:07] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 45 ms to minimize.
[2025-06-03 01:59:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2025-06-03 01:59:08] [INFO ] Computed and/alt/rep : 408/1911/402 causal constraints (skipped 372 transitions) in 49 ms.
[2025-06-03 01:59:10] [INFO ] Added : 68 causal constraints over 14 iterations in 2455 ms. Result :sat
Minimization took 4508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 24 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 348/348 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-06-03 01:59:15] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:59:16] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2025-06-03 01:59:16] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:59:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:59:21] [INFO ] Implicit Places using invariants and state equation in 5048 ms returned []
Implicit Place search using SMT with State Equation took 6170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:59:21] [INFO ] Redundant transitions in 44 ms returned []
Running 786 sub problems to find dead transitions.
[2025-06-03 01:59:21] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:59:21] [INFO ] Invariant cache hit.
[2025-06-03 01:59:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:27] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:28] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:28] [INFO ] Deduced a trap composed of 44 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-03 01:59:28] [INFO ] Deduced a trap composed of 44 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-03 01:59:28] [INFO ] Deduced a trap composed of 44 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-03 01:59:28] [INFO ] Deduced a trap composed of 119 places in 217 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:28] [INFO ] Deduced a trap composed of 124 places in 214 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:29] [INFO ] Deduced a trap composed of 44 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-03 01:59:31] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:35] [INFO ] Deduced a trap composed of 113 places in 191 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:35] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:35] [INFO ] Deduced a trap composed of 109 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:35] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:36] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:39] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 9)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 timeout
0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66727 ms. Remains : 348/348 places, 788/788 transitions.
RANDOM walk for 40000 steps (29 resets) in 698 ms. (57 steps per ms) remains 2/2 properties
[2025-06-03 02:00:22] [INFO ] Flatten gal took : 170 ms
BEST_FIRST walk for 40002 steps (13 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
[2025-06-03 02:00:22] [INFO ] Flatten gal took : 91 ms
[2025-06-03 02:00:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4878187535080714208.gal : 39 ms
[2025-06-03 02:00:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7886754169209289986.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4878187535080714208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7886754169209289986.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7886754169209289986.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 180
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :180 after 470
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :470 after 712
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :712 after 1662
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1662 after 5066
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5066 after 14862
Interrupted probabilistic random walk after 294403 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 294403 steps, saw 143272 distinct states, run finished after 3004 ms. (steps per millisecond=98 ) properties seen :0
[2025-06-03 02:00:25] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:00:25] [INFO ] Invariant cache hit.
[2025-06-03 02:00:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:25] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:25] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:25] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:25] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1124 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1122 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1124 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:28] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:28] [INFO ] Deduced a trap composed of 124 places in 225 ms of which 47 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1124 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1124 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 470 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3400ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 20 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Running 786 sub problems to find dead transitions.
[2025-06-03 02:00:28] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:00:28] [INFO ] Invariant cache hit.
[2025-06-03 02:00:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 34280
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :34280 after 78606
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:35] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:35] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:35] [INFO ] Deduced a trap composed of 44 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-03 02:00:35] [INFO ] Deduced a trap composed of 44 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-03 02:00:35] [INFO ] Deduced a trap composed of 44 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-03 02:00:36] [INFO ] Deduced a trap composed of 119 places in 223 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:36] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:37] [INFO ] Deduced a trap composed of 44 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-03 02:00:38] [INFO ] Deduced a trap composed of 204 places in 211 ms of which 49 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :78606 after 407480
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:43] [INFO ] Deduced a trap composed of 113 places in 207 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:43] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:43] [INFO ] Deduced a trap composed of 109 places in 208 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:43] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:44] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:48] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :407480 after 1.16242e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40667ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 40671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40693 ms. Remains : 348/348 places, 788/788 transitions.
RANDOM walk for 40000 steps (26 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-03 02:01:12] [INFO ] Flatten gal took : 71 ms
[2025-06-03 02:01:12] [INFO ] Applying decomposition
[2025-06-03 02:01:12] [INFO ] Flatten gal took : 52 ms
Interrupted probabilistic random walk after 298117 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298117 steps, saw 145019 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-06-03 02:01:12] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:01:12] [INFO ] Invariant cache hit.
[2025-06-03 02:01:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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/graph5073378223713852901.txt' '-o' '/tmp/graph5073378223713852901.bin' '-w' '/tmp/graph5073378223713852901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5073378223713852901.bin' '-l' '-1' '-v' '-w' '/tmp/graph5073378223713852901.weights' '-q' '0' '-e' '0.001'
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:01:12] [INFO ] Decomposing Gal with order
[2025-06-03 02:01:12] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:12] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:12] [INFO ] Removed a total of 681 redundant transitions.
[2025-06-03 02:01:12] [INFO ] Flatten gal took : 224 ms
[2025-06-03 02:01:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 370 labels/synchronizations in 38 ms.
[2025-06-03 02:01:13] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:13] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:13] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:01:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1624794092050142872.gal : 20 ms
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:01:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1088393049265335227.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1624794092050142872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1088393049265335227.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality1088393049265335227.prop.
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 58
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :90 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 202
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :202 after 322
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1124 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :322 after 812
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :812 after 2270
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2270 after 8332
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1122 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 31335
At refinement iteration 18 (OVERLAPS) 2/1124 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:18] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 16 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1124 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1124 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5981ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 828 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 13 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 348/348 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 12 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-06-03 02:01:19] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:20] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2025-06-03 02:01:20] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:20] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :31335 after 55048
[2025-06-03 02:01:25] [INFO ] Implicit Places using invariants and state equation in 5292 ms returned []
Implicit Place search using SMT with State Equation took 6350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:01:25] [INFO ] Redundant transitions in 9 ms returned []
Running 786 sub problems to find dead transitions.
[2025-06-03 02:01:25] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:01:25] [INFO ] Invariant cache hit.
[2025-06-03 02:01:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :371598 after 382619
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:32] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:32] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:32] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:32] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:32] [INFO ] Deduced a trap composed of 44 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-03 02:01:33] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:33] [INFO ] Deduced a trap composed of 124 places in 220 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:34] [INFO ] Deduced a trap composed of 44 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-03 02:01:35] [INFO ] Deduced a trap composed of 204 places in 193 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:39] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:39] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:40] [INFO ] Deduced a trap composed of 109 places in 205 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:40] [INFO ] Deduced a trap composed of 114 places in 202 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:40] [INFO ] Deduced a trap composed of 92 places in 195 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:44] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 14 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :382619 after 980972
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66910 ms. Remains : 348/348 places, 788/788 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2025-06-03 02:02:26] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:02:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (8 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 02:02:26] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 02:02:26] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-03 02:02:26] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 11 ms returned sat
[2025-06-03 02:02:26] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-03 02:02:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 02:02:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-03 02:02:26] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-03 02:02:27] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-06-03 02:02:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:02:27] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 02:02:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 561 ms returned sat
[2025-06-03 02:02:27] [INFO ] Computed and/alt/rep : 408/1911/402 causal constraints (skipped 372 transitions) in 48 ms.
[2025-06-03 02:02:31] [INFO ] Added : 96 causal constraints over 20 iterations in 3900 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Running 786 sub problems to find dead transitions.
[2025-06-03 02:02:31] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:02:31] [INFO ] Invariant cache hit.
[2025-06-03 02:02:31] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:38] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:38] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:38] [INFO ] Deduced a trap composed of 44 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-03 02:02:39] [INFO ] Deduced a trap composed of 44 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-03 02:02:39] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:39] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:39] [INFO ] Deduced a trap composed of 124 places in 203 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:40] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:42] [INFO ] Deduced a trap composed of 204 places in 195 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:46] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:46] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:46] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:46] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:47] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:51] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40526ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 40527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40544 ms. Remains : 348/348 places, 788/788 transitions.
[2025-06-03 02:03:12] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:03:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (586 resets) in 2860 ms. (349 steps per ms)
BEST_FIRST walk for 1000001 steps (241 resets) in 1442 ms. (693 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 02:03:16] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 02:03:16] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-03 02:03:16] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 14 ms returned sat
[2025-06-03 02:03:17] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-03 02:03:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 02:03:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-03 02:03:17] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-03 02:03:17] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-03 02:03:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:03:18] [INFO ] [Nat]Added 72 Read/Feed constraints in 559 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:18] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:18] [INFO ] Deduced a trap composed of 113 places in 230 ms of which 48 ms to minimize.
[2025-06-03 02:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2025-06-03 02:03:18] [INFO ] Computed and/alt/rep : 408/1911/402 causal constraints (skipped 372 transitions) in 36 ms.
[2025-06-03 02:03:21] [INFO ] Added : 68 causal constraints over 14 iterations in 2460 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 18 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 348/348 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 11 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-06-03 02:03:25] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:03:26] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2025-06-03 02:03:26] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:03:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:03:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:03:31] [INFO ] Implicit Places using invariants and state equation in 4998 ms returned []
Implicit Place search using SMT with State Equation took 6066 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:03:31] [INFO ] Redundant transitions in 11 ms returned []
Running 786 sub problems to find dead transitions.
[2025-06-03 02:03:31] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:03:31] [INFO ] Invariant cache hit.
[2025-06-03 02:03:31] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 44 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-03 02:03:38] [INFO ] Deduced a trap composed of 44 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-03 02:03:38] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 119 places in 200 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 44 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-03 02:03:41] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:45] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:45] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:46] [INFO ] Deduced a trap composed of 109 places in 192 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:46] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:46] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:50] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66545 ms. Remains : 348/348 places, 788/788 transitions.
[2025-06-03 02:04:32] [INFO ] Flatten gal took : 60 ms
[2025-06-03 02:04:32] [INFO ] Flatten gal took : 58 ms
[2025-06-03 02:04:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11840769679682262991.gal : 7 ms
[2025-06-03 02:04:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18154798143306544480.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11840769679682262991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18154798143306544480.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (24 resets) in 413 ms. (96 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (13 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality18154798143306544480.prop.
BEST_FIRST walk for 40003 steps (15 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 180
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :180 after 470
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :470 after 712
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :712 after 1662
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1662 after 5066
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5066 after 14862
Interrupted probabilistic random walk after 317211 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 317211 steps, saw 153211 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-03 02:04:35] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:04:35] [INFO ] Invariant cache hit.
[2025-06-03 02:04:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:35] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:35] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:35] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:36] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1124 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1122 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1124 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:38] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:38] [INFO ] Deduced a trap composed of 124 places in 191 ms of which 41 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1124 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1124 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 470 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2293 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 11 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Running 786 sub problems to find dead transitions.
[2025-06-03 02:04:39] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:04:39] [INFO ] Invariant cache hit.
[2025-06-03 02:04:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 34280
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :34280 after 78606
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:45] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:45] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:45] [INFO ] Deduced a trap composed of 44 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-03 02:04:45] [INFO ] Deduced a trap composed of 44 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-03 02:04:46] [INFO ] Deduced a trap composed of 44 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-03 02:04:46] [INFO ] Deduced a trap composed of 119 places in 209 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:46] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:47] [INFO ] Deduced a trap composed of 44 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-03 02:04:49] [INFO ] Deduced a trap composed of 204 places in 233 ms of which 49 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :78606 after 407480
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:53] [INFO ] Deduced a trap composed of 113 places in 266 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:53] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:53] [INFO ] Deduced a trap composed of 109 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:54] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:54] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:58] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :407480 after 1.16242e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40434ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 40436ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40449 ms. Remains : 348/348 places, 788/788 transitions.
RANDOM walk for 40000 steps (23 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-03 02:05:22] [INFO ] Flatten gal took : 54 ms
[2025-06-03 02:05:22] [INFO ] Applying decomposition
[2025-06-03 02:05:22] [INFO ] Flatten gal took : 38 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/graph1508710190080052849.txt' '-o' '/tmp/graph1508710190080052849.bin' '-w' '/tmp/graph1508710190080052849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1508710190080052849.bin' '-l' '-1' '-v' '-w' '/tmp/graph1508710190080052849.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:05:22] [INFO ] Decomposing Gal with order
[2025-06-03 02:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Interrupted probabilistic random walk after 314177 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314177 steps, saw 151836 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2025-06-03 02:05:22] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:05:22] [INFO ] Invariant cache hit.
[2025-06-03 02:05:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:05:22] [INFO ] Removed a total of 666 redundant transitions.
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:05:22] [INFO ] Flatten gal took : 122 ms
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 02:05:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 473 labels/synchronizations in 27 ms.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12246497068843726027.gal : 8 ms
[2025-06-03 02:05:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4181511479825339224.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12246497068843726027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4181511479825339224.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2025-06-03 02:05:23] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality4181511479825339224.prop.
[2025-06-03 02:05:23] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:23] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 20
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 110
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :110 after 152
[2025-06-03 02:05:23] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :152 after 277
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :277 after 567
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :567 after 812
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :812 after 2254
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1124 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1124 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2254 after 7712
At refinement iteration 1 (OVERLAPS) 127/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/168 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/338 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24524 after 28929
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1122 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1124 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:28] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 16 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1124 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1124 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5932ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :28929 after 41016
Parikh walk visited 0 properties in 740 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 11 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 348/348 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 788/788 transitions.
Applied a total of 0 rules in 10 ms. Remains 348 /348 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-06-03 02:05:29] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:30] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2025-06-03 02:05:30] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:30] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :41016 after 207248
[2025-06-03 02:05:35] [INFO ] Implicit Places using invariants and state equation in 5003 ms returned []
Implicit Place search using SMT with State Equation took 6005 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:05:35] [INFO ] Redundant transitions in 4 ms returned []
Running 786 sub problems to find dead transitions.
[2025-06-03 02:05:35] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 02:05:35] [INFO ] Invariant cache hit.
[2025-06-03 02:05:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:42] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:42] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:42] [INFO ] Deduced a trap composed of 44 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-03 02:05:42] [INFO ] Deduced a trap composed of 44 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-03 02:05:42] [INFO ] Deduced a trap composed of 44 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-03 02:05:43] [INFO ] Deduced a trap composed of 119 places in 199 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:43] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:44] [INFO ] Deduced a trap composed of 44 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-03 02:05:45] [INFO ] Deduced a trap composed of 204 places in 188 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:49] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 39 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :371598 after 606410
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:54] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 55 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66500 ms. Remains : 348/348 places, 788/788 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-04 in 249607 ms.
[2025-06-03 02:06:35] [INFO ] Flatten gal took : 31 ms
[2025-06-03 02:06:35] [INFO ] Applying decomposition
[2025-06-03 02:06:36] [INFO ] Flatten gal took : 31 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/graph17316550682078869647.txt' '-o' '/tmp/graph17316550682078869647.bin' '-w' '/tmp/graph17316550682078869647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17316550682078869647.bin' '-l' '-1' '-v' '-w' '/tmp/graph17316550682078869647.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:06:36] [INFO ] Decomposing Gal with order
[2025-06-03 02:06:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:06:36] [INFO ] Removed a total of 697 redundant transitions.
[2025-06-03 02:06:36] [INFO ] Flatten gal took : 80 ms
[2025-06-03 02:06:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 679 labels/synchronizations in 21 ms.
[2025-06-03 02:06:36] [INFO ] Time to serialize gal into /tmp/UpperBounds6422440227561017708.gal : 7 ms
[2025-06-03 02:06:36] [INFO ] Time to serialize properties into /tmp/UpperBounds14605628612990128280.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6422440227561017708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14605628612990128280.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds14605628612990128280.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,5.04205e+06,193.679,4595524,2,337167,5,1.0361e+07,6,0,2426,8.90283e+06,0
Total reachable state count : 5042052
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T06-UpperBounds-04 :0 <= gi5.gu17.P_1159_0+gi5.gu17.P_1159_1+gi5.gu17.P_1159_2+gi5.gu17.P_1159_3+gi5.gu17.P_1159_4+gi5....173
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T06-UpperBounds-04,0,193.793,4595524,1,0,6,1.0361e+07,9,1,3064,8.90283e+06,4
Total runtime 721459 ms.
BK_STOP 1748916590601
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;