About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2238114.00 | 0.00 | 0.00 | 2 2 1 1 1 1 1 1 0 2 2 2 1 1 10 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253800301.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-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253800301
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748919734185
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-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-03 03:02:15] [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 03:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:02:15] [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 03:02:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 03:02:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2025-06-03 03:02:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-03 03:02:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-03 03:02:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 03:02:16] [INFO ] Computed 26 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0] Max Struct:[2, 20, 1, 21, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 10, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 03:02:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 03:02:16] [INFO ] Computed 26 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-03 03:02:16] [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 03:02:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 03:02:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 03:02:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 03:02:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-03 03:02:16] [INFO ] Added : 39 causal constraints over 10 iterations in 124 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 03:02:16] [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 03:02:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-03 03:02:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2025-06-03 03:02:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 03:02:16] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 03:02:17] [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 03:02:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:17] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 11 ms to minimize.
[2025-06-03 03:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-03 03:02:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
[2025-06-03 03:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-06-03 03:02:17] [INFO ] Added : 54 causal constraints over 11 iterations in 149 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 03:02:17] [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 03:02:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 03:02:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 03:02:17] [INFO ] Added : 8 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 03:02:17] [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 03:02:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 03:02:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-03 03:02:17] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 03:02:17] [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 03:02:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 03:02:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 03:02:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:18] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:18] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 5 ms to minimize.
[2025-06-03 03:02:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2025-06-03 03:02:18] [INFO ] Added : 61 causal constraints over 15 iterations in 378 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:18] [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 03:02:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 03:02:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 03:02:18] [INFO ] Added : 27 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:18] [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 03:02:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 03:02:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2025-06-03 03:02:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 03:02:18] [INFO ] Added : 58 causal constraints over 12 iterations in 149 ms. Result :sat
Minimization took 190 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 03:02:19] [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 03:02:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 03:02:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 03:02:19] [INFO ] Added : 9 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 18 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 03:02:19] [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 03:02:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-03 03:02:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 03:02:19] [INFO ] Added : 27 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 03:02:19] [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 03:02:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-03 03:02:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 03:02:19] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:19] [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 03:02:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 03:02:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 03:02:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 6 ms to minimize.
[2025-06-03 03:02:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2025-06-03 03:02:19] [INFO ] Added : 56 causal constraints over 12 iterations in 235 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 03:02:20] [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 03:02:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:20] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:20] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 5 ms to minimize.
[2025-06-03 03:02:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2025-06-03 03:02:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:20] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 4 ms to minimize.
[2025-06-03 03:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-03 03:02:20] [INFO ] Added : 58 causal constraints over 12 iterations in 151 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 03:02:20] [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 03:02:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-03 03:02:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 40 ms returned sat
[2025-06-03 03:02:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 03:02:20] [INFO ] Added : 61 causal constraints over 13 iterations in 102 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 03:02:20] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 35 ms.
[2025-06-03 03:02:20] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
[2025-06-03 03:02:20] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-03 03:02:20] [INFO ] Computed 54 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
RANDOM walk for 10000 steps (2 resets) in 98 ms. (101 steps per ms)
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90004 steps (20 resets) in 336 ms. (267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 1, 0, 2, 2, 1, 0] Max Struct:[20, 2, 8, 8, 3, 20, 20, 2, 4]
[2025-06-03 03:02:21] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-03 03:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:21] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:21] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 29 ms returned sat
[2025-06-03 03:02:21] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2025-06-03 03:02:22] [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 03:02:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:22] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned sat
[2025-06-03 03:02:22] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-06-03 03:02:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:02:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 03:02:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 1020 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:23] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-03 03:02:23] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:23] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:23] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:23] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-03 03:02:24] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 22 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:24] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-03 03:02:24] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 22 ms returned sat
[2025-06-03 03:02:24] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2025-06-03 03:02:24] [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 03:02:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:24] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 22 ms returned sat
[2025-06-03 03:02:26] [INFO ] [Nat]Absence check using state equation in 1571 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:26] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:26] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 30 ms returned sat
[2025-06-03 03:02:27] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-03 03:02:27] [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 03:02:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:27] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned sat
[2025-06-03 03:02:27] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2025-06-03 03:02:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 501 ms returned sat
[2025-06-03 03:02:28] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 97 ms.
[2025-06-03 03:02:30] [INFO ] Added : 70 causal constraints over 14 iterations in 2413 ms. Result :sat
Minimization took 589 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:31] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-03 03:02:31] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 25 ms returned sat
[2025-06-03 03:02:32] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2025-06-03 03:02:32] [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 03:02:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:32] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned sat
[2025-06-03 03:02:32] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2025-06-03 03:02:33] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 03:02:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 784 ms returned sat
[2025-06-03 03:02:33] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 84 ms.
[2025-06-03 03:02:36] [INFO ] Added : 76 causal constraints over 16 iterations in 3003 ms. Result :sat
Minimization took 545 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:37] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:37] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 14 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:02:37] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-03 03:02:37] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned sat
[2025-06-03 03:02:37] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2025-06-03 03:02:37] [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 03:02:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-03 03:02:38] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned sat
[2025-06-03 03:02:39] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2025-06-03 03:02:39] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 03:02:39] [INFO ] [Nat]Added 96 Read/Feed constraints in 823 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:40] [INFO ] Deduced a trap composed of 329 places in 453 ms of which 168 ms to minimize.
[2025-06-03 03:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2025-06-03 03:02:40] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 95 ms.
[2025-06-03 03:02:43] [INFO ] Added : 65 causal constraints over 13 iterations in 2438 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 1, 0, 2, 2, 1, 0] Max Struct:[20, 1, 1, 1, 3, 20, 20, 1, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 688 transition count 1250
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 130 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 290 place count 544 transition count 1162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 402 place count 488 transition count 1106
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 410 place count 488 transition count 1098
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 418 place count 480 transition count 1098
Applied a total of 418 rules in 205 ms. Remains 480 /690 variables (removed 210) and now considering 1098/1306 (removed 208) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-03 03:02:43] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 480 cols
[2025-06-03 03:02:43] [INFO ] Computed 52 invariants in 25 ms
[2025-06-03 03:02:43] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 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 03:02:55] [INFO ] Deduced a trap composed of 47 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 03:02:55] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 153 places in 289 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 145 places in 284 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 26 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
0.0)
(s101 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1562 variables, and 62 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1562 variables, and 62 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41287ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41532 ms. Remains : 480/690 places, 1098/1306 transitions.
[2025-06-03 03:03:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-03 03:03:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
RANDOM walk for 1000000 steps (383 resets) in 4262 ms. (234 steps per ms)
BEST_FIRST walk for 5000003 steps (765 resets) in 9524 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
[2025-06-03 03:03:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-03 03:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:03:38] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:03:38] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2025-06-03 03:03:39] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-03 03:03:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:03:39] [INFO ] [Real]Added 96 Read/Feed constraints in 176 ms returned sat
[2025-06-03 03:03:39] [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 03:03:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:03:39] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-03 03:03:39] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2025-06-03 03:03:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 271 ms returned sat
[2025-06-03 03:03:40] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 53 ms.
[2025-06-03 03:03:41] [INFO ] Added : 33 causal constraints over 7 iterations in 787 ms. Result :sat
Minimization took 4528 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:03:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-03 03:03:45] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-03 03:03:46] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-03 03:03: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 03:03:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:03:46] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-03 03:03:46] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2025-06-03 03:03:47] [INFO ] [Nat]Added 96 Read/Feed constraints in 297 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:47] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 65 ms to minimize.
[2025-06-03 03:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2025-06-03 03:03:47] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 53 ms.
[2025-06-03 03:03:48] [INFO ] Added : 53 causal constraints over 11 iterations in 911 ms. Result :sat
Minimization took 4534 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:03:53] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:03:53] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2025-06-03 03:03:53] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2025-06-03 03:03:53] [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 03:03:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:03:53] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2025-06-03 03:03:54] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2025-06-03 03:03:54] [INFO ] [Nat]Added 96 Read/Feed constraints in 253 ms returned sat
[2025-06-03 03:03:54] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 59 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:55] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:55] [INFO ] Deduced a trap composed of 145 places in 289 ms of which 62 ms to minimize.
[2025-06-03 03:03:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 765 ms
[2025-06-03 03:03:56] [INFO ] Added : 45 causal constraints over 10 iterations in 1878 ms. Result :sat
Minimization took 4341 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:04:00] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:04:00] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 30 ms returned sat
[2025-06-03 03:04:01] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-03 03:04:01] [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 03:04:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 03:04:01] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2025-06-03 03:04:01] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2025-06-03 03:04:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 249 ms returned sat
[2025-06-03 03:04:02] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 53 ms.
[2025-06-03 03:04:02] [INFO ] Added : 31 causal constraints over 7 iterations in 796 ms. Result :sat
Minimization took 4502 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:04:07] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-03 03:04:07] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-03 03:04:07] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2025-06-03 03:04:07] [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 03:04:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 03:04:07] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-03 03:04:09] [INFO ] [Nat]Absence check using state equation in 1385 ms returned sat
[2025-06-03 03:04:09] [INFO ] [Nat]Added 96 Read/Feed constraints in 339 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:09] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:10] [INFO ] Deduced a trap composed of 145 places in 289 ms of which 75 ms to minimize.
[2025-06-03 03:04:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 739 ms
[2025-06-03 03:04:10] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 58 ms.
[2025-06-03 03:04:19] [INFO ] Added : 15 causal constraints over 3 iterations in 9212 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1098/1098 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 480/480 places, 1098/1098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1098/1098 transitions.
Applied a total of 0 rules in 26 ms. Remains 480 /480 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
[2025-06-03 03:04:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-03 03:04:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:04:20] [INFO ] Implicit Places using invariants in 711 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 718 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/480 places, 1098/1098 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 464 transition count 1090
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 464 transition count 1090
Applied a total of 16 rules in 38 ms. Remains 464 /472 variables (removed 8) and now considering 1090/1098 (removed 8) transitions.
[2025-06-03 03:04:21] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-03 03:04:21] [INFO ] Computed 44 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:04:21] [INFO ] Implicit Places using invariants in 664 ms returned []
[2025-06-03 03:04:21] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:04:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:04:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:04:29] [INFO ] Implicit Places using invariants and state equation in 8145 ms returned []
Implicit Place search using SMT with State Equation took 8812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 464/480 places, 1090/1098 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9595 ms. Remains : 464/480 places, 1090/1098 transitions.
[2025-06-03 03:04:29] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:04:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
RANDOM walk for 1000000 steps (363 resets) in 3874 ms. (258 steps per ms)
BEST_FIRST walk for 5000003 steps (777 resets) in 9175 ms. (544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
[2025-06-03 03:04:42] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:04:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:04:42] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:04:42] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-03 03:04:43] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-06-03 03:04:43] [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 03:04:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:04:43] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:04:43] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2025-06-03 03:04:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:04:44] [INFO ] [Nat]Added 96 Read/Feed constraints in 441 ms returned sat
[2025-06-03 03:04:44] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 79 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:45] [INFO ] Deduced a trap composed of 145 places in 276 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:45] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:46] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 42 ms to minimize.
[2025-06-03 03:04:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1286 ms
[2025-06-03 03:04:46] [INFO ] Added : 49 causal constraints over 10 iterations in 2548 ms. Result :sat
Minimization took 4304 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:04:51] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:04:51] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-03 03:04:51] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-03 03:04:51] [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 03:04:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:04:51] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 23 ms returned sat
[2025-06-03 03:04:53] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2025-06-03 03:04:53] [INFO ] [Nat]Added 96 Read/Feed constraints in 587 ms returned sat
[2025-06-03 03:04:53] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 73 ms.
[2025-06-03 03:04:56] [INFO ] Added : 40 causal constraints over 8 iterations in 3192 ms. Result :sat
Minimization took 4512 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:05:01] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:05:01] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:05:01] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-06-03 03:05:01] [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 03:05:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-03 03:05:01] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 23 ms returned sat
[2025-06-03 03:05:02] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-06-03 03:05:02] [INFO ] [Nat]Added 96 Read/Feed constraints in 429 ms returned sat
[2025-06-03 03:05:02] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 53 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:03] [INFO ] Deduced a trap composed of 153 places in 240 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:03] [INFO ] Deduced a trap composed of 160 places in 295 ms of which 74 ms to minimize.
[2025-06-03 03:05:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2025-06-03 03:05:04] [INFO ] Added : 20 causal constraints over 4 iterations in 1361 ms. Result :sat
Minimization took 3880 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:05:08] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:05:08] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-03 03:05:08] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-06-03 03:05:08] [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 03:05:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:05:08] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:05:08] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-06-03 03:05:09] [INFO ] [Nat]Added 96 Read/Feed constraints in 373 ms returned sat
[2025-06-03 03:05:09] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 50 ms.
[2025-06-03 03:05:09] [INFO ] Added : 21 causal constraints over 5 iterations in 453 ms. Result :sat
Minimization took 4041 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:05:13] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:05:13] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-03 03:05:14] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-03 03:05:14] [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 03:05:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-03 03:05:14] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 24 ms returned sat
[2025-06-03 03:05:24] [INFO ] [Nat]Absence check using state equation in 9820 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 20 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 464/464 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 20 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-03 03:05:25] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:05:25] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-03 03:05:25] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:05:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:05:34] [INFO ] Implicit Places using invariants and state equation in 8127 ms returned []
Implicit Place search using SMT with State Equation took 8869 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:05:34] [INFO ] Redundant transitions in 65 ms returned []
Running 1088 sub problems to find dead transitions.
[2025-06-03 03:05:34] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:05:34] [INFO ] Invariant cache hit.
[2025-06-03 03:05:34] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:43] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:43] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:43] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:43] [INFO ] Deduced a trap composed of 47 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 03:05:43] [INFO ] Deduced a trap composed of 47 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 03:05:43] [INFO ] Deduced a trap composed of 47 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 03:05:43] [INFO ] Deduced a trap composed of 47 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 03:05:43] [INFO ] Deduced a trap composed of 153 places in 285 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:44] [INFO ] Deduced a trap composed of 160 places in 292 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:44] [INFO ] Deduced a trap composed of 145 places in 287 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:44] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:45] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:54] [INFO ] Deduced a trap composed of 150 places in 256 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:54] [INFO ] Deduced a trap composed of 122 places in 251 ms of which 58 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 60827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69798 ms. Remains : 464/464 places, 1090/1090 transitions.
[2025-06-03 03:06:35] [INFO ] Flatten gal took : 224 ms
RANDOM walk for 40000 steps (14 resets) in 1655 ms. (24 steps per ms) remains 10/10 properties
[2025-06-03 03:06:35] [INFO ] Flatten gal took : 187 ms
BEST_FIRST walk for 40003 steps (10 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
[2025-06-03 03:06:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality711122874726706554.gal : 55 ms
BEST_FIRST walk for 40003 steps (9 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
[2025-06-03 03:06:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3264219346287798528.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/ReachabilityCardinality711122874726706554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3264219346287798528.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 ...327
BEST_FIRST walk for 40004 steps (9 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality3264219346287798528.prop.
BEST_FIRST walk for 40003 steps (10 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (9 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 253 ms. (157 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 7
BEST_FIRST walk for 40002 steps (9 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :10 after 50
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :50 after 80
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :430 after 2019
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2019 after 6317
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6317 after 6690
Interrupted probabilistic random walk after 136067 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 10
Probabilistic random walk after 136067 steps, saw 78237 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-03 03:06:39] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:06:39] [INFO ] Invariant cache hit.
[2025-06-03 03:06:39] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:39] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:39] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :6690 after 9078
[2025-06-03 03:06:40] [INFO ] Deduced a trap composed of 47 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 03:06:40] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:40] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:40] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/46 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/462 variables, 3/49 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1074/1536 variables, 462/511 constraints. Problems are: Problem set: 3 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 96/607 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 0/607 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1538 variables, 2/609 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1538 variables, 1/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1538 variables, 0/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :9078 after 12234
At refinement iteration 20 (OVERLAPS) 0/1538 variables, 0/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 610 constraints, problems are : Problem set: 3 solved, 7 unsolved in 4204 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:43] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 1/43 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/459 variables, 4/47 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/462 variables, 3/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1074/1536 variables, 462/512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 96/608 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 7/615 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:46] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 61 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1536 variables, 1/616 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1538 variables, and 616 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 462/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9237ms problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 45 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2025-06-03 03:06:48] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:06:48] [INFO ] Invariant cache hit.
[2025-06-03 03:06:48] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :12234 after 88248
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:57] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:57] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:57] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:57] [INFO ] Deduced a trap composed of 47 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 03:06:57] [INFO ] Deduced a trap composed of 47 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 03:06:57] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:57] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:58] [INFO ] Deduced a trap composed of 153 places in 302 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:58] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:58] [INFO ] Deduced a trap composed of 145 places in 265 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:59] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:59] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :88248 after 236060
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:08] [INFO ] Deduced a trap composed of 150 places in 265 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:09] [INFO ] Deduced a trap composed of 122 places in 251 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :236060 after 459204
Detected timeout of ITS tools.
[2025-06-03 03:07:25] [INFO ] Flatten gal took : 64 ms
[2025-06-03 03:07:25] [INFO ] Applying decomposition
[2025-06-03 03:07:25] [INFO ] Flatten gal took : 50 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/graph4721460895448230457.txt' '-o' '/tmp/graph4721460895448230457.bin' '-w' '/tmp/graph4721460895448230457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4721460895448230457.bin' '-l' '-1' '-v' '-w' '/tmp/graph4721460895448230457.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:07:26] [INFO ] Decomposing Gal with order
[2025-06-03 03:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:07:26] [INFO ] Removed a total of 725 redundant transitions.
[2025-06-03 03:07:26] [INFO ] Flatten gal took : 333 ms
[2025-06-03 03:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 48 ms.
[2025-06-03 03:07:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13316989605177822465.gal : 14 ms
[2025-06-03 03:07:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14352210191444548028.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/ReachabilityCardinality13316989605177822465.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14352210191444548028.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 ...330
Loading property file /tmp/ReachabilityCardinality14352210191444548028.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :18 after 50
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :50 after 114
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :114 after 206
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :206 after 556
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :556 after 696
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :696 after 1165
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1165 after 1438
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1438 after 2600
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40763ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 40767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40815 ms. Remains : 464/464 places, 1090/1090 transitions.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2600 after 7294
RANDOM walk for 40000 steps (14 resets) in 490 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (9 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :7294 after 20456
Interrupted probabilistic random walk after 194789 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 7
Probabilistic random walk after 194789 steps, saw 110047 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2025-06-03 03:07:32] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:07:32] [INFO ] Invariant cache hit.
[2025-06-03 03:07:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/459 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/462 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1074/1536 variables, 462/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1538 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1538 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 604 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3147 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:36] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:36] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:36] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:36] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:36] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:37] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/462 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1074/1536 variables, 462/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 96/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 7/614 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/1538 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :20456 after 78983
At refinement iteration 19 (INCLUDED_ONLY) 0/1538 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:48] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:48] [INFO ] Deduced a trap composed of 145 places in 260 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:49] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:49] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1538 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1538 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :78983 after 123748
At refinement iteration 22 (OVERLAPS) 0/1538 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 621 constraints, problems are : Problem set: 0 solved, 7 unsolved in 19358 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22517ms problems are : Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :123748 after 277814
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 24139 ms.
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 18 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 464/464 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 15 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-03 03:08:19] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:08:20] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-06-03 03:08:20] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:08:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:08:28] [INFO ] Implicit Places using invariants and state equation in 8035 ms returned []
Implicit Place search using SMT with State Equation took 8792 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:08:28] [INFO ] Redundant transitions in 20 ms returned []
Running 1088 sub problems to find dead transitions.
[2025-06-03 03:08:28] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:08:28] [INFO ] Invariant cache hit.
[2025-06-03 03:08:28] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:37] [INFO ] Deduced a trap composed of 47 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 03:08:38] [INFO ] Deduced a trap composed of 47 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 03:08:38] [INFO ] Deduced a trap composed of 153 places in 307 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:38] [INFO ] Deduced a trap composed of 160 places in 310 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:39] [INFO ] Deduced a trap composed of 145 places in 287 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:39] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:39] [INFO ] Deduced a trap composed of 47 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 03:08:48] [INFO ] Deduced a trap composed of 150 places in 261 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:49] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 57 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 9.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 timeout
0.0)
(s222 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60767ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 60770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69607 ms. Remains : 464/464 places, 1090/1090 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-01
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-03 03:09:29] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:09:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (2 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:09:29] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:09:29] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:09:29] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-03 03:09:29] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-03 03:09:29] [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 03:09:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:09:29] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:09:30] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-03 03:09:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:09:30] [INFO ] [Nat]Added 96 Read/Feed constraints in 454 ms returned sat
[2025-06-03 03:09:30] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 60 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:32] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:32] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:32] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 42 ms to minimize.
[2025-06-03 03:09:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1328 ms
[2025-06-03 03:09:33] [INFO ] Added : 49 causal constraints over 10 iterations in 2616 ms. Result :sat
Minimization took 571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 28 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:09:33] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-03 03:09:33] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 03:09:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:45] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:45] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:45] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:45] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:46] [INFO ] Deduced a trap composed of 46 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 03:09:46] [INFO ] Deduced a trap composed of 46 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 03:09:46] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:46] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:46] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:48] [INFO ] Deduced a trap composed of 284 places in 280 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:52] [INFO ] Deduced a trap composed of 150 places in 265 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:53] [INFO ] Deduced a trap composed of 122 places in 260 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:09:54] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:09] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:13] [INFO ] Deduced a trap composed of 145 places in 293 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:14] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 84 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40975ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 40978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41023 ms. Remains : 456/464 places, 1082/1090 transitions.
[2025-06-03 03:10:14] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:10:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (427 resets) in 3394 ms. (294 steps per ms)
BEST_FIRST walk for 1000000 steps (161 resets) in 1617 ms. (618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:10:19] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:10:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:10:20] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:10:20] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:10:20] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-03 03:10:20] [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 03:10:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:10:20] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:10:20] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-03 03:10:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:10:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 411 ms returned sat
[2025-06-03 03:10:21] [INFO ] Computed and/alt/rep : 408/1453/400 causal constraints (skipped 664 transitions) in 50 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:22] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 13 ms to minimize.
[2025-06-03 03:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2025-06-03 03:10:22] [INFO ] Added : 42 causal constraints over 9 iterations in 1710 ms. Result :sat
Minimization took 4539 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 35 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 17 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-03 03:10:27] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:10:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:10:28] [INFO ] Implicit Places using invariants in 788 ms returned []
[2025-06-03 03:10:28] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:10:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:10:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:10:34] [INFO ] Implicit Places using invariants and state equation in 5927 ms returned []
Implicit Place search using SMT with State Equation took 6727 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:10:34] [INFO ] Redundant transitions in 8 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:10:34] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:10:34] [INFO ] Invariant cache hit.
[2025-06-03 03:10:34] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:44] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:45] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:45] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:45] [INFO ] Deduced a trap composed of 46 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 03:10:45] [INFO ] Deduced a trap composed of 46 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 03:10:45] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:45] [INFO ] Deduced a trap composed of 46 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 03:10:45] [INFO ] Deduced a trap composed of 153 places in 309 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:46] [INFO ] Deduced a trap composed of 160 places in 273 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:47] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:47] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:53] [INFO ] Deduced a trap composed of 150 places in 259 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:54] [INFO ] Deduced a trap composed of 122 places in 268 ms of which 58 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 284 places in 286 ms of which 85 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:22] [INFO ] Deduced a trap composed of 145 places in 286 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:23] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:29] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:30] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 60 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60820ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60824ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67586 ms. Remains : 456/456 places, 1082/1082 transitions.
[2025-06-03 03:11:35] [INFO ] Flatten gal took : 182 ms
RANDOM walk for 40000 steps (13 resets) in 530 ms. (75 steps per ms) remains 2/2 properties
[2025-06-03 03:11:35] [INFO ] Flatten gal took : 135 ms
[2025-06-03 03:11:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2944186058475181581.gal : 13 ms
[2025-06-03 03:11:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10410555541079150366.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/ReachabilityCardinality2944186058475181581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10410555541079150366.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
BEST_FIRST walk for 40003 steps (13 resets) in 473 ms. (84 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10410555541079150366.prop.
BEST_FIRST walk for 40004 steps (9 resets) in 425 ms. (93 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 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 180
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180 after 458
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :458 after 1076
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1076 after 1396
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1396 after 3792
Interrupted probabilistic random walk after 153080 steps, run timeout after 3013 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 153080 steps, saw 87313 distinct states, run finished after 3013 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-03 03:11:38] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:11:38] [INFO ] Invariant cache hit.
[2025-06-03 03:11:38] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3792 after 12768
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12768 after 33556
[2025-06-03 03:11:46] [INFO ] Deduced a trap composed of 46 places in 7534 ms of which 42 ms to minimize.
SMT process timed out in 7789ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 32 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:11:46] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:11:46] [INFO ] Invariant cache hit.
[2025-06-03 03:11:46] [INFO ] State equation strengthened by 96 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 32768
SDD size :33556 after 75820
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:58] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:58] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:58] [INFO ] Deduced a trap composed of 46 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 03:11:58] [INFO ] Deduced a trap composed of 46 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 03:11:58] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:58] [INFO ] Deduced a trap composed of 46 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 03:11:58] [INFO ] Deduced a trap composed of 46 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 03:11:59] [INFO ] Deduced a trap composed of 153 places in 280 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:59] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:00] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :75820 after 126534
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:01] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:07] [INFO ] Deduced a trap composed of 150 places in 258 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :126534 after 348866
Detected timeout of ITS tools.
[2025-06-03 03:12:25] [INFO ] Flatten gal took : 94 ms
[2025-06-03 03:12:25] [INFO ] Applying decomposition
[2025-06-03 03:12:25] [INFO ] Flatten gal took : 90 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/graph13646628616992866491.txt' '-o' '/tmp/graph13646628616992866491.bin' '-w' '/tmp/graph13646628616992866491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13646628616992866491.bin' '-l' '-1' '-v' '-w' '/tmp/graph13646628616992866491.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:12:26] [INFO ] Decomposing Gal with order
[2025-06-03 03:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:12:26] [INFO ] Removed a total of 816 redundant transitions.
[2025-06-03 03:12:26] [INFO ] Flatten gal took : 286 ms
[2025-06-03 03:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 457 labels/synchronizations in 69 ms.
[2025-06-03 03:12:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3198160624867991355.gal : 27 ms
[2025-06-03 03:12:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5795653862763446483.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/ReachabilityCardinality3198160624867991355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5795653862763446483.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/ReachabilityCardinality5795653862763446483.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 154
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :154 after 178
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41102ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41144 ms. Remains : 456/456 places, 1082/1082 transitions.
RANDOM walk for 40000 steps (17 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :178 after 283
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :283 after 311
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :311 after 836
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :836 after 1312
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1312 after 2222
Interrupted probabilistic random walk after 357768 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 357768 steps, saw 194100 distinct states, run finished after 3014 ms. (steps per millisecond=118 ) properties seen :0
[2025-06-03 03:12:30] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:12:30] [INFO ] Invariant cache hit.
[2025-06-03 03:12:30] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/451 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/454 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2222 after 6132
At refinement iteration 13 (OVERLAPS) 1066/1520 variables, 454/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1520 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1522 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:32] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:32] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:32] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:32] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6132 after 20698
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1522/1522 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 35 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 17 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-03 03:12:34] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :20698 after 50044
[2025-06-03 03:12:48] [INFO ] Implicit Places using invariants in 14024 ms returned []
[2025-06-03 03:12:48] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:12:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:12:57] [INFO ] Implicit Places using invariants and state equation in 8781 ms returned []
Implicit Place search using SMT with State Equation took 22837 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:12:57] [INFO ] Redundant transitions in 9 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:12:57] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:12:57] [INFO ] Invariant cache hit.
[2025-06-03 03:12:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:14] [INFO ] Deduced a trap composed of 46 places in 2949 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:14] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:15] [INFO ] Deduced a trap composed of 46 places in 1473 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:15] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 03:13:17] [INFO ] Deduced a trap composed of 46 places in 1178 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:17] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:17] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:17] [INFO ] Deduced a trap composed of 153 places in 286 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:17] [INFO ] Deduced a trap composed of 160 places in 273 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:18] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:19] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:25] [INFO ] Deduced a trap composed of 150 places in 275 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:26] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:56] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:56] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60924ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83833 ms. Remains : 456/456 places, 1082/1082 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-01 in 269114 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-08
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 03:13:58] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-03 03:13:58] [INFO ] Computed 44 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (4 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 03:13:58] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:13:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:13:58] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:13:58] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-03 03:13:58] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2025-06-03 03:13:58] [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 03:13:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 03:13:59] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-03 03:14:00] [INFO ] [Nat]Absence check using state equation in 1474 ms returned unknown
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 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 448 transition count 1074
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 440 transition count 1066
Applied a total of 48 rules in 48 ms. Remains 440 /464 variables (removed 24) and now considering 1066/1090 (removed 24) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:14:00] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2025-06-03 03:14:00] [INFO ] Computed 44 invariants in 18 ms
[2025-06-03 03:14:00] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:11] [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 03:14:11] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:11] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:11] [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 03:14:11] [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 03:14:11] [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 03:14:11] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:14] [INFO ] Deduced a trap composed of 268 places in 261 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:14] [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 03:14:18] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:18] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:27] [INFO ] Deduced a trap composed of 160 places in 281 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:27] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:28] [INFO ] Deduced a trap composed of 145 places in 252 ms of which 35 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(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 0)
(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 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(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 9)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 timeout
0)
(s193 0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 57 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40762ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 40764ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40814 ms. Remains : 440/464 places, 1066/1090 transitions.
[2025-06-03 03:14:41] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:14:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (416 resets) in 3470 ms. (288 steps per ms)
BEST_FIRST walk for 1000001 steps (144 resets) in 1630 ms. (613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-03 03:14:46] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:14:46] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:14:46] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:14:46] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-06-03 03:14: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 03:14:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:14:47] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2025-06-03 03:14:48] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2025-06-03 03:14:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:14:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 1260 ms returned sat
[2025-06-03 03:14:49] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 56 ms.
[2025-06-03 03:14:50] [INFO ] Added : 26 causal constraints over 6 iterations in 786 ms. Result :sat
Minimization took 4548 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 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 21 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-03 03:14:55] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:14:55] [INFO ] Implicit Places using invariants in 661 ms returned []
[2025-06-03 03:14:55] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:14:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:15:03] [INFO ] Implicit Places using invariants and state equation in 8255 ms returned []
Implicit Place search using SMT with State Equation took 8927 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:15:03] [INFO ] Redundant transitions in 12 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:15:03] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:15:03] [INFO ] Invariant cache hit.
[2025-06-03 03:15:03] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:13] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:13] [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 03:15:13] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:13] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:13] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:13] [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 03:15:13] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:14] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:14] [INFO ] Deduced a trap composed of 153 places in 274 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:14] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:25] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:25] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:26] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:30] [INFO ] Deduced a trap composed of 268 places in 241 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:34] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 61 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 57 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:55] [INFO ] Deduced a trap composed of 122 places in 256 ms of which 57 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60840ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 60842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69805 ms. Remains : 440/440 places, 1066/1066 transitions.
[2025-06-03 03:16:04] [INFO ] Flatten gal took : 70 ms
RANDOM walk for 40001 steps (24 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
[2025-06-03 03:16:04] [INFO ] Flatten gal took : 91 ms
[2025-06-03 03:16:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14118600820738571110.gal : 12 ms
BEST_FIRST walk for 40001 steps (12 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2025-06-03 03:16:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9916692310670249045.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/ReachabilityCardinality14118600820738571110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9916692310670249045.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
Loading property file /tmp/ReachabilityCardinality9916692310670249045.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 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 497
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :497 after 588
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :588 after 1358
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1358 after 2462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2462 after 7412
Interrupted probabilistic random walk after 252377 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252377 steps, saw 140530 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-03 03:16:08] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:16:08] [INFO ] Invariant cache hit.
[2025-06-03 03:16:08] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 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 03:16:08] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:08] [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
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7412 after 14374
[2025-06-03 03:16:08] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:09] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:09] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 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 03:16:10] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:10] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 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 03:16:11] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:11] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 37 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 591 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4388ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:16:12] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:16:12] [INFO ] Invariant cache hit.
[2025-06-03 03:16:12] [INFO ] State equation strengthened by 96 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 16384
SDD size :43536 after 43644
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:24] [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 03:16:24] [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 03:16:24] [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 03:16:24] [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 03:16:24] [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 03:16:24] [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 03:16:24] [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 03:16:24] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:25] [INFO ] Deduced a trap composed of 153 places in 263 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:25] [INFO ] Deduced a trap composed of 160 places in 260 ms of which 62 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :43644 after 89102
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 52 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:45] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 23 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :89102 after 236262
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:51] [INFO ] Deduced a trap composed of 268 places in 254 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40999ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 41001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41019 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (21 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-03 03:16:55] [INFO ] Flatten gal took : 45 ms
[2025-06-03 03:16:55] [INFO ] Applying decomposition
[2025-06-03 03:16:55] [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/graph15668815131930056710.txt' '-o' '/tmp/graph15668815131930056710.bin' '-w' '/tmp/graph15668815131930056710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15668815131930056710.bin' '-l' '-1' '-v' '-w' '/tmp/graph15668815131930056710.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:16:55] [INFO ] Decomposing Gal with order
[2025-06-03 03:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:16:55] [INFO ] Removed a total of 973 redundant transitions.
[2025-06-03 03:16:55] [INFO ] Flatten gal took : 112 ms
[2025-06-03 03:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 629 labels/synchronizations in 30 ms.
[2025-06-03 03:16:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18253654298946425423.gal : 9 ms
[2025-06-03 03:16:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1007992254579343596.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/ReachabilityCardinality18253654298946425423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1007992254579343596.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
Loading property file /tmp/ReachabilityCardinality1007992254579343596.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 28
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :28 after 60
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60 after 190
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :190 after 478
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :478 after 1910
Interrupted probabilistic random walk after 257728 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 257728 steps, saw 143420 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2025-06-03 03:16:56] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:16:56] [INFO ] Invariant cache hit.
[2025-06-03 03:16:56] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 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 03:16:57] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1910 after 5072
[2025-06-03 03:16:57] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:57] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:57] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:57] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5072 after 10577
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:58] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:58] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 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 03:16:59] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:00] [INFO ] Deduced a trap composed of 160 places in 417 ms of which 52 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 591 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2695 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4324ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-03 03:17:01] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10577 after 33942
[2025-06-03 03:17:01] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-06-03 03:17:01] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:17:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:17:10] [INFO ] Implicit Places using invariants and state equation in 8435 ms returned []
Implicit Place search using SMT with State Equation took 9176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:17:10] [INFO ] Redundant transitions in 9 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:17:10] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:17:10] [INFO ] Invariant cache hit.
[2025-06-03 03:17:10] [INFO ] State equation strengthened by 96 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 :33942 after 66878
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:19] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:19] [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 03:17:19] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:20] [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 03:17:20] [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 03:17:20] [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 03:17:20] [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 03:17:20] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:20] [INFO ] Deduced a trap composed of 153 places in 264 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:21] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:31] [INFO ] Deduced a trap composed of 145 places in 238 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:31] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:32] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 19 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :66878 after 198094
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:36] [INFO ] Deduced a trap composed of 268 places in 249 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:40] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:41] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 55 ms to minimize.
SMT process timed out in 30976ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 30977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40195 ms. Remains : 440/440 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 440 transition count 1050
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 432 transition count 1082
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 432 transition count 1050
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 432 transition count 1042
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 424 transition count 1042
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 424 transition count 1034
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 416 transition count 1034
Applied a total of 96 rules in 88 ms. Remains 416 /440 variables (removed 24) and now considering 1034/1066 (removed 32) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1034 rows 416 cols
[2025-06-03 03:17:41] [INFO ] Computed 44 invariants in 23 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 03:17:41] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-03 03:17:41] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 17 ms returned sat
[2025-06-03 03:17:42] [INFO ] After 653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 03:17:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-03 03:17:42] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 18 ms returned sat
[2025-06-03 03:17:42] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 03:17:43] [INFO ] After 1014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 03:17:43] [INFO ] After 1310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 03:17:43] [INFO ] Flatten gal took : 45 ms
[2025-06-03 03:17:43] [INFO ] Flatten gal took : 36 ms
[2025-06-03 03:17:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16388474704368613721.gal : 7 ms
[2025-06-03 03:17:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2362822074161969454.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/ReachabilityCardinality16388474704368613721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2362822074161969454.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
Loading property file /tmp/ReachabilityCardinality2362822074161969454.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 35
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :35 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 61
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :61 after 75
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :75 after 77
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :77 after 303
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :303 after 440
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :440 after 1028
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1028 after 1765
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1765 after 5242
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5242 after 12729
Detected timeout of ITS tools.
[2025-06-03 03:17:58] [INFO ] Flatten gal took : 31 ms
[2025-06-03 03:17:58] [INFO ] Applying decomposition
[2025-06-03 03:17:58] [INFO ] Flatten gal took : 30 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/graph9809125924340052039.txt' '-o' '/tmp/graph9809125924340052039.bin' '-w' '/tmp/graph9809125924340052039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9809125924340052039.bin' '-l' '-1' '-v' '-w' '/tmp/graph9809125924340052039.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:17:58] [INFO ] Decomposing Gal with order
[2025-06-03 03:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:17:58] [INFO ] Removed a total of 969 redundant transitions.
[2025-06-03 03:17:58] [INFO ] Flatten gal took : 129 ms
[2025-06-03 03:17:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 592 labels/synchronizations in 20 ms.
[2025-06-03 03:17:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13250628719155694829.gal : 6 ms
[2025-06-03 03:17:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15710743240896011204.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/ReachabilityCardinality13250628719155694829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15710743240896011204.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 ...330
Loading property file /tmp/ReachabilityCardinality15710743240896011204.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 44
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :44 after 155
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :155 after 231
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :231 after 483
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :483 after 1329
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1329 after 2655
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2655 after 6109
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6109 after 12627
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32824 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-08 in 255816 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-03 03:18:14] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-03 03:18:14] [INFO ] Computed 44 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (5 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:18:14] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:18:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:18:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:18:14] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:18:14] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-06-03 03:18:14] [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 03:18:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:18:14] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:18:15] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-06-03 03:18:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:18:15] [INFO ] [Nat]Added 96 Read/Feed constraints in 436 ms returned sat
[2025-06-03 03:18:15] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 50 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:16] [INFO ] Deduced a trap composed of 153 places in 255 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:16] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 75 ms to minimize.
[2025-06-03 03:18:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 847 ms
[2025-06-03 03:18:16] [INFO ] Added : 20 causal constraints over 4 iterations in 1413 ms. Result :sat
Minimization took 566 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 32 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:18:17] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-03 03:18:17] [INFO ] Computed 44 invariants in 19 ms
[2025-06-03 03:18:17] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:27] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:28] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:28] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:28] [INFO ] Deduced a trap composed of 46 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 03:18:28] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:28] [INFO ] Deduced a trap composed of 46 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 03:18:28] [INFO ] Deduced a trap composed of 46 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 03:18:28] [INFO ] Deduced a trap composed of 46 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 03:18:28] [INFO ] Deduced a trap composed of 153 places in 295 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:29] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:29] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:29] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:30] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40978ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 40979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41014 ms. Remains : 456/464 places, 1082/1090 transitions.
[2025-06-03 03:18:58] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:18:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (389 resets) in 3499 ms. (285 steps per ms)
BEST_FIRST walk for 1000001 steps (159 resets) in 1812 ms. (551 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:19:03] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:19:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:19:03] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:19:03] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2025-06-03 03:19:04] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2025-06-03 03:19:04] [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 03:19:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:19:04] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:19:04] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-03 03:19:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:19:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 444 ms returned sat
[2025-06-03 03:19:05] [INFO ] Computed and/alt/rep : 464/1581/456 causal constraints (skipped 608 transitions) in 63 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:06] [INFO ] Deduced a trap composed of 145 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:06] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:07] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 69 ms to minimize.
[2025-06-03 03:19:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1434 ms
[2025-06-03 03:19:08] [INFO ] Added : 72 causal constraints over 16 iterations in 2970 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 18 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 14 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-03 03:19:12] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:19:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:19:13] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-03 03:19:13] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:19:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:19:22] [INFO ] Implicit Places using invariants and state equation in 8413 ms returned []
Implicit Place search using SMT with State Equation took 9354 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:19:22] [INFO ] Redundant transitions in 16 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:19:22] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:19:22] [INFO ] Invariant cache hit.
[2025-06-03 03:19:22] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:32] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:32] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:32] [INFO ] Deduced a trap composed of 46 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 03:19:32] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:32] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:32] [INFO ] Deduced a trap composed of 46 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 03:19:32] [INFO ] Deduced a trap composed of 46 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 03:19:32] [INFO ] Deduced a trap composed of 153 places in 291 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:33] [INFO ] Deduced a trap composed of 160 places in 267 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:33] [INFO ] Deduced a trap composed of 145 places in 283 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:33] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:34] [INFO ] Deduced a trap composed of 46 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 03:19:42] [INFO ] Deduced a trap composed of 150 places in 272 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:43] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:07] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:11] [INFO ] Deduced a trap composed of 284 places in 266 ms of which 60 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60930ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60932ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70328 ms. Remains : 456/456 places, 1082/1082 transitions.
[2025-06-03 03:20:23] [INFO ] Flatten gal took : 65 ms
[2025-06-03 03:20:23] [INFO ] Flatten gal took : 84 ms
[2025-06-03 03:20:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3149417434989429503.gal : 6 ms
[2025-06-03 03:20:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3727685616098895852.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/ReachabilityCardinality3149417434989429503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3727685616098895852.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
RANDOM walk for 40000 steps (16 resets) in 599 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3727685616098895852.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 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50 after 80
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :430 after 2243
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2243 after 5603
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5603 after 5950
Interrupted probabilistic random walk after 221493 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221493 steps, saw 123883 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-03 03:20:26] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:20:26] [INFO ] Invariant cache hit.
[2025-06-03 03:20:26] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:26] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:26] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:27] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:27] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:27] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/502 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 0/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1522 variables, 2/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 1/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5950 after 9335
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 601 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:28] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/454 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/1522 variables, and 599 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 454/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3341ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 16 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:20:29] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:20:29] [INFO ] Invariant cache hit.
[2025-06-03 03:20:29] [INFO ] State equation strengthened by 96 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 4096
SDD size :9335 after 12216
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:40] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:40] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:40] [INFO ] Deduced a trap composed of 46 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 03:20:40] [INFO ] Deduced a trap composed of 46 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 03:20:40] [INFO ] Deduced a trap composed of 46 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 03:20:41] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:41] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:41] [INFO ] Deduced a trap composed of 153 places in 446 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:41] [INFO ] Deduced a trap composed of 160 places in 284 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:42] [INFO ] Deduced a trap composed of 145 places in 286 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:42] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:43] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12216 after 169376
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :169376 after 239168
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41018ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41041 ms. Remains : 456/456 places, 1082/1082 transitions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :239168 after 479459
RANDOM walk for 40000 steps (18 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-03 03:21:13] [INFO ] Flatten gal took : 31 ms
[2025-06-03 03:21:13] [INFO ] Applying decomposition
[2025-06-03 03:21:13] [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/graph14988467869904658419.txt' '-o' '/tmp/graph14988467869904658419.bin' '-w' '/tmp/graph14988467869904658419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14988467869904658419.bin' '-l' '-1' '-v' '-w' '/tmp/graph14988467869904658419.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:21:13] [INFO ] Decomposing Gal with order
[2025-06-03 03:21:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:21:13] [INFO ] Removed a total of 1009 redundant transitions.
[2025-06-03 03:21:13] [INFO ] Flatten gal took : 124 ms
[2025-06-03 03:21:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 277 labels/synchronizations in 10 ms.
[2025-06-03 03:21:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11783406644671115791.gal : 7 ms
[2025-06-03 03:21:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16042952435676258569.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/ReachabilityCardinality11783406644671115791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16042952435676258569.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 ...330
Interrupted probabilistic random walk after 337207 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337207 steps, saw 184055 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-03 03:21:13] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:21:13] [INFO ] Invariant cache hit.
[2025-06-03 03:21:13] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality16042952435676258569.prop.
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/451 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/454 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 234
At refinement iteration 13 (OVERLAPS) 1066/1520 variables, 454/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :234 after 668
At refinement iteration 14 (INCLUDED_ONLY) 0/1520 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :668 after 850
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1522 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
At refinement iteration 19 (OVERLAPS) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
SDD size :850 after 1256
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1256 after 2214
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:14] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2214 after 6304
[2025-06-03 03:21:15] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:15] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 4096
[2025-06-03 03:21:15] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 4 ms to minimize.
SDD size :6304 after 21360
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1522/1522 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2903ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 21 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-03 03:21:16] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:21:17] [INFO ] Implicit Places using invariants in 907 ms returned []
[2025-06-03 03:21:17] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:21:18] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21360 after 63270
[2025-06-03 03:21:26] [INFO ] Implicit Places using invariants and state equation in 8806 ms returned []
Implicit Place search using SMT with State Equation took 9722 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:21:26] [INFO ] Redundant transitions in 8 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:21:26] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:21:26] [INFO ] Invariant cache hit.
[2025-06-03 03:21:26] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :63270 after 96868
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :96868 after 259112
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:36] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:36] [INFO ] Deduced a trap composed of 46 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 03:21:36] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:37] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:37] [INFO ] Deduced a trap composed of 46 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 03:21:37] [INFO ] Deduced a trap composed of 46 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 03:21:37] [INFO ] Deduced a trap composed of 46 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 03:21:37] [INFO ] Deduced a trap composed of 153 places in 274 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:37] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:38] [INFO ] Deduced a trap composed of 145 places in 268 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:38] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:39] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :259112 after 1.43154e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:47] [INFO ] Deduced a trap composed of 150 places in 266 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:21:47] [INFO ] Deduced a trap composed of 122 places in 234 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:11] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:15] [INFO ] Deduced a trap composed of 284 places in 254 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61035ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 61037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70789 ms. Remains : 456/456 places, 1082/1082 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09 in 253502 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-10
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-03 03:22:27] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-03 03:22:27] [INFO ] Computed 44 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (7 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:22:27] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:22:27] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:22:27] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:22:28] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-06-03 03:22:28] [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 03:22:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:22:28] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:22:28] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-06-03 03:22:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:22:29] [INFO ] [Nat]Added 96 Read/Feed constraints in 371 ms returned sat
[2025-06-03 03:22:29] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 48 ms.
[2025-06-03 03:22:29] [INFO ] Added : 21 causal constraints over 5 iterations in 440 ms. Result :sat
Minimization took 551 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 1082
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 456 transition count 1074
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 448 transition count 1074
Applied a total of 32 rules in 42 ms. Remains 448 /464 variables (removed 16) and now considering 1074/1090 (removed 16) transitions.
Running 1072 sub problems to find dead transitions.
[2025-06-03 03:22:30] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2025-06-03 03:22:30] [INFO ] Computed 44 invariants in 14 ms
[2025-06-03 03:22:30] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:39] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:39] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:40] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:40] [INFO ] Deduced a trap composed of 45 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 03:22:40] [INFO ] Deduced a trap composed of 45 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 03:22:40] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:40] [INFO ] Deduced a trap composed of 45 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 03:22:40] [INFO ] Deduced a trap composed of 45 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 03:22:40] [INFO ] Deduced a trap composed of 153 places in 284 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:41] [INFO ] Deduced a trap composed of 160 places in 302 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:41] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:41] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:42] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:48] [INFO ] Deduced a trap composed of 150 places in 263 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:49] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:50] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:51] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 45 ms to minimize.
SMT process timed out in 20999ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 21001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21050 ms. Remains : 448/464 places, 1074/1090 transitions.
[2025-06-03 03:22:51] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:22:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (423 resets) in 3565 ms. (280 steps per ms)
BEST_FIRST walk for 1000000 steps (143 resets) in 1715 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-03 03:22:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:22:56] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:22:56] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:22:56] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-03 03:22:56] [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 03:22:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:22:57] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:22:57] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-06-03 03:22:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:22:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 261 ms returned sat
[2025-06-03 03:22:57] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 58 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:58] [INFO ] Deduced a trap composed of 145 places in 274 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:58] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:59] [INFO ] Deduced a trap composed of 153 places in 266 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:22:59] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 68 ms to minimize.
[2025-06-03 03:22:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1420 ms
[2025-06-03 03:23:00] [INFO ] Added : 45 causal constraints over 10 iterations in 2732 ms. Result :sat
Minimization took 2905 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-06-03 03:23:03] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:23:04] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-03 03:23:04] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:23:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:23:11] [INFO ] Implicit Places using invariants and state equation in 6712 ms returned []
Implicit Place search using SMT with State Equation took 7417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:23:11] [INFO ] Redundant transitions in 10 ms returned []
Running 1072 sub problems to find dead transitions.
[2025-06-03 03:23:11] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:23:11] [INFO ] Invariant cache hit.
[2025-06-03 03:23:11] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:22] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:22] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:22] [INFO ] Deduced a trap composed of 45 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 03:23:22] [INFO ] Deduced a trap composed of 45 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 03:23:22] [INFO ] Deduced a trap composed of 45 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 03:23:22] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:22] [INFO ] Deduced a trap composed of 45 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 03:23:26] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:34] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 20 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 51 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:52] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:52] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:52] [INFO ] Deduced a trap composed of 145 places in 251 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:23:57] [INFO ] Deduced a trap composed of 276 places in 307 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:06] [INFO ] Deduced a trap composed of 143 places in 276 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:07] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:07] [INFO ] Deduced a trap composed of 264 places in 270 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:09] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:09] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60983ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 60984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68435 ms. Remains : 448/448 places, 1074/1074 transitions.
[2025-06-03 03:24:12] [INFO ] Flatten gal took : 40 ms
[2025-06-03 03:24:12] [INFO ] Flatten gal took : 92 ms
[2025-06-03 03:24:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1979273955699368792.gal : 15 ms
RANDOM walk for 40000 steps (17 resets) in 536 ms. (74 steps per ms) remains 2/2 properties
[2025-06-03 03:24:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11212986538221242508.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/ReachabilityCardinality1979273955699368792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11212986538221242508.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
BEST_FIRST walk for 40004 steps (10 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11212986538221242508.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 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 180
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180 after 836
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :836 after 1214
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1214 after 2378
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2378 after 4694
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4694 after 9644
Interrupted probabilistic random walk after 270549 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270549 steps, saw 149677 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-03 03:24:15] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:24:15] [INFO ] Invariant cache hit.
[2025-06-03 03:24:15] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:15] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:15] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:16] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:16] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:16] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1506 variables, 2/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 593 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 1/591 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9644 after 20736
[2025-06-03 03:24:18] [INFO ] Deduced a trap composed of 160 places in 540 ms of which 53 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 1/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 0/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1506 variables, 2/594 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 1/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:19] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 25 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1506 variables, 1/596 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1506 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1506 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 596 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4244ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2025-06-03 03:24:19] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:24:19] [INFO ] Invariant cache hit.
[2025-06-03 03:24:19] [INFO ] State equation strengthened by 96 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 32768
SDD size :20736 after 64326
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:32] [INFO ] Deduced a trap composed of 45 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 03:24:32] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:32] [INFO ] Deduced a trap composed of 45 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 03:24:32] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:32] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:32] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:32] [INFO ] Deduced a trap composed of 45 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 03:24:35] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :64326 after 104422
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 50 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:49] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:49] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:49] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:24:50] [INFO ] Deduced a trap composed of 145 places in 246 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 54 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41006ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 41007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41022 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (17 resets) in 409 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :104422 after 234634
Detected timeout of ITS tools.
[2025-06-03 03:25:02] [INFO ] Flatten gal took : 35 ms
[2025-06-03 03:25:02] [INFO ] Applying decomposition
[2025-06-03 03:25:02] [INFO ] Flatten gal took : 34 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/graph14364417257446180287.txt' '-o' '/tmp/graph14364417257446180287.bin' '-w' '/tmp/graph14364417257446180287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14364417257446180287.bin' '-l' '-1' '-v' '-w' '/tmp/graph14364417257446180287.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:25:02] [INFO ] Decomposing Gal with order
[2025-06-03 03:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:25:02] [INFO ] Removed a total of 1056 redundant transitions.
[2025-06-03 03:25:02] [INFO ] Flatten gal took : 80 ms
[2025-06-03 03:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 309 labels/synchronizations in 12 ms.
[2025-06-03 03:25:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5363432019286169690.gal : 7 ms
[2025-06-03 03:25:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7064367558490759806.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/ReachabilityCardinality5363432019286169690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7064367558490759806.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/ReachabilityCardinality7064367558490759806.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 28
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :28 after 36
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :36 after 73
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :73 after 108
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :108 after 229
Interrupted probabilistic random walk after 366159 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366159 steps, saw 198330 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-03 03:25:03] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:25:03] [INFO ] Invariant cache hit.
[2025-06-03 03:25:03] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :229 after 790
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/443 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :790 after 2026
[2025-06-03 03:25:04] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:04] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:04] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:05] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2026 after 7266
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2970ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-06-03 03:25:06] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:25:07] [INFO ] Implicit Places using invariants in 704 ms returned []
[2025-06-03 03:25:07] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:25:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:25:14] [INFO ] Implicit Places using invariants and state equation in 6650 ms returned []
Implicit Place search using SMT with State Equation took 7364 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:25:14] [INFO ] Redundant transitions in 8 ms returned []
Running 1072 sub problems to find dead transitions.
[2025-06-03 03:25:14] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-03 03:25:14] [INFO ] Invariant cache hit.
[2025-06-03 03:25:14] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:25] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:25] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:25] [INFO ] Deduced a trap composed of 45 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 03:25:25] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:25] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:26] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:26] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7266 after 23293
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:29] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:37] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 18 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23293 after 43744
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 51 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :43744 after 127748
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:55] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:55] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:25:55] [INFO ] Deduced a trap composed of 145 places in 246 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:00] [INFO ] Deduced a trap composed of 276 places in 268 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:09] [INFO ] Deduced a trap composed of 143 places in 251 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:09] [INFO ] Deduced a trap composed of 150 places in 270 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:10] [INFO ] Deduced a trap composed of 264 places in 251 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:12] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:12] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61040ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 61042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68438 ms. Remains : 448/448 places, 1074/1074 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-10 in 227660 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-15
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-03 03:26:15] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-03 03:26:15] [INFO ] Computed 44 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (3 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (4 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-03 03:26:15] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-03 03:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:26:15] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-03 03:26:15] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-03 03:26:15] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2025-06-03 03:26:15] [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 03:26:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-03 03:26:15] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-03 03:26:17] [INFO ] [Nat]Absence check using state equation in 1833 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 448 transition count 1074
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 440 transition count 1066
Applied a total of 48 rules in 58 ms. Remains 440 /464 variables (removed 24) and now considering 1066/1090 (removed 24) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:26:17] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2025-06-03 03:26:17] [INFO ] Computed 44 invariants in 16 ms
[2025-06-03 03:26:17] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:28] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:28] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:28] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:28] [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 03:26:28] [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 03:26:29] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:29] [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 03:26:29] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:31] [INFO ] Deduced a trap composed of 268 places in 252 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:35] [INFO ] Deduced a trap composed of 150 places in 263 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:36] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 58 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:44] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:45] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:26:45] [INFO ] Deduced a trap composed of 145 places in 248 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 57 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40917ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 40919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40980 ms. Remains : 440/464 places, 1066/1090 transitions.
[2025-06-03 03:26:58] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:26:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (449 resets) in 3627 ms. (275 steps per ms)
BEST_FIRST walk for 1000000 steps (153 resets) in 1799 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-03 03:27:04] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 03:27:04] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-03 03:27:04] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-03 03:27:04] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2025-06-03 03:27:04] [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 03:27:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 03:27:04] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 24 ms returned sat
[2025-06-03 03:27:05] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2025-06-03 03:27:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:27:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 594 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:05] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:06] [INFO ] Deduced a trap composed of 145 places in 251 ms of which 35 ms to minimize.
[2025-06-03 03:27:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2025-06-03 03:27:06] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 60 ms.
[2025-06-03 03:27:07] [INFO ] Added : 50 causal constraints over 10 iterations in 1077 ms. Result :sat
Minimization took 4534 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 18 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-03 03:27:11] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:27:12] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-06-03 03:27:12] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:27:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:27:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:27:21] [INFO ] Implicit Places using invariants and state equation in 8383 ms returned []
Implicit Place search using SMT with State Equation took 9056 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:27:21] [INFO ] Redundant transitions in 9 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:27:21] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:27:21] [INFO ] Invariant cache hit.
[2025-06-03 03:27:21] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:30] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:30] [INFO ] Deduced a trap composed of 44 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 03:27:30] [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 03:27:31] [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 03:27:31] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:31] [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 03:27:31] [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 03:27:31] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:31] [INFO ] Deduced a trap composed of 153 places in 274 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:32] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:42] [INFO ] Deduced a trap composed of 145 places in 246 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:42] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:43] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:47] [INFO ] Deduced a trap composed of 268 places in 246 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:27:51] [INFO ] Deduced a trap composed of 150 places in 258 ms of which 61 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 57 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:13] [INFO ] Deduced a trap composed of 122 places in 257 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60976ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 60978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70065 ms. Remains : 440/440 places, 1066/1066 transitions.
[2025-06-03 03:28:22] [INFO ] Flatten gal took : 34 ms
[2025-06-03 03:28:22] [INFO ] Flatten gal took : 33 ms
[2025-06-03 03:28:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4932690307159412571.gal : 6 ms
[2025-06-03 03:28:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6781708974792395415.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/ReachabilityCardinality4932690307159412571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6781708974792395415.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
RANDOM walk for 40000 steps (21 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6781708974792395415.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 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 497
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :497 after 588
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :588 after 1358
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1358 after 2462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2462 after 7412
Interrupted probabilistic random walk after 260349 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 260349 steps, saw 144751 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-06-03 03:28:25] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:28:25] [INFO ] Invariant cache hit.
[2025-06-03 03:28:25] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 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 03:28:25] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:25] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:25] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:25] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:25] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7412 after 14374
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 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 03:28:27] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:27] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 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 03:28:29] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:29] [INFO ] Deduced a trap composed of 145 places in 284 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:30] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 67 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4097 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6058ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43536 after 43644
Parikh walk visited 0 properties in 1820 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:28:33] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:28:33] [INFO ] Invariant cache hit.
[2025-06-03 03:28:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:42] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28: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 03:28:43] [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 03:28:43] [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 03:28:43] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:43] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:43] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:43] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:43] [INFO ] Deduced a trap composed of 153 places in 275 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:28:44] [INFO ] Deduced a trap composed of 160 places in 271 ms of which 62 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :43644 after 89102
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 52 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :89102 after 236262
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:06] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 03:29:12] [INFO ] Flatten gal took : 33 ms
[2025-06-03 03:29:12] [INFO ] Applying decomposition
[2025-06-03 03:29:12] [INFO ] Flatten gal took : 32 ms
[2025-06-03 03:29:12] [INFO ] Deduced a trap composed of 268 places in 257 ms of which 67 ms to minimize.
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/graph4361560906298812395.txt' '-o' '/tmp/graph4361560906298812395.bin' '-w' '/tmp/graph4361560906298812395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4361560906298812395.bin' '-l' '-1' '-v' '-w' '/tmp/graph4361560906298812395.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:29:12] [INFO ] Decomposing Gal with order
[2025-06-03 03:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:29:12] [INFO ] Removed a total of 830 redundant transitions.
[2025-06-03 03:29:12] [INFO ] Flatten gal took : 104 ms
[2025-06-03 03:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 14 ms.
[2025-06-03 03:29:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality714397285790512414.gal : 8 ms
[2025-06-03 03:29:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1050612617533246116.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/ReachabilityCardinality714397285790512414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1050612617533246116.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 ...327
Loading property file /tmp/ReachabilityCardinality1050612617533246116.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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :63 after 108
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40953ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 40955ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40972 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (16 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :108 after 888
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :888 after 930
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :930 after 991
Interrupted probabilistic random walk after 261248 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 261248 steps, saw 145204 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2025-06-03 03:29:17] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:29:17] [INFO ] Invariant cache hit.
[2025-06-03 03:29:17] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 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 03:29:17] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:17] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:17] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:17] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :991 after 1277
[2025-06-03 03:29:18] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 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 03:29:19] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:19] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/589 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 03:29:21] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
[2025-06-03 03:29:21] [INFO ] Deduced a trap composed of 145 places in 283 ms of which 66 ms to minimize.
SDD size :1277 after 12341
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:22] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 65 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6020ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2030 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-03 03:29:25] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:29:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:29:26] [INFO ] Implicit Places using invariants in 657 ms returned []
[2025-06-03 03:29:26] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:29:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:29:34] [INFO ] Implicit Places using invariants and state equation in 8207 ms returned []
Implicit Place search using SMT with State Equation took 8871 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:29:34] [INFO ] Redundant transitions in 10 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-03 03:29:34] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 03:29:34] [INFO ] Invariant cache hit.
[2025-06-03 03:29:34] [INFO ] State equation strengthened by 96 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 :12341 after 45301
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:43] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:43] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [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 03:29:44] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:44] [INFO ] Deduced a trap composed of 153 places in 259 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:45] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:55] [INFO ] Deduced a trap composed of 145 places in 235 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:55] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:29:56] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:30:01] [INFO ] Deduced a trap composed of 268 places in 242 ms of which 55 ms to minimize.
Detected timeout of ITS tools.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:30:04] [INFO ] Deduced a trap composed of 150 places in 256 ms of which 60 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 57 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:30:24] [INFO ] Deduced a trap composed of 122 places in 232 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61063ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69969 ms. Remains : 440/440 places, 1066/1066 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-15 in 259943 ms.
[2025-06-03 03:30:35] [INFO ] Flatten gal took : 32 ms
[2025-06-03 03:30:35] [INFO ] Applying decomposition
[2025-06-03 03:30:35] [INFO ] Flatten gal took : 32 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/graph6609786807629824.txt' '-o' '/tmp/graph6609786807629824.bin' '-w' '/tmp/graph6609786807629824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6609786807629824.bin' '-l' '-1' '-v' '-w' '/tmp/graph6609786807629824.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:30:35] [INFO ] Decomposing Gal with order
[2025-06-03 03:30:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:30:35] [INFO ] Removed a total of 853 redundant transitions.
[2025-06-03 03:30:35] [INFO ] Flatten gal took : 86 ms
[2025-06-03 03:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 502 labels/synchronizations in 12 ms.
[2025-06-03 03:30:35] [INFO ] Time to serialize gal into /tmp/UpperBounds18045596261230424705.gal : 7 ms
[2025-06-03 03:30:35] [INFO ] Time to serialize properties into /tmp/UpperBounds3221537688683597184.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/UpperBounds18045596261230424705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3221537688683597184.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/UpperBounds3221537688683597184.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,4.82456e+07,534.571,8086976,2,225240,5,1.41911e+07,6,0,3136,1.32934e+07,0
Total reachable state count : 48245592
Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-01 :0 <= gi8.gu31.NotifyEventJobQueuedE_0+gi8.gu31.NotifyEventJobQueuedE_1+gi8.gu31.NotifyEventJobQueue...328
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-01 2 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-S02J06T08-UpperBounds-01,0,534.783,8086976,1,0,7,1.41911e+07,9,1,4482,1.32934e+07,4
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-08 :0 <= gi8.gu31.P_1159_0+gi8.gu31.P_1159_1+gi8.gu31.P_1159_2+gi8.gu25.P_1159_3+gi8.gu31.P_1159_4+gi8....208
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-08 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-S02J06T08-UpperBounds-08,0,534.937,8086976,1,0,7,1.41911e+07,10,1,5146,1.32934e+07,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-09 :0 <= gi8.gu31.P_2318_0+gi8.gu31.P_2318_1+gi8.gu31.P_2318_2+gi8.gu25.P_2318_3+gi8.gu31.P_2318_4+gi8....208
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-09 2 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-S02J06T08-UpperBounds-09,0,535.148,8086976,1,0,8,1.41911e+07,11,1,6014,1.32934e+07,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-10 :0 <= gi8.gu31.P_1113_0+gi8.gu31.P_1113_1+gi8.gu31.P_1113_2+gi8.gu25.P_1113_3+gi8.gu31.P_1113_4+gi8....208
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-10 2 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-S02J06T08-UpperBounds-10,0,535.277,8086976,1,0,9,1.41911e+07,12,1,6696,1.32934e+07,7
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-15 :0 <= gi8.gu31.P_1160_0+gi8.gu31.P_1160_1+gi8.gu31.P_1160_2+gi8.gu25.P_1160_3+gi8.gu31.P_1160_4+gi8....208
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-15 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-S02J06T08-UpperBounds-15,0,535.393,8086976,1,0,9,1.41911e+07,13,1,7356,1.32934e+07,8
Total runtime 2236893 ms.
BK_STOP 1748921972299
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-S02J06T08"
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-S02J06T08, 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-174881253800301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;