About the Execution of ITS-Tools for Szymanski-PT-b06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 0 ? 1 0 1 0 1 1 ? 1 ? 0 1 1 1 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589300149.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 Szymanski-PT-b06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589300149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K 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 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Szymanski-PT-b06-UpperBounds-00
FORMULA_NAME Szymanski-PT-b06-UpperBounds-01
FORMULA_NAME Szymanski-PT-b06-UpperBounds-02
FORMULA_NAME Szymanski-PT-b06-UpperBounds-03
FORMULA_NAME Szymanski-PT-b06-UpperBounds-04
FORMULA_NAME Szymanski-PT-b06-UpperBounds-05
FORMULA_NAME Szymanski-PT-b06-UpperBounds-06
FORMULA_NAME Szymanski-PT-b06-UpperBounds-07
FORMULA_NAME Szymanski-PT-b06-UpperBounds-08
FORMULA_NAME Szymanski-PT-b06-UpperBounds-09
FORMULA_NAME Szymanski-PT-b06-UpperBounds-10
FORMULA_NAME Szymanski-PT-b06-UpperBounds-11
FORMULA_NAME Szymanski-PT-b06-UpperBounds-12
FORMULA_NAME Szymanski-PT-b06-UpperBounds-13
FORMULA_NAME Szymanski-PT-b06-UpperBounds-14
FORMULA_NAME Szymanski-PT-b06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749178686589
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 02:58:08] [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-06 02:58:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:58:08] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2025-06-06 02:58:08] [INFO ] Transformed 568 places.
[2025-06-06 02:58:08] [INFO ] Transformed 8320 transitions.
[2025-06-06 02:58:08] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 260 places in 24 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 02:58:08] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 02:58:08] [INFO ] Computed 3 invariants in 60 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 82 ms. (120 steps per ms)
FORMULA Szymanski-PT-b06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (17 resets) in 138 ms. (359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 02:58:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 02:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:09] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2025-06-06 02:58:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:10] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2025-06-06 02:58:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:58:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:11] [INFO ] [Real]Added 147 Read/Feed constraints in 648 ms returned sat
[2025-06-06 02:58:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:11] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 02:58:11] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2025-06-06 02:58:12] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:12] [INFO ] [Nat]Added 147 Read/Feed constraints in 1070 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:12] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:13] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2025-06-06 02:58:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 32 ms returned sat
[2025-06-06 02:58:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:14] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2025-06-06 02:58:14] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1041 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:15] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:15] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-06 02:58:15] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2025-06-06 02:58: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-06 02:58:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 02:58:15] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 02:58:16] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2025-06-06 02:58:17] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 1009 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:18] [INFO ] Deduced a trap composed of 79 places in 846 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:19] [INFO ] Deduced a trap composed of 113 places in 756 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:20] [INFO ] Deduced a trap composed of 130 places in 852 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:21] [INFO ] Deduced a trap composed of 138 places in 935 ms of which 39 ms to minimize.
[2025-06-06 02:58:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:21] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 02:58:21] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 02:58:21] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2025-06-06 02:58:21] [INFO ] [Real]Added 147 Read/Feed constraints in 66 ms returned sat
[2025-06-06 02:58: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-06 02:58:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2025-06-06 02:58:22] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:22] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2025-06-06 02:58:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 1047 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:58:23] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 02:58:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:24] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2025-06-06 02:58:24] [INFO ] [Real]Added 147 Read/Feed constraints in 310 ms returned sat
[2025-06-06 02:58: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-06 02:58:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:58:25] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2025-06-06 02:58:25] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 02:58:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 1043 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 456 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 02:58:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 02:58:26] [INFO ] Computed 3 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000001 steps (2 resets) in 1836 ms. (544 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 5281 ms. (946 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 02:58:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:58:33] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:34] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-06-06 02:58:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:58:34] [INFO ] [Real]Added 147 Read/Feed constraints in 93 ms returned sat
[2025-06-06 02:58:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:58:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:58:35] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-06-06 02:58:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 2729 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:38] [INFO ] Deduced a trap composed of 37 places in 760 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:39] [INFO ] Deduced a trap composed of 50 places in 779 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:40] [INFO ] Deduced a trap composed of 78 places in 755 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:41] [INFO ] Deduced a trap composed of 84 places in 795 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:42] [INFO ] Deduced a trap composed of 129 places in 813 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:42] [INFO ] Deduced a trap composed of 129 places in 814 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:43] [INFO ] Deduced a trap composed of 137 places in 498 ms of which 19 ms to minimize.
[2025-06-06 02:58:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5739 ms
[2025-06-06 02:58:44] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 1011 ms.
[2025-06-06 02:58:44] [INFO ] Added : 0 causal constraints over 0 iterations in 1208 ms. Result :sat
Minimization took 4912 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:58:49] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-06 02:58:50] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2025-06-06 02:58:50] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2025-06-06 02:58:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:58:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 02:58:50] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-06 02:58:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 3981 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:55] [INFO ] Deduced a trap composed of 129 places in 750 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:58:56] [INFO ] Deduced a trap composed of 129 places in 698 ms of which 58 ms to minimize.
[2025-06-06 02:58:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1643 ms
[2025-06-06 02:58:57] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 491 ms.
[2025-06-06 02:58:57] [INFO ] Added : 0 causal constraints over 0 iterations in 693 ms. Result :sat
Minimization took 4905 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:59:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:02] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2025-06-06 02:59:02] [INFO ] [Real]Added 147 Read/Feed constraints in 95 ms returned sat
[2025-06-06 02:59:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:59:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:03] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2025-06-06 02:59:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 2020 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:06] [INFO ] Deduced a trap composed of 111 places in 808 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:07] [INFO ] Deduced a trap composed of 129 places in 794 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:07] [INFO ] Deduced a trap composed of 129 places in 683 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:08] [INFO ] Deduced a trap composed of 137 places in 585 ms of which 39 ms to minimize.
[2025-06-06 02:59:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3189 ms
[2025-06-06 02:59:09] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 478 ms.
[2025-06-06 02:59:09] [INFO ] Added : 0 causal constraints over 0 iterations in 660 ms. Result :sat
Minimization took 4910 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:59:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:14] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2025-06-06 02:59:14] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2025-06-06 02:59: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-06 02:59:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:15] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-06-06 02:59:16] [INFO ] [Nat]Added 147 Read/Feed constraints in 1482 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:17] [INFO ] Deduced a trap composed of 129 places in 769 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:18] [INFO ] Deduced a trap composed of 129 places in 739 ms of which 58 ms to minimize.
[2025-06-06 02:59:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1682 ms
[2025-06-06 02:59:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 497 ms.
[2025-06-06 02:59:19] [INFO ] Added : 0 causal constraints over 0 iterations in 654 ms. Result :sat
Minimization took 4912 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:59:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:24] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-06 02:59:24] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2025-06-06 02:59:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:59:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:59:25] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2025-06-06 02:59:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 870 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:27] [INFO ] Deduced a trap composed of 37 places in 741 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:27] [INFO ] Deduced a trap composed of 50 places in 700 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:28] [INFO ] Deduced a trap composed of 84 places in 681 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:29] [INFO ] Deduced a trap composed of 129 places in 748 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:30] [INFO ] Deduced a trap composed of 129 places in 714 ms of which 84 ms to minimize.
[2025-06-06 02:59:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4254 ms
[2025-06-06 02:59:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 494 ms.
[2025-06-06 02:59:31] [INFO ] Added : 2 causal constraints over 1 iterations in 760 ms. Result :sat
Minimization took 4911 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 356 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 409 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 02:59:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:59:38] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2025-06-06 02:59:38] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:59:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:59:56] [INFO ] Implicit Places using invariants and state equation in 17356 ms returned []
Implicit Place search using SMT with State Equation took 19342 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:59:57] [INFO ] Redundant transitions in 873 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 02:59:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:59:57] [INFO ] Invariant cache hit.
[2025-06-06 02:59:57] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:00:59] [INFO ] Deduced a trap composed of 138 places in 531 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:00] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:01] [INFO ] Deduced a trap composed of 36 places in 485 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:01] [INFO ] Deduced a trap composed of 37 places in 515 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:02] [INFO ] Deduced a trap composed of 42 places in 460 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:03] [INFO ] Deduced a trap composed of 45 places in 531 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:03] [INFO ] Deduced a trap composed of 44 places in 367 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:03] [INFO ] Deduced a trap composed of 57 places in 357 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:04] [INFO ] Deduced a trap composed of 74 places in 380 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:04] [INFO ] Deduced a trap composed of 57 places in 378 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:05] [INFO ] Deduced a trap composed of 72 places in 448 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:05] [INFO ] Deduced a trap composed of 78 places in 526 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:06] [INFO ] Deduced a trap composed of 110 places in 452 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:06] [INFO ] Deduced a trap composed of 134 places in 327 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:07] [INFO ] Deduced a trap composed of 75 places in 499 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:07] [INFO ] Deduced a trap composed of 101 places in 445 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:08] [INFO ] Deduced a trap composed of 111 places in 521 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:09] [INFO ] Deduced a trap composed of 137 places in 344 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:09] [INFO ] Deduced a trap composed of 122 places in 498 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:10] [INFO ] Deduced a trap composed of 195 places in 320 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 23 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75564ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 75633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96325 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40004 steps (8 resets) in 971 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
[2025-06-06 03:01:14] [INFO ] Flatten gal took : 735 ms
[2025-06-06 03:01:15] [INFO ] Flatten gal took : 300 ms
[2025-06-06 03:01:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality936085639646898969.gal : 114 ms
[2025-06-06 03:01:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7589708903133130165.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/ReachabilityCardinality936085639646898969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7589708903133130165.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/ReachabilityCardinality7589708903133130165.prop.
Interrupted probabilistic random walk after 117974 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 10
Probabilistic random walk after 117974 steps, saw 59535 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-06 03:01:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:01:17] [INFO ] Invariant cache hit.
[2025-06-06 03:01:17] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :18 after 80
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :80 after 714
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :714 after 11559
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :11559 after 25722
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :25722 after 150696
[2025-06-06 03:01:19] [INFO ] Deduced a trap composed of 31 places in 1000 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:19] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 34 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 512
SDD size :150696 after 268073
[2025-06-06 03:01:20] [INFO ] Deduced a trap composed of 36 places in 784 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:21] [INFO ] Deduced a trap composed of 48 places in 1045 ms of which 52 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 1024
SDD size :268073 after 305696
[2025-06-06 03:01:22] [INFO ] Deduced a trap composed of 75 places in 1171 ms of which 37 ms to minimize.
SMT process timed out in 5396ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40015 steps (8 resets) in 454 ms. (87 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
[2025-06-06 03:01:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:01:23] [INFO ] Invariant cache hit.
[2025-06-06 03:01:23] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:25] [INFO ] Deduced a trap composed of 36 places in 1390 ms of which 38 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 :305696 after 995582
[2025-06-06 03:01:26] [INFO ] Deduced a trap composed of 42 places in 557 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:27] [INFO ] Deduced a trap composed of 48 places in 593 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:28] [INFO ] Deduced a trap composed of 72 places in 1069 ms of which 60 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 4096
SDD size :995582 after 4.38018e+06
[2025-06-06 03:01:29] [INFO ] Deduced a trap composed of 75 places in 1128 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:29] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:30] [INFO ] Deduced a trap composed of 50 places in 580 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:31] [INFO ] Deduced a trap composed of 58 places in 588 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:31] [INFO ] Deduced a trap composed of 78 places in 576 ms of which 55 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 8192
SDD size :4.38018e+06 after 7.37855e+06
[2025-06-06 03:01:32] [INFO ] Deduced a trap composed of 129 places in 1018 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:33] [INFO ] Deduced a trap composed of 134 places in 391 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:33] [INFO ] Deduced a trap composed of 64 places in 622 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:34] [INFO ] Deduced a trap composed of 77 places in 489 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:34] [INFO ] Deduced a trap composed of 138 places in 528 ms of which 71 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:35] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:37] [INFO ] Deduced a trap composed of 144 places in 1277 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:42] [INFO ] Deduced a trap composed of 208 places in 5070 ms of which 60 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :7.37855e+06 after 1.61178e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:43] [INFO ] Deduced a trap composed of 211 places in 1131 ms of which 52 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 0 solved, 8 unsolved in 31335 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:57] [INFO ] Deduced a trap composed of 152 places in 1151 ms of which 66 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Detected timeout of ITS tools.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 03:02:05] [INFO ] Flatten gal took : 228 ms
[2025-06-06 03:02:05] [INFO ] Applying decomposition
[2025-06-06 03:02:05] [INFO ] Flatten gal took : 219 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/graph2395592126856863435.txt' '-o' '/tmp/graph2395592126856863435.bin' '-w' '/tmp/graph2395592126856863435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2395592126856863435.bin' '-l' '-1' '-v' '-w' '/tmp/graph2395592126856863435.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:02:07] [INFO ] Decomposing Gal with order
[2025-06-06 03:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:02:08] [INFO ] Removed a total of 17886 redundant transitions.
[2025-06-06 03:02:08] [INFO ] Flatten gal took : 1081 ms
[2025-06-06 03:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1247 labels/synchronizations in 349 ms.
[2025-06-06 03:02:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11752151774574203912.gal : 49 ms
[2025-06-06 03:02:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4205210153115289117.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/ReachabilityCardinality11752151774574203912.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4205210153115289117.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality4205210153115289117.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :8 after 51
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :51 after 630
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :630 after 10761
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :10761 after 23271
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :23271 after 27629
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :27629 after 29057
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :29057 after 29417
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :29417 after 63843
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 482 constraints, problems are : Problem set: 0 solved, 8 unsolved in 28729 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1364 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40010 steps (8 resets) in 356 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 156600 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 8
Probabilistic random walk after 156600 steps, saw 79494 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-06 03:02:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:02:29] [INFO ] Invariant cache hit.
[2025-06-06 03:02:29] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:30] [INFO ] Deduced a trap composed of 36 places in 596 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:30] [INFO ] Deduced a trap composed of 42 places in 507 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:31] [INFO ] Deduced a trap composed of 48 places in 491 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:31] [INFO ] Deduced a trap composed of 72 places in 499 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:32] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:32] [INFO ] Deduced a trap composed of 129 places in 518 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:33] [INFO ] Deduced a trap composed of 50 places in 511 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:33] [INFO ] Deduced a trap composed of 58 places in 512 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:34] [INFO ] Deduced a trap composed of 78 places in 506 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:34] [INFO ] Deduced a trap composed of 129 places in 503 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:35] [INFO ] Deduced a trap composed of 134 places in 270 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :63843 after 162289
[2025-06-06 03:02:35] [INFO ] Deduced a trap composed of 64 places in 462 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:36] [INFO ] Deduced a trap composed of 77 places in 501 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:36] [INFO ] Deduced a trap composed of 138 places in 579 ms of which 73 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:37] [INFO ] Deduced a trap composed of 72 places in 381 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 470 constraints, problems are : Problem set: 0 solved, 8 unsolved in 19561 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:49] [INFO ] Deduced a trap composed of 152 places in 495 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:50] [INFO ] Deduced a trap composed of 144 places in 493 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:02:50] [INFO ] Deduced a trap composed of 155 places in 438 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Detected timeout of ITS tools.
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:03:04] [INFO ] Deduced a trap composed of 137 places in 305 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:03:06] [INFO ] Deduced a trap composed of 50 places in 462 ms of which 21 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2909 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/2909 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 483 constraints, problems are : Problem set: 0 solved, 8 unsolved in 38651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58240ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 1292 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b06-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for Szymanski-PT-b06-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:03:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:03:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10003 steps (2 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:03:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:03:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:03:29] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-06 03:03:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:03:29] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2025-06-06 03:03: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-06 03:03:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:03:30] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2025-06-06 03:03:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 03:03:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 1041 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p253) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 03:03:31] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 03:03:31] [INFO ] Computed 3 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000004 steps (2 resets) in 1551 ms. (644 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1211 ms. (825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:03:34] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:03:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:03:34] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2025-06-06 03:03:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:03:34] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2025-06-06 03:03:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:03:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:03:35] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2025-06-06 03:03:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 616 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:03:36] [INFO ] Deduced a trap composed of 37 places in 764 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:03:37] [INFO ] Deduced a trap composed of 129 places in 791 ms of which 58 ms to minimize.
[2025-06-06 03:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1750 ms
[2025-06-06 03:03:38] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 432 ms.
[2025-06-06 03:03:38] [INFO ] Added : 0 causal constraints over 0 iterations in 612 ms. Result :sat
Minimization took 5084 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:03:43] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:03:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:03:45] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2025-06-06 03:03:45] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:03:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:03:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:04:13] [INFO ] Implicit Places using invariants and state equation in 27316 ms returned []
Implicit Place search using SMT with State Equation took 29183 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:04:13] [INFO ] Redundant transitions in 875 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:04:13] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:04:13] [INFO ] Invariant cache hit.
[2025-06-06 03:04:14] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:08] [INFO ] Deduced a trap composed of 92 places in 486 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:08] [INFO ] Deduced a trap composed of 93 places in 527 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:10] [INFO ] Deduced a trap composed of 81 places in 405 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:10] [INFO ] Deduced a trap composed of 31 places in 568 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:11] [INFO ] Deduced a trap composed of 44 places in 579 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:11] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:12] [INFO ] Deduced a trap composed of 48 places in 596 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:13] [INFO ] Deduced a trap composed of 75 places in 557 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:14] [INFO ] Deduced a trap composed of 42 places in 530 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:15] [INFO ] Deduced a trap composed of 115 places in 563 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:16] [INFO ] Deduced a trap composed of 131 places in 532 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:20] [INFO ] Deduced a trap composed of 42 places in 529 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:20] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:21] [INFO ] Deduced a trap composed of 88 places in 449 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:22] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:23] [INFO ] Deduced a trap composed of 97 places in 605 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:24] [INFO ] Deduced a trap composed of 105 places in 558 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:25] [INFO ] Deduced a trap composed of 128 places in 554 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:27] [INFO ] Deduced a trap composed of 79 places in 563 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:28] [INFO ] Deduced a trap composed of 84 places in 570 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75527ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 75554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105828 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40015 steps (8 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2025-06-06 03:05:29] [INFO ] Flatten gal took : 244 ms
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
[2025-06-06 03:05:30] [INFO ] Flatten gal took : 327 ms
[2025-06-06 03:05:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3366291962798387551.gal : 44 ms
[2025-06-06 03:05:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17223935120611482310.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/ReachabilityCardinality3366291962798387551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17223935120611482310.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/ReachabilityCardinality17223935120611482310.prop.
Interrupted probabilistic random walk after 148194 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 148194 steps, saw 74774 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2025-06-06 03:05:32] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:05:32] [INFO ] Invariant cache hit.
[2025-06-06 03:05:32] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 714
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :714 after 11559
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11559 after 25722
[2025-06-06 03:05:33] [INFO ] Deduced a trap composed of 31 places in 595 ms of which 36 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 256
SDD size :25722 after 150696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :150696 after 268073
[2025-06-06 03:05:36] [INFO ] Deduced a trap composed of 45 places in 3080 ms of which 48 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 1024
SDD size :268073 after 305696
[2025-06-06 03:05:37] [INFO ] Deduced a trap composed of 129 places in 1039 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:38] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 53 ms to minimize.
SMT process timed out in 5550ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :305696 after 995582
Interrupted probabilistic random walk after 171918 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 171918 steps, saw 82435 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
[2025-06-06 03:05:41] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:05:41] [INFO ] Invariant cache hit.
[2025-06-06 03:05:41] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:42] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:42] [INFO ] Deduced a trap composed of 45 places in 530 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:43] [INFO ] Deduced a trap composed of 129 places in 511 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:44] [INFO ] Deduced a trap composed of 129 places in 510 ms of which 54 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :995582 after 4.38018e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3270 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:45] [INFO ] Deduced a trap composed of 50 places in 492 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:46] [INFO ] Deduced a trap composed of 77 places in 437 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:46] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.38018e+06 after 7.37855e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2908 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2908 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10454ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:05:52] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:05:54] [INFO ] Implicit Places using invariants in 1863 ms returned []
[2025-06-06 03:05:54] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:05:55] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.37855e+06 after 1.61178e+07
Detected timeout of ITS tools.
[2025-06-06 03:06:21] [INFO ] Flatten gal took : 273 ms
[2025-06-06 03:06:21] [INFO ] Applying decomposition
[2025-06-06 03:06:21] [INFO ] Flatten gal took : 235 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/graph13104124676603442990.txt' '-o' '/tmp/graph13104124676603442990.bin' '-w' '/tmp/graph13104124676603442990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13104124676603442990.bin' '-l' '-1' '-v' '-w' '/tmp/graph13104124676603442990.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:06:22] [INFO ] Decomposing Gal with order
[2025-06-06 03:06:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:06:22] [INFO ] Implicit Places using invariants and state equation in 27787 ms returned []
Implicit Place search using SMT with State Equation took 29671 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:06:22] [INFO ] Removed a total of 17583 redundant transitions.
[2025-06-06 03:06:22] [INFO ] Flatten gal took : 456 ms
[2025-06-06 03:06:23] [INFO ] Redundant transitions in 685 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:06:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1052 labels/synchronizations in 211 ms.
[2025-06-06 03:06:23] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:06:23] [INFO ] Invariant cache hit.
[2025-06-06 03:06:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1870749463124397772.gal : 28 ms
[2025-06-06 03:06:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14433490149450262745.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/ReachabilityCardinality1870749463124397772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14433490149450262745.prop' '--nowitness'
[2025-06-06 03:06:23] [INFO ] State equation strengthened by 147 read => feed constraints.
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 ...308
Loading property file /tmp/ReachabilityCardinality14433490149450262745.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 162
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :162 after 607
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :607 after 1659
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1659 after 6008
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6008 after 11103
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11103 after 11865
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11865 after 11865
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11865 after 11865
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11865 after 81501
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:17] [INFO ] Deduced a trap composed of 92 places in 620 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:17] [INFO ] Deduced a trap composed of 93 places in 567 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:18] [INFO ] Deduced a trap composed of 81 places in 433 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:19] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:20] [INFO ] Deduced a trap composed of 44 places in 491 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:20] [INFO ] Deduced a trap composed of 72 places in 560 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:21] [INFO ] Deduced a trap composed of 48 places in 561 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:21] [INFO ] Deduced a trap composed of 75 places in 542 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:23] [INFO ] Deduced a trap composed of 42 places in 505 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:24] [INFO ] Deduced a trap composed of 115 places in 579 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:25] [INFO ] Deduced a trap composed of 131 places in 513 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:29] [INFO ] Deduced a trap composed of 42 places in 519 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:29] [INFO ] Deduced a trap composed of 47 places in 486 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:30] [INFO ] Deduced a trap composed of 88 places in 526 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:31] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:32] [INFO ] Deduced a trap composed of 97 places in 663 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:33] [INFO ] Deduced a trap composed of 105 places in 640 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:34] [INFO ] Deduced a trap composed of 128 places in 674 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:37] [INFO ] Deduced a trap composed of 79 places in 577 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:37] [INFO ] Deduced a trap composed of 84 places in 624 ms of which 37 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75085ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 75138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105781 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b06-UpperBounds-01 in 249526 ms.
Starting property specific reduction for Szymanski-PT-b06-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:07:38] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 03:07:38] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10003 steps (2 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:07:38] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:07:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 03:07:39] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2025-06-06 03:07:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:07:39] [INFO ] [Real]Added 147 Read/Feed constraints in 99 ms returned sat
[2025-06-06 03:07:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:07:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:07:39] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2025-06-06 03:07:40] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 03:07:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p228) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 03:07:40] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 03:07:41] [INFO ] Computed 3 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000005 steps (2 resets) in 1665 ms. (600 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1186 ms. (842 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:07:43] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:07:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:07:44] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2025-06-06 03:07:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:07:44] [INFO ] [Real]Added 147 Read/Feed constraints in 126 ms returned sat
[2025-06-06 03:07:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:07:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:07:45] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2025-06-06 03:07:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 827 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:46] [INFO ] Deduced a trap composed of 37 places in 787 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:47] [INFO ] Deduced a trap composed of 129 places in 777 ms of which 57 ms to minimize.
[2025-06-06 03:07:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1751 ms
[2025-06-06 03:07:48] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 426 ms.
[2025-06-06 03:07:48] [INFO ] Added : 0 causal constraints over 0 iterations in 613 ms. Result :sat
Minimization took 5006 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:07:53] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:55] [INFO ] Implicit Places using invariants in 1854 ms returned []
[2025-06-06 03:07:55] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:07:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:08:19] [INFO ] Implicit Places using invariants and state equation in 23598 ms returned []
Implicit Place search using SMT with State Equation took 25456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:08:19] [INFO ] Redundant transitions in 632 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:08:19] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:08:19] [INFO ] Invariant cache hit.
[2025-06-06 03:08:19] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:12] [INFO ] Deduced a trap composed of 92 places in 556 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:13] [INFO ] Deduced a trap composed of 93 places in 524 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:14] [INFO ] Deduced a trap composed of 81 places in 420 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:15] [INFO ] Deduced a trap composed of 31 places in 547 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:15] [INFO ] Deduced a trap composed of 44 places in 532 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:16] [INFO ] Deduced a trap composed of 72 places in 612 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:17] [INFO ] Deduced a trap composed of 48 places in 567 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:17] [INFO ] Deduced a trap composed of 75 places in 573 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:19] [INFO ] Deduced a trap composed of 42 places in 537 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:20] [INFO ] Deduced a trap composed of 115 places in 505 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:21] [INFO ] Deduced a trap composed of 131 places in 511 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:24] [INFO ] Deduced a trap composed of 42 places in 573 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:25] [INFO ] Deduced a trap composed of 47 places in 552 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:26] [INFO ] Deduced a trap composed of 88 places in 518 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:27] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:28] [INFO ] Deduced a trap composed of 97 places in 648 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:29] [INFO ] Deduced a trap composed of 105 places in 602 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:30] [INFO ] Deduced a trap composed of 128 places in 614 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:32] [INFO ] Deduced a trap composed of 79 places in 607 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:33] [INFO ] Deduced a trap composed of 84 places in 647 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74207ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 74224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100539 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40011 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
[2025-06-06 03:09:34] [INFO ] Flatten gal took : 238 ms
[2025-06-06 03:09:34] [INFO ] Flatten gal took : 217 ms
[2025-06-06 03:09:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11828069833526913401.gal : 30 ms
[2025-06-06 03:09:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality926880095840221103.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/ReachabilityCardinality11828069833526913401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality926880095840221103.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/ReachabilityCardinality926880095840221103.prop.
Interrupted probabilistic random walk after 152453 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 152453 steps, saw 76592 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-06 03:09:37] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:09:37] [INFO ] Invariant cache hit.
[2025-06-06 03:09:37] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 714
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :714 after 11559
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11559 after 25722
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :25722 after 150696
[2025-06-06 03:09:38] [INFO ] Deduced a trap composed of 31 places in 537 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:38] [INFO ] Deduced a trap composed of 129 places in 514 ms of which 44 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 512
SDD size :150696 after 268073
[2025-06-06 03:09:39] [INFO ] Deduced a trap composed of 129 places in 528 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:39] [INFO ] Deduced a trap composed of 45 places in 503 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3250 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :268073 after 305696
[2025-06-06 03:09:41] [INFO ] Deduced a trap composed of 59 places in 504 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2878 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6149ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :305696 after 995582
Interrupted probabilistic random walk after 164021 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 164021 steps, saw 81276 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2025-06-06 03:09:47] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:09:47] [INFO ] Invariant cache hit.
[2025-06-06 03:09:47] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:47] [INFO ] Deduced a trap composed of 31 places in 564 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:48] [INFO ] Deduced a trap composed of 129 places in 604 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:48] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 53 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 :995582 after 4.38018e+06
[2025-06-06 03:09:49] [INFO ] Deduced a trap composed of 45 places in 542 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:51] [INFO ] Deduced a trap composed of 59 places in 517 ms of which 43 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.38018e+06 after 7.37855e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/2908 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2908 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 462 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6764ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:09:54] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:09:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:56] [INFO ] Implicit Places using invariants in 1860 ms returned []
[2025-06-06 03:09:56] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:56] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.37855e+06 after 1.61178e+07
[2025-06-06 03:10:19] [INFO ] Implicit Places using invariants and state equation in 23207 ms returned []
Implicit Place search using SMT with State Equation took 25088 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:10:20] [INFO ] Redundant transitions in 605 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:10:20] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:10:20] [INFO ] Invariant cache hit.
[2025-06-06 03:10:20] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-06 03:10:25] [INFO ] Flatten gal took : 771 ms
[2025-06-06 03:10:25] [INFO ] Applying decomposition
[2025-06-06 03:10:25] [INFO ] Flatten gal took : 208 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/graph8437550171052273991.txt' '-o' '/tmp/graph8437550171052273991.bin' '-w' '/tmp/graph8437550171052273991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8437550171052273991.bin' '-l' '-1' '-v' '-w' '/tmp/graph8437550171052273991.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:10:27] [INFO ] Decomposing Gal with order
[2025-06-06 03:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:10:27] [INFO ] Removed a total of 18107 redundant transitions.
[2025-06-06 03:10:27] [INFO ] Flatten gal took : 354 ms
[2025-06-06 03:10:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1110 labels/synchronizations in 962 ms.
[2025-06-06 03:10:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3101016174774275859.gal : 18 ms
[2025-06-06 03:10:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11414020087731598103.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/ReachabilityCardinality3101016174774275859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11414020087731598103.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality11414020087731598103.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 116
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :116 after 717
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :717 after 2838
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2838 after 13107
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :13107 after 21567
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :21567 after 23997
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23997 after 34803
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :34803 after 43482
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43482 after 45049
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:25] [INFO ] Deduced a trap composed of 92 places in 587 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:25] [INFO ] Deduced a trap composed of 93 places in 561 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:27] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:27] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:28] [INFO ] Deduced a trap composed of 44 places in 476 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:28] [INFO ] Deduced a trap composed of 72 places in 617 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:29] [INFO ] Deduced a trap composed of 48 places in 618 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:30] [INFO ] Deduced a trap composed of 75 places in 512 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:31] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:32] [INFO ] Deduced a trap composed of 115 places in 544 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:33] [INFO ] Deduced a trap composed of 131 places in 529 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:37] [INFO ] Deduced a trap composed of 42 places in 614 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:37] [INFO ] Deduced a trap composed of 47 places in 485 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:38] [INFO ] Deduced a trap composed of 88 places in 477 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:39] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:41] [INFO ] Deduced a trap composed of 97 places in 653 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:41] [INFO ] Deduced a trap composed of 105 places in 607 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:42] [INFO ] Deduced a trap composed of 128 places in 607 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:45] [INFO ] Deduced a trap composed of 79 places in 632 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:45] [INFO ] Deduced a trap composed of 84 places in 610 ms of which 34 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86315ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 86328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112233 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b06-UpperBounds-08 in 248049 ms.
Starting property specific reduction for Szymanski-PT-b06-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:11:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 03:11:46] [INFO ] Computed 3 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:11:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:11:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:11:47] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-06-06 03:11:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:11:47] [INFO ] [Real]Added 147 Read/Feed constraints in 95 ms returned sat
[2025-06-06 03:11:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:11:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:11:47] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2025-06-06 03:11:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 03:11:48] [INFO ] [Nat]Added 147 Read/Feed constraints in 1044 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p151) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 03:11:48] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 03:11:48] [INFO ] Computed 3 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000005 steps (2 resets) in 1692 ms. (590 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1273 ms. (784 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 03:11:51] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:11:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 03:11:52] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-06 03:11:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:11:52] [INFO ] [Real]Added 147 Read/Feed constraints in 72 ms returned sat
[2025-06-06 03:11:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:11:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 03:11:53] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2025-06-06 03:11:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 978 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:54] [INFO ] Deduced a trap composed of 37 places in 736 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:55] [INFO ] Deduced a trap composed of 129 places in 757 ms of which 75 ms to minimize.
[2025-06-06 03:11:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1682 ms
[2025-06-06 03:11:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 448 ms.
[2025-06-06 03:11:56] [INFO ] Added : 0 causal constraints over 0 iterations in 627 ms. Result :sat
Minimization took 5098 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:12:01] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:12:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:03] [INFO ] Implicit Places using invariants in 1830 ms returned []
[2025-06-06 03:12:03] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:12:28] [INFO ] Implicit Places using invariants and state equation in 24780 ms returned []
Implicit Place search using SMT with State Equation took 26618 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:12:29] [INFO ] Redundant transitions in 605 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:12:29] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:12:29] [INFO ] Invariant cache hit.
[2025-06-06 03:12:29] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:21] [INFO ] Deduced a trap composed of 92 places in 488 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:22] [INFO ] Deduced a trap composed of 93 places in 542 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:23] [INFO ] Deduced a trap composed of 81 places in 382 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:24] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:24] [INFO ] Deduced a trap composed of 44 places in 587 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:25] [INFO ] Deduced a trap composed of 72 places in 616 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:26] [INFO ] Deduced a trap composed of 48 places in 586 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:26] [INFO ] Deduced a trap composed of 75 places in 573 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:28] [INFO ] Deduced a trap composed of 42 places in 516 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:29] [INFO ] Deduced a trap composed of 115 places in 589 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:30] [INFO ] Deduced a trap composed of 131 places in 569 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:33] [INFO ] Deduced a trap composed of 42 places in 626 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:34] [INFO ] Deduced a trap composed of 47 places in 584 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:35] [INFO ] Deduced a trap composed of 88 places in 507 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:36] [INFO ] Deduced a trap composed of 36 places in 370 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:37] [INFO ] Deduced a trap composed of 97 places in 604 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:38] [INFO ] Deduced a trap composed of 105 places in 633 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:39] [INFO ] Deduced a trap composed of 128 places in 629 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:41] [INFO ] Deduced a trap composed of 79 places in 667 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:42] [INFO ] Deduced a trap composed of 84 places in 654 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73896ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 73911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101348 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40009 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2025-06-06 03:13:43] [INFO ] Flatten gal took : 184 ms
[2025-06-06 03:13:43] [INFO ] Flatten gal took : 189 ms
[2025-06-06 03:13:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1822989407285542173.gal : 26 ms
[2025-06-06 03:13:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1825966517124063223.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/ReachabilityCardinality1822989407285542173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1825966517124063223.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/ReachabilityCardinality1825966517124063223.prop.
Interrupted probabilistic random walk after 179365 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 179365 steps, saw 83348 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
[2025-06-06 03:13:46] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:13:46] [INFO ] Invariant cache hit.
[2025-06-06 03:13:46] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 714
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :714 after 11559
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11559 after 25722
[2025-06-06 03:13:47] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 39 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 256
SDD size :25722 after 150696
[2025-06-06 03:13:47] [INFO ] Deduced a trap composed of 37 places in 552 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:48] [INFO ] Deduced a trap composed of 75 places in 549 ms of which 38 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 512
SDD size :150696 after 268073
[2025-06-06 03:13:48] [INFO ] Deduced a trap composed of 51 places in 552 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:49] [INFO ] Deduced a trap composed of 129 places in 594 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:49] [INFO ] Deduced a trap composed of 129 places in 639 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:50] [INFO ] Deduced a trap composed of 137 places in 264 ms of which 5 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 1024
SDD size :268073 after 305696
[2025-06-06 03:13:50] [INFO ] Deduced a trap composed of 138 places in 531 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:51] [INFO ] Deduced a trap composed of 155 places in 498 ms of which 30 ms to minimize.
SMT process timed out in 5166ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :305696 after 995582
Interrupted probabilistic random walk after 179108 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 179108 steps, saw 83243 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2025-06-06 03:13:54] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:13:54] [INFO ] Invariant cache hit.
[2025-06-06 03:13:54] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:55] [INFO ] Deduced a trap composed of 37 places in 564 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:55] [INFO ] Deduced a trap composed of 37 places in 559 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:56] [INFO ] Deduced a trap composed of 75 places in 546 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:57] [INFO ] Deduced a trap composed of 51 places in 571 ms of which 42 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 :995582 after 4.38018e+06
[2025-06-06 03:13:57] [INFO ] Deduced a trap composed of 129 places in 570 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:58] [INFO ] Deduced a trap composed of 129 places in 553 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:58] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:59] [INFO ] Deduced a trap composed of 138 places in 530 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:59] [INFO ] Deduced a trap composed of 155 places in 482 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:00] [INFO ] Deduced a trap composed of 160 places in 486 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:00] [INFO ] Deduced a trap composed of 144 places in 614 ms of which 70 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 :4.38018e+06 after 7.37855e+06
[2025-06-06 03:14:01] [INFO ] Deduced a trap composed of 217 places in 592 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:02] [INFO ] Deduced a trap composed of 230 places in 579 ms of which 51 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2908 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2908 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2908 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 470 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6875 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15178ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 03:14:10] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:12] [INFO ] Implicit Places using invariants in 1858 ms returned []
[2025-06-06 03:14:12] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:14:12] [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 :7.37855e+06 after 1.61178e+07
[2025-06-06 03:14:12] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-06 03:14:33] [INFO ] Flatten gal took : 195 ms
[2025-06-06 03:14:33] [INFO ] Applying decomposition
[2025-06-06 03:14:33] [INFO ] Flatten gal took : 172 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/graph12132284242208833176.txt' '-o' '/tmp/graph12132284242208833176.bin' '-w' '/tmp/graph12132284242208833176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12132284242208833176.bin' '-l' '-1' '-v' '-w' '/tmp/graph12132284242208833176.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:14:34] [INFO ] Decomposing Gal with order
[2025-06-06 03:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:14:34] [INFO ] Removed a total of 17884 redundant transitions.
[2025-06-06 03:14:34] [INFO ] Flatten gal took : 357 ms
[2025-06-06 03:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1275 labels/synchronizations in 183 ms.
[2025-06-06 03:14:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16655027142760386352.gal : 22 ms
[2025-06-06 03:14:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6008390733843043811.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/ReachabilityCardinality16655027142760386352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6008390733843043811.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality6008390733843043811.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 1337
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1337 after 5390
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5390 after 11474
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11474 after 16040
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :16040 after 17794
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :17794 after 18201
[2025-06-06 03:14:36] [INFO ] Implicit Places using invariants and state equation in 24555 ms returned []
Implicit Place search using SMT with State Equation took 26418 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:14:37] [INFO ] Redundant transitions in 638 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 03:14:37] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 03:14:37] [INFO ] Invariant cache hit.
[2025-06-06 03:14:37] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18201 after 29867
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29867 after 55169
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :55169 after 67010
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 :67010 after 67273
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:30] [INFO ] Deduced a trap composed of 92 places in 587 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:31] [INFO ] Deduced a trap composed of 93 places in 574 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:32] [INFO ] Deduced a trap composed of 81 places in 430 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:33] [INFO ] Deduced a trap composed of 31 places in 610 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:34] [INFO ] Deduced a trap composed of 44 places in 617 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:34] [INFO ] Deduced a trap composed of 72 places in 612 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:35] [INFO ] Deduced a trap composed of 48 places in 600 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:36] [INFO ] Deduced a trap composed of 75 places in 557 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:37] [INFO ] Deduced a trap composed of 42 places in 466 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:38] [INFO ] Deduced a trap composed of 115 places in 490 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:39] [INFO ] Deduced a trap composed of 131 places in 464 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:42] [INFO ] Deduced a trap composed of 42 places in 518 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:43] [INFO ] Deduced a trap composed of 47 places in 507 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:44] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:45] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:46] [INFO ] Deduced a trap composed of 97 places in 659 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:47] [INFO ] Deduced a trap composed of 105 places in 622 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:47] [INFO ] Deduced a trap composed of 128 places in 608 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:50] [INFO ] Deduced a trap composed of 79 places in 676 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:51] [INFO ] Deduced a trap composed of 84 places in 641 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 22 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74778ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 74791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102086 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b06-UpperBounds-10 in 245833 ms.
[2025-06-06 03:15:52] [INFO ] Flatten gal took : 224 ms
[2025-06-06 03:15:52] [INFO ] Applying decomposition
[2025-06-06 03:15:52] [INFO ] Flatten gal took : 166 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/graph11334389525871098392.txt' '-o' '/tmp/graph11334389525871098392.bin' '-w' '/tmp/graph11334389525871098392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11334389525871098392.bin' '-l' '-1' '-v' '-w' '/tmp/graph11334389525871098392.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:15:53] [INFO ] Decomposing Gal with order
[2025-06-06 03:15:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:15:53] [INFO ] Removed a total of 17806 redundant transitions.
[2025-06-06 03:15:53] [INFO ] Flatten gal took : 294 ms
[2025-06-06 03:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 898 labels/synchronizations in 151 ms.
[2025-06-06 03:15:53] [INFO ] Time to serialize gal into /tmp/UpperBounds6699942688853426194.gal : 19 ms
[2025-06-06 03:15:53] [INFO ] Time to serialize properties into /tmp/UpperBounds9571719758016837802.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/UpperBounds6699942688853426194.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9571719758016837802.prop' '--nowitness'
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 ...283
Loading property file /tmp/UpperBounds9571719758016837802.prop.
ITS-tools command line returned an error code 137
[2025-06-06 03:28:02] [INFO ] Flatten gal took : 304 ms
[2025-06-06 03:28:02] [INFO ] Time to serialize gal into /tmp/UpperBounds9530002142942554932.gal : 63 ms
[2025-06-06 03:28:02] [INFO ] Time to serialize properties into /tmp/UpperBounds3243186955441303200.prop : 5 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/UpperBounds9530002142942554932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3243186955441303200.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 ...304
Loading property file /tmp/UpperBounds3243186955441303200.prop.
ITS-tools command line returned an error code 137
[2025-06-06 03:38:56] [INFO ] Flatten gal took : 482 ms
[2025-06-06 03:39:04] [INFO ] Input system was already deterministic with 7808 transitions.
[2025-06-06 03:39:04] [INFO ] Transformed 305 places.
[2025-06-06 03:39:04] [INFO ] Transformed 7808 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 03:39:06] [INFO ] Time to serialize gal into /tmp/UpperBounds768990170120559548.gal : 575 ms
[2025-06-06 03:39:06] [INFO ] Time to serialize properties into /tmp/UpperBounds13634758853097698033.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/UpperBounds768990170120559548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13634758853097698033.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13634758853097698033.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r240-tall-174915589300149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 ;