About the Execution of ITS-Tools for EisenbergMcGuire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 382230.00 | 0.00 | 0.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068200805.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 EisenbergMcGuire-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068200805
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748853297046
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 08:34:58] [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-02 08:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:34:58] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2025-06-02 08:34:58] [INFO ] Transformed 891 places.
[2025-06-02 08:34:58] [INFO ] Transformed 3888 transitions.
[2025-06-02 08:34:58] [INFO ] Found NUPN structural information;
[2025-06-02 08:34:58] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 08:34:58] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2025-06-02 08:34:58] [INFO ] Computed 28 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 71 ms. (138 steps per ms)
FORMULA EisenbergMcGuire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 68 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 08:34:58] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2025-06-02 08:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:34:59] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2025-06-02 08:34:59] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:34:59] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-02 08:34:59] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-06-02 08:35:00] [INFO ] [Real]Added 932 Read/Feed constraints in 137 ms returned sat
[2025-06-02 08:35:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:35:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2025-06-02 08:35:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2025-06-02 08:35:00] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-06-02 08:35:00] [INFO ] [Nat]Added 932 Read/Feed constraints in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:01] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:01] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:02] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:02] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:03] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:03] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:03] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:04] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:04] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:05] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 11 ms to minimize.
[2025-06-02 08:35:05] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 4312 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:35:05] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:05] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:35:05] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-02 08:35:05] [INFO ] [Real]Added 932 Read/Feed constraints in 122 ms returned sat
[2025-06-02 08:35:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:35:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 26 ms returned sat
[2025-06-02 08:35:06] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:35:06] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-02 08:35:06] [INFO ] [Nat]Added 932 Read/Feed constraints in 203 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:07] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:07] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:07] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:08] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:08] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:09] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:09] [INFO ] Deduced a trap composed of 26 places in 356 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:10] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:10] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:10] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:11] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 33 ms to minimize.
[2025-06-02 08:35:11] [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 1
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-02 08:35:11] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2025-06-02 08:35:11] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-02 08:35:11] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-02 08:35:11] [INFO ] [Real]Added 932 Read/Feed constraints in 144 ms returned sat
[2025-06-02 08:35: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-02 08:35:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:12] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-02 08:35:12] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2025-06-02 08:35:12] [INFO ] [Nat]Added 932 Read/Feed constraints in 126 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:13] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:13] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:14] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:14] [INFO ] Deduced a trap composed of 3 places in 462 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:16] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:16] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:16] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 13 ms to minimize.
[2025-06-02 08:35:16] [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-02 08:35:17] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:17] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:35:17] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-02 08:35:17] [INFO ] [Real]Added 932 Read/Feed constraints in 157 ms returned sat
[2025-06-02 08:35:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:35:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:35:18] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-06-02 08:35:18] [INFO ] [Nat]Added 932 Read/Feed constraints in 130 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:18] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:19] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:19] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:20] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:20] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:20] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:21] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:21] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:22] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:22] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:22] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:22] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 22 ms to minimize.
[2025-06-02 08:35:22] [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 3
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-02 08:35:23] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2025-06-02 08:35:23] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:35:23] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-02 08:35:23] [INFO ] [Real]Added 932 Read/Feed constraints in 157 ms returned sat
[2025-06-02 08:35:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:35:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2025-06-02 08:35:24] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-02 08:35:24] [INFO ] [Nat]Added 932 Read/Feed constraints in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:24] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:25] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:25] [INFO ] Deduced a trap composed of 23 places in 445 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:26] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:26] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:27] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:27] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:27] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:28] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:28] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:28] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:28] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 6 ms to minimize.
[2025-06-02 08:35:28] [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 4
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-02 08:35:28] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2025-06-02 08:35:28] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-02 08:35:29] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-02 08:35:29] [INFO ] [Real]Added 932 Read/Feed constraints in 127 ms returned sat
[2025-06-02 08:35: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-02 08:35:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 08:35:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-02 08:35:30] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-02 08:35:30] [INFO ] [Nat]Added 932 Read/Feed constraints in 148 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:30] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:31] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:31] [INFO ] Deduced a trap composed of 20 places in 449 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:32] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:32] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:32] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:33] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:33] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:34] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:34] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:34] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 28 ms to minimize.
[2025-06-02 08:35:34] [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 5
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 882 transition count 3628
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 631 transition count 3628
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 592 place count 559 transition count 2980
Iterating global reduction 2 with 72 rules applied. Total rules applied 664 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 6 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 808 place count 487 transition count 2908
Applied a total of 808 rules in 382 ms. Remains 487 /891 variables (removed 404) and now considering 2908/3888 (removed 980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 487/891 places, 2908/3888 transitions.
[2025-06-02 08:35:35] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2025-06-02 08:35:35] [INFO ] Computed 28 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2372 ms. (421 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3050 ms. (1966 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 08:35:40] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2025-06-02 08:35:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:40] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:40] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:41] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-02 08:35:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:35:41] [INFO ] [Real]Added 356 Read/Feed constraints in 50 ms returned sat
[2025-06-02 08:35:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:41] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-02 08:35:41] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-02 08:35:41] [INFO ] [Nat]Added 356 Read/Feed constraints in 47 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:41] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:41] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
[2025-06-02 08:35:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2025-06-02 08:35:41] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 102 ms.
[2025-06-02 08:35:42] [INFO ] Added : 77 causal constraints over 16 iterations in 876 ms. Result :sat
Minimization took 218 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:42] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:42] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:43] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-06-02 08:35:43] [INFO ] [Real]Added 356 Read/Feed constraints in 50 ms returned sat
[2025-06-02 08:35:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:35:43] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-06-02 08:35:43] [INFO ] [Nat]Added 356 Read/Feed constraints in 47 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:43] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:43] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2025-06-02 08:35:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2025-06-02 08:35:43] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 85 ms.
[2025-06-02 08:35:44] [INFO ] Added : 90 causal constraints over 18 iterations in 918 ms. Result :sat
Minimization took 233 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:45] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Real]Added 356 Read/Feed constraints in 59 ms returned sat
[2025-06-02 08:35:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-06-02 08:35:45] [INFO ] [Nat]Added 356 Read/Feed constraints in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:45] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:45] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:46] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:46] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:46] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 4 ms to minimize.
[2025-06-02 08:35:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 761 ms
[2025-06-02 08:35:46] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 57 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:47] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 6 ms to minimize.
[2025-06-02 08:35:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2025-06-02 08:35:48] [INFO ] Added : 134 causal constraints over 28 iterations in 1809 ms. Result :sat
Minimization took 237 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:48] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:48] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:48] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-02 08:35:48] [INFO ] [Real]Added 356 Read/Feed constraints in 59 ms returned sat
[2025-06-02 08:35:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:49] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-06-02 08:35:49] [INFO ] [Nat]Added 356 Read/Feed constraints in 49 ms returned sat
[2025-06-02 08:35:49] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 52 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2025-06-02 08:35:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2025-06-02 08:35:49] [INFO ] Added : 41 causal constraints over 9 iterations in 665 ms. Result :sat
Minimization took 224 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:50] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Real]Added 356 Read/Feed constraints in 48 ms returned sat
[2025-06-02 08:35: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-02 08:35:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-06-02 08:35:50] [INFO ] [Nat]Added 356 Read/Feed constraints in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2025-06-02 08:35:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-02 08:35:50] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:51] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
[2025-06-02 08:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-02 08:35:51] [INFO ] Added : 64 causal constraints over 14 iterations in 898 ms. Result :sat
Minimization took 218 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:52] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Real]Added 356 Read/Feed constraints in 47 ms returned sat
[2025-06-02 08:35: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-02 08:35:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-06-02 08:35:52] [INFO ] [Nat]Added 356 Read/Feed constraints in 57 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:52] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
[2025-06-02 08:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-02 08:35:52] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 50 ms.
[2025-06-02 08:35:53] [INFO ] Added : 80 causal constraints over 16 iterations in 865 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 167 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 486/487 places, 2907/2908 transitions.
[2025-06-02 08:35:55] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-02 08:35:55] [INFO ] Computed 28 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2110 ms. (473 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 999 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 08:35:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:35:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:58] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:35:58] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:35:58] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-02 08:35:58] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:35:58] [INFO ] [Real]Added 356 Read/Feed constraints in 56 ms returned sat
[2025-06-02 08:35:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:35:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 08:35:58] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:35:58] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-02 08:35:59] [INFO ] [Nat]Added 356 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
[2025-06-02 08:35:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2025-06-02 08:35:59] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 50 ms.
[2025-06-02 08:36:00] [INFO ] Added : 89 causal constraints over 18 iterations in 907 ms. Result :sat
Minimization took 199 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:36:00] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:36:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:36:00] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-02 08:36:00] [INFO ] [Real]Added 356 Read/Feed constraints in 64 ms returned sat
[2025-06-02 08:36:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:36:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 08:36:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:36:01] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-02 08:36:01] [INFO ] [Nat]Added 356 Read/Feed constraints in 56 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
[2025-06-02 08:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-06-02 08:36:01] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 57 ms.
[2025-06-02 08:36:02] [INFO ] Added : 86 causal constraints over 18 iterations in 910 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 114 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 112 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-02 08:36:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:36:03] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-06-02 08:36:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:36:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:36:07] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 4456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:36:07] [INFO ] Redundant transitions in 152 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-02 08:36:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:36:07] [INFO ] Invariant cache hit.
[2025-06-02 08:36:07] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:32] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:32] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:32] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:32] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:33] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:33] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:33] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:33] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:35] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:35] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:35] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:36] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:36] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:36] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:36] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:37] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:37] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:37] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:37] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:37] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:38] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 49 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:46] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:46] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:47] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:47] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:48] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:48] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:49] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:49] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:49] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:50] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:51] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:52] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:53] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:53] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:53] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:53] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:54] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:54] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:54] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:36:58] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:00] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:05] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:05] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:05] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:06] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:07] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:07] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 77 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61298ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66081 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 901 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
[2025-06-02 08:37:09] [INFO ] Flatten gal took : 295 ms
[2025-06-02 08:37:09] [INFO ] Flatten gal took : 150 ms
[2025-06-02 08:37:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6505815936583416882.gal : 44 ms
[2025-06-02 08:37:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4226326132428811371.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/ReachabilityCardinality6505815936583416882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4226326132428811371.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/ReachabilityCardinality4226326132428811371.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :91 after 288
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :288 after 395
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :395 after 1330
Interrupted probabilistic random walk after 286360 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :2 out of 4
Probabilistic random walk after 286360 steps, saw 181803 distinct states, run finished after 3010 ms. (steps per millisecond=95 ) properties seen :2
[2025-06-02 08:37:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:37:12] [INFO ] Invariant cache hit.
[2025-06-02 08:37:12] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:13] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1616ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1330 after 5100
Parikh walk visited 0 properties in 151 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 102 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 433 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 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
Interrupted probabilistic random walk after 299300 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 299300 steps, saw 189097 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-06-02 08:37:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:37:17] [INFO ] Invariant cache hit.
[2025-06-02 08:37:17] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:17] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:18] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5100 after 13728
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1590ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 97 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 96 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-02 08:37:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:37:20] [INFO ] Implicit Places using invariants in 675 ms returned []
[2025-06-02 08:37:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:37:20] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:37:23] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned []
Implicit Place search using SMT with State Equation took 4208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:37:23] [INFO ] Redundant transitions in 186 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-02 08:37:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:37:23] [INFO ] Invariant cache hit.
[2025-06-02 08:37:23] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :13728 after 54523
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :54523 after 99770
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:49] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:49] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:51] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:52] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:52] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:52] [INFO ] Deduced a trap composed of 47 places in 363 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:53] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:53] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:54] [INFO ] Deduced a trap composed of 47 places in 374 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:54] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:54] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:54] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:54] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:37:55] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 28 ms to minimize.
SMT process timed out in 31210ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 31222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35745 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 61 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-02 08:37:55] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:37:55] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-02 08:37:55] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-06-02 08:37:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 08:37:55] [INFO ] After 29ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 08:37:55] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:37:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-06-02 08:37:55] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 08:37:55] [INFO ] After 12ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 08:37:55] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 08:37:55] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 08:37:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:37:55] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality71956491349570880.gal : 2 ms
[2025-06-02 08:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11932592217493223152.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/ReachabilityCardinality71956491349570880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11932592217493223152.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/ReachabilityCardinality11932592217493223152.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,480,0.031625,6064,2,283,8,1106,6,0,449,654,0
Total reachable state count : 480
Verifying 2 reachability properties.
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,32,0.032042,6064,2,110,8,1106,7,0,452,654,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,32,0.03222,6064,2,110,8,1106,8,0,453,654,0
Over-approximation ignoring read arcs solved 0 properties in 415 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 08:37:55] [INFO ] Flatten gal took : 95 ms
[2025-06-02 08:37:55] [INFO ] Applying decomposition
[2025-06-02 08:37:55] [INFO ] Flatten gal took : 87 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/graph4986515321636364486.txt' '-o' '/tmp/graph4986515321636364486.bin' '-w' '/tmp/graph4986515321636364486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4986515321636364486.bin' '-l' '-1' '-v' '-w' '/tmp/graph4986515321636364486.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:37:56] [INFO ] Decomposing Gal with order
[2025-06-02 08:37:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:37:56] [INFO ] Removed a total of 6279 redundant transitions.
[2025-06-02 08:37:56] [INFO ] Flatten gal took : 512 ms
[2025-06-02 08:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 667 labels/synchronizations in 114 ms.
[2025-06-02 08:37:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14548065964579261889.gal : 27 ms
[2025-06-02 08:37:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3265945213727904121.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/ReachabilityCardinality14548065964579261889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3265945213727904121.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/ReachabilityCardinality3265945213727904121.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 256
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :256 after 310
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :310 after 486
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :486 after 12057
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :12057 after 504184
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :504184 after 6.04991e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.04991e+06 after 1.09218e+07
Detected timeout of ITS tools.
FORMULA EisenbergMcGuire-PT-09-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-09-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-02 08:38:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-02 08:38:47] [INFO ] Computed 28 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 08:38:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-02 08:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:38:47] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-02 08:38:47] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 18 ms returned sat
[2025-06-02 08:38:47] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-06-02 08:38:47] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:38:47] [INFO ] [Real]Added 356 Read/Feed constraints in 78 ms returned sat
[2025-06-02 08:38: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-02 08:38:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 08:38:47] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 08:38:47] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-02 08:38:47] [INFO ] [Nat]Added 356 Read/Feed constraints in 49 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:38:47] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
[2025-06-02 08:38:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2025-06-02 08:38:48] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 46 ms.
[2025-06-02 08:38:48] [INFO ] Added : 86 causal constraints over 18 iterations in 858 ms. Result :sat
Minimization took 171 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 486 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 148 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 486/486 places, 2906/2906 transitions.
[2025-06-02 08:38:49] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
// Phase 1: matrix 827 rows 486 cols
[2025-06-02 08:38:49] [INFO ] Computed 28 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2326 ms. (429 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 509 ms. (1960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 08:38:52] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:38:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:38:52] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 08:38:52] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:38:52] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-02 08:38:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:38:52] [INFO ] [Real]Added 356 Read/Feed constraints in 57 ms returned sat
[2025-06-02 08:38: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-02 08:38:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 08:38:52] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 08:38:52] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-02 08:38:52] [INFO ] [Nat]Added 356 Read/Feed constraints in 44 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:38:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2025-06-02 08:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-02 08:38:53] [INFO ] Computed and/alt/rep : 704/1602/488 causal constraints (skipped 330 transitions) in 49 ms.
[2025-06-02 08:38:53] [INFO ] Added : 65 causal constraints over 13 iterations in 643 ms. Result :sat
Minimization took 179 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 108 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2025-06-02 08:38:54] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:38:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:38:54] [INFO ] Implicit Places using invariants in 682 ms returned []
[2025-06-02 08:38:54] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:38:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:38:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-02 08:38:58] [INFO ] Implicit Places using invariants and state equation in 3327 ms returned []
Implicit Place search using SMT with State Equation took 4012 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:38:58] [INFO ] Redundant transitions in 81 ms returned []
Running 2897 sub problems to find dead transitions.
[2025-06-02 08:38:58] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:38:58] [INFO ] Invariant cache hit.
[2025-06-02 08:38:58] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:22] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:22] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:23] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:23] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:27] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:27] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:27] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:27] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1313 variables, and 34 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:31] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:39] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:39] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:45] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:46] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:49] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:50] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:53] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:53] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:39:57] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1313 variables, and 44 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2897 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61034ms problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 61042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65256 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
[2025-06-02 08:39:59] [INFO ] Flatten gal took : 169 ms
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
[2025-06-02 08:39:59] [INFO ] Flatten gal took : 205 ms
[2025-06-02 08:39:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3487363818353944752.gal : 34 ms
[2025-06-02 08:39:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6423810569844341454.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/ReachabilityCardinality3487363818353944752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6423810569844341454.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/ReachabilityCardinality6423810569844341454.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 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 258
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :258 after 395
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :395 after 1361
Interrupted probabilistic random walk after 251420 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251420 steps, saw 161025 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2025-06-02 08:40:02] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:40:02] [INFO ] Invariant cache hit.
[2025-06-02 08:40:02] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:03] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1313 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1361 after 5100
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1313 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 874 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1740ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 306 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 99 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 308600 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 308600 steps, saw 194919 distinct states, run finished after 3004 ms. (steps per millisecond=102 ) properties seen :0
[2025-06-02 08:40:08] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:40:08] [INFO ] Invariant cache hit.
[2025-06-02 08:40:08] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:09] [INFO ] Deduced a trap composed of 3 places in 1139 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5100 after 13710
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3636 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:12] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1313 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1313 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 874 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4729ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 141 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 186 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2025-06-02 08:40:13] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:40:14] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2025-06-02 08:40:14] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:40:14] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13710 after 51179
[2025-06-02 08:40:17] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 4583 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:40:18] [INFO ] Redundant transitions in 79 ms returned []
Running 2897 sub problems to find dead transitions.
[2025-06-02 08:40:18] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-06-02 08:40:18] [INFO ] Invariant cache hit.
[2025-06-02 08:40:18] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :51179 after 99625
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:41] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:42] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:42] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:42] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:46] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1313 variables, and 34 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
[2025-06-02 08:40:50] [INFO ] Flatten gal took : 76 ms
[2025-06-02 08:40:50] [INFO ] Applying decomposition
[2025-06-02 08:40:50] [INFO ] Flatten gal took : 78 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17447125107583810384.txt' '-o' '/tmp/graph17447125107583810384.bin' '-w' '/tmp/graph17447125107583810384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17447125107583810384.bin' '-l' '-1' '-v' '-w' '/tmp/graph17447125107583810384.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:40:50] [INFO ] Decomposing Gal with order
[2025-06-02 08:40:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:40:50] [INFO ] Removed a total of 6286 redundant transitions.
[2025-06-02 08:40:50] [INFO ] Flatten gal took : 295 ms
[2025-06-02 08:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 630 labels/synchronizations in 62 ms.
[2025-06-02 08:40:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3977319741669801929.gal : 16 ms
[2025-06-02 08:40:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16401171672651767685.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/ReachabilityCardinality3977319741669801929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16401171672651767685.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
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Loading property file /tmp/ReachabilityCardinality16401171672651767685.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 693
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:51] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :693 after 56232
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :56232 after 64152
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,329148,5.86136,146896,15662,2238,192448,13214,4102,248136,613,61109,0
Total reachable state count : 329148
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,81,5.87673,146896,343,159,192448,13214,4105,248136,616,61109,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,81,5.87928,146896,343,159,192448,13214,4111,248136,618,61109,0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:58] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:40:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:04] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:05] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:08] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:09] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:12] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:13] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:41:16] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1313 variables, and 44 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2897 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61083ms problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 61090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65956 ms. Remains : 486/486 places, 2906/2906 transitions.
FORMULA EisenbergMcGuire-PT-09-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-08 in 152068 ms.
[2025-06-02 08:41:19] [INFO ] Flatten gal took : 72 ms
Total runtime 380956 ms.
BK_STOP 1748853679276
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r072-tall-174860068200805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 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 ;