About the Execution of ITS-Tools for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 465216.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.r086-smll-174860102300349.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 FireWire-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300349
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 153K 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 FireWire-PT-14-UpperBounds-00
FORMULA_NAME FireWire-PT-14-UpperBounds-01
FORMULA_NAME FireWire-PT-14-UpperBounds-02
FORMULA_NAME FireWire-PT-14-UpperBounds-03
FORMULA_NAME FireWire-PT-14-UpperBounds-04
FORMULA_NAME FireWire-PT-14-UpperBounds-05
FORMULA_NAME FireWire-PT-14-UpperBounds-06
FORMULA_NAME FireWire-PT-14-UpperBounds-07
FORMULA_NAME FireWire-PT-14-UpperBounds-08
FORMULA_NAME FireWire-PT-14-UpperBounds-09
FORMULA_NAME FireWire-PT-14-UpperBounds-10
FORMULA_NAME FireWire-PT-14-UpperBounds-11
FORMULA_NAME FireWire-PT-14-UpperBounds-12
FORMULA_NAME FireWire-PT-14-UpperBounds-13
FORMULA_NAME FireWire-PT-14-UpperBounds-14
FORMULA_NAME FireWire-PT-14-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748882556841
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 16:42:38] [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 16:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:42:39] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-02 16:42:39] [INFO ] Transformed 205 places.
[2025-06-02 16:42:39] [INFO ] Transformed 610 transitions.
[2025-06-02 16:42:39] [INFO ] Found NUPN structural information;
[2025-06-02 16:42:39] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 1, 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]
FORMULA FireWire-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 16:42:39] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2025-06-02 16:42:39] [INFO ] Computed 10 invariants in 28 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (304 resets) in 132 ms. (75 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (297 resets) in 141 ms. (352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 16:42:39] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
[2025-06-02 16:42:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:42:40] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-02 16:42:40] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 16:42:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-02 16:42:40] [INFO ] [Real]Added 73 Read/Feed constraints in 86 ms returned sat
[2025-06-02 16:42:40] [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 16:42:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-02 16:42:41] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-06-02 16:42:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 78 ms returned sat
[2025-06-02 16:42:41] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 96 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:42] [INFO ] Deduced a trap composed of 15 places in 504 ms of which 34 ms to minimize.
[2025-06-02 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2025-06-02 16:42:42] [INFO ] Added : 43 causal constraints over 9 iterations in 1138 ms. Result :sat
Minimization took 206 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:42:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 16:42:42] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2025-06-02 16:42:43] [INFO ] [Real]Added 73 Read/Feed constraints in 68 ms returned sat
[2025-06-02 16:42:43] [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 16:42:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:42:43] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-02 16:42:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 46 ms returned sat
[2025-06-02 16:42:43] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 79 ms.
[2025-06-02 16:42:43] [INFO ] Added : 24 causal constraints over 6 iterations in 339 ms. Result :sat
Minimization took 180 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:42:43] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-02 16:42:44] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-02 16:42:44] [INFO ] [Real]Added 73 Read/Feed constraints in 64 ms returned sat
[2025-06-02 16:42:44] [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 16:42:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 16:42:44] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-06-02 16:42:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 46 ms returned sat
[2025-06-02 16:42:44] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 65 ms.
[2025-06-02 16:42:44] [INFO ] Added : 22 causal constraints over 5 iterations in 303 ms. Result :sat
Minimization took 163 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:42:45] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:42:45] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-06-02 16:42:45] [INFO ] [Real]Added 73 Read/Feed constraints in 42 ms returned sat
[2025-06-02 16:42:45] [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 16:42:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:42:45] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2025-06-02 16:42:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:42:45] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 5 ms to minimize.
[2025-06-02 16:42:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2025-06-02 16:42:46] [INFO ] Added : 26 causal constraints over 6 iterations in 988 ms. Result :sat
Minimization took 255 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:42:47] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 16:42:47] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2025-06-02 16:42:47] [INFO ] [Real]Added 73 Read/Feed constraints in 56 ms returned sat
[2025-06-02 16:42: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 16:42:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 16:42:47] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-02 16:42:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 81 ms returned sat
[2025-06-02 16:42:47] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 70 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:48] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 7 ms to minimize.
[2025-06-02 16:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-06-02 16:42:48] [INFO ] Added : 21 causal constraints over 5 iterations in 568 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 521
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 194 transition count 512
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 194 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 193 transition count 510
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 193 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 192 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 192 transition count 507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 191 transition count 505
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 190 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 190 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 189 transition count 500
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 188 transition count 497
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 187 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 186 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 186 transition count 492
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 185 transition count 490
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 184 transition count 488
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 183 transition count 486
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 183 transition count 486
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 180 transition count 483
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 177 transition count 489
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 177 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 77 place count 177 transition count 474
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 177 transition count 480
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 89 place count 174 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 174 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 173 transition count 467
Applied a total of 96 rules in 285 ms. Remains 173 /205 variables (removed 32) and now considering 467/539 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 173/205 places, 467/539 transitions.
[2025-06-02 16:42:49] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 173 cols
[2025-06-02 16:42:49] [INFO ] Computed 10 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32194 resets) in 2248 ms. (444 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (27150 resets) in 2857 ms. (1399 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 16:42:54] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:42:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 16:42:54] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-02 16:42:54] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:42:55] [INFO ] [Real]Added 65 Read/Feed constraints in 76 ms returned sat
[2025-06-02 16:42:55] [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 16:42:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 16:42:55] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2025-06-02 16:42:55] [INFO ] [Nat]Added 65 Read/Feed constraints in 66 ms returned sat
[2025-06-02 16:42:55] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 56 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:55] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 5 ms to minimize.
[2025-06-02 16:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-02 16:42:55] [INFO ] Added : 33 causal constraints over 7 iterations in 552 ms. Result :sat
Minimization took 195 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:42:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 16:42:56] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-02 16:42:56] [INFO ] [Real]Added 65 Read/Feed constraints in 32 ms returned sat
[2025-06-02 16:42:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:42:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 16:42:56] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2025-06-02 16:42:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:42:56] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 39 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:57] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:57] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:57] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 5 ms to minimize.
[2025-06-02 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 595 ms
[2025-06-02 16:42:57] [INFO ] Added : 35 causal constraints over 10 iterations in 1037 ms. Result :sat
Minimization took 301 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:42:58] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:42:58] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2025-06-02 16:42:58] [INFO ] [Real]Added 65 Read/Feed constraints in 27 ms returned sat
[2025-06-02 16:42: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 16:42:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:42:58] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-06-02 16:42:58] [INFO ] [Nat]Added 65 Read/Feed constraints in 62 ms returned sat
[2025-06-02 16:42:58] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:59] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:59] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 12 ms to minimize.
[2025-06-02 16:42:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
[2025-06-02 16:42:59] [INFO ] Added : 35 causal constraints over 7 iterations in 921 ms. Result :sat
Minimization took 287 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 16:43:00] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-02 16:43:00] [INFO ] [Real]Added 65 Read/Feed constraints in 59 ms returned sat
[2025-06-02 16:43: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 16:43:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-02 16:43:00] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-06-02 16:43:00] [INFO ] [Nat]Added 65 Read/Feed constraints in 147 ms returned sat
[2025-06-02 16:43:00] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 52 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:01] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:01] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:02] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:02] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 39 ms to minimize.
[2025-06-02 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1364 ms
[2025-06-02 16:43:02] [INFO ] Added : 30 causal constraints over 7 iterations in 1846 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 467/467 transitions.
Applied a total of 0 rules in 25 ms. Remains 173 /173 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 173/173 places, 467/467 transitions.
[2025-06-02 16:43:03] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32001 resets) in 2224 ms. (449 steps per ms)
BEST_FIRST walk for 4000003 steps (27337 resets) in 2323 ms. (1721 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 16:43:07] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:07] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 16:43:07] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-06-02 16:43:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:43:07] [INFO ] [Real]Added 65 Read/Feed constraints in 70 ms returned sat
[2025-06-02 16:43:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:08] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-02 16:43:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 64 ms returned sat
[2025-06-02 16:43:08] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:08] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 5 ms to minimize.
[2025-06-02 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 16:43:08] [INFO ] Added : 33 causal constraints over 7 iterations in 524 ms. Result :sat
Minimization took 300 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:09] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:09] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2025-06-02 16:43:09] [INFO ] [Real]Added 65 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:43:09] [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 16:43:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:09] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 16:43:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 60 ms returned sat
[2025-06-02 16:43:10] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 53 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:10] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:10] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:10] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 6 ms to minimize.
[2025-06-02 16:43:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 645 ms
[2025-06-02 16:43:11] [INFO ] Added : 35 causal constraints over 10 iterations in 1195 ms. Result :sat
Minimization took 306 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:11] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:11] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-06-02 16:43:11] [INFO ] [Real]Added 65 Read/Feed constraints in 30 ms returned sat
[2025-06-02 16:43:11] [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 16:43:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:12] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-06-02 16:43:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:43:12] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 48 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:12] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:12] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 11 ms to minimize.
[2025-06-02 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2025-06-02 16:43:12] [INFO ] Added : 35 causal constraints over 7 iterations in 801 ms. Result :sat
Minimization took 285 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:13] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-02 16:43:13] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-06-02 16:43:13] [INFO ] [Real]Added 65 Read/Feed constraints in 64 ms returned sat
[2025-06-02 16:43:13] [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 16:43:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 16:43:13] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 16:43:14] [INFO ] [Nat]Added 65 Read/Feed constraints in 143 ms returned sat
[2025-06-02 16:43:14] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 52 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:14] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:15] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:15] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:15] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 37 ms to minimize.
[2025-06-02 16:43:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1326 ms
[2025-06-02 16:43:15] [INFO ] Added : 30 causal constraints over 7 iterations in 1783 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 467/467 transitions.
Applied a total of 0 rules in 17 ms. Remains 173 /173 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 173/173 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 467/467 transitions.
Applied a total of 0 rules in 15 ms. Remains 173 /173 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-06-02 16:43:16] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:16] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-02 16:43:16] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:16] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:43:17] [INFO ] Implicit Places using invariants and state equation in 581 ms returned [18, 64, 121]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 881 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/173 places, 467/467 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 919 ms. Remains : 170/173 places, 467/467 transitions.
[2025-06-02 16:43:17] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-06-02 16:43:17] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32146 resets) in 2249 ms. (444 steps per ms)
BEST_FIRST walk for 4000004 steps (27551 resets) in 3195 ms. (1251 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 16:43:22] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:22] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 16:43:22] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-06-02 16:43:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:43:23] [INFO ] [Real]Added 65 Read/Feed constraints in 156 ms returned sat
[2025-06-02 16:43:23] [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 16:43:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:23] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-06-02 16:43:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 142 ms returned sat
[2025-06-02 16:43:23] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:24] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
[2025-06-02 16:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2025-06-02 16:43:24] [INFO ] Added : 20 causal constraints over 6 iterations in 507 ms. Result :sat
Minimization took 351 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:24] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:24] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-06-02 16:43:24] [INFO ] [Real]Added 65 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:43:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:25] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-06-02 16:43:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 58 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:25] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:25] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:26] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:26] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:26] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 43 ms to minimize.
[2025-06-02 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1497 ms
[2025-06-02 16:43:26] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 54 ms.
[2025-06-02 16:43:27] [INFO ] Added : 26 causal constraints over 6 iterations in 370 ms. Result :sat
Minimization took 333 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:27] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 16:43:27] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-06-02 16:43:27] [INFO ] [Real]Added 65 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:43:27] [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 16:43:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:28] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 16:43:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 76 ms returned sat
[2025-06-02 16:43:28] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:28] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
[2025-06-02 16:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-02 16:43:28] [INFO ] Added : 33 causal constraints over 7 iterations in 555 ms. Result :sat
Minimization took 314 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:29] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:29] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-06-02 16:43:29] [INFO ] [Real]Added 65 Read/Feed constraints in 32 ms returned sat
[2025-06-02 16:43:29] [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 16:43:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:29] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 16:43:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 60 ms returned sat
[2025-06-02 16:43:29] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 53 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:30] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:30] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:31] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:31] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:31] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 9 ms to minimize.
[2025-06-02 16:43:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1309 ms
[2025-06-02 16:43:31] [INFO ] Added : 34 causal constraints over 9 iterations in 1784 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-06-02 16:43:31] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:32] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-02 16:43:32] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:43:32] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:43:32] [INFO ] Redundant transitions in 55 ms returned []
Running 461 sub problems to find dead transitions.
[2025-06-02 16:43:32] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:43:32] [INFO ] Invariant cache hit.
[2025-06-02 16:43:33] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:36] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:36] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:36] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:36] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:37] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:37] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:37] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:37] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:40] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 35 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/186 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/251 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:52] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:57] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:58] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:58] [INFO ] Deduced a trap composed of 32 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 16:43:58] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 256 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/191 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/256 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 461/717 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:27] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 718 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61756 ms. Remains : 170/170 places, 467/467 transitions.
RANDOM walk for 40000 steps (1340 resets) in 1405 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (274 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (307 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (266 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (271 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (251 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
[2025-06-02 16:44:34] [INFO ] Flatten gal took : 216 ms
BEST_FIRST walk for 40004 steps (269 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (279 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (284 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
[2025-06-02 16:44:34] [INFO ] Flatten gal took : 169 ms
[2025-06-02 16:44:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16176846714178885606.gal : 86 ms
[2025-06-02 16:44:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16650878999135250538.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/ReachabilityCardinality16176846714178885606.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16650878999135250538.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16650878999135250538.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :97 after 127
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :127 after 195
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :195 after 489
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :489 after 4236
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :4236 after 14448
Interrupted probabilistic random walk after 335191 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 8
Probabilistic random walk after 335191 steps, saw 100587 distinct states, run finished after 3010 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 16:44:37] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:44:37] [INFO ] Invariant cache hit.
[2025-06-02 16:44:37] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 81/591 variables, 41/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/599 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/600 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :14448 after 27058
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/510 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 81/591 variables, 41/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 8/599 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/599 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/600 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/600 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/600 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 250 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4664ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :27058 after 139091
Parikh walk visited 0 properties in 829 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 170/170 places, 467/467 transitions.
RANDOM walk for 40000 steps (1310 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (282 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (266 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (273 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (266 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (291 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (264 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (272 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 338717 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 8
Probabilistic random walk after 338717 steps, saw 101677 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-02 16:44:46] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:44:46] [INFO ] Invariant cache hit.
[2025-06-02 16:44:46] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 81/591 variables, 41/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/599 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/600 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1637 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :139091 after 669647
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/510 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 81/591 variables, 41/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 8/599 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/599 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/600 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/600 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/600 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 250 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4107ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 673 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 22 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/170 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-06-02 16:44:51] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:44:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:51] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-02 16:44:51] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:44:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:51] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:44:52] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:44:52] [INFO ] Redundant transitions in 35 ms returned []
Running 461 sub problems to find dead transitions.
[2025-06-02 16:44:52] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:44:52] [INFO ] Invariant cache hit.
[2025-06-02 16:44:52] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:55] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:56] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:59] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 23 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :669647 after 2.32702e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/186 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/251 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:11] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:15] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:15] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:16] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:16] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.32702e+06 after 1.93732e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 256 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:45:24] [INFO ] Flatten gal took : 51 ms
[2025-06-02 16:45:24] [INFO ] Applying decomposition
[2025-06-02 16:45:24] [INFO ] Flatten gal took : 46 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/graph7720755953008318652.txt' '-o' '/tmp/graph7720755953008318652.bin' '-w' '/tmp/graph7720755953008318652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7720755953008318652.bin' '-l' '-1' '-v' '-w' '/tmp/graph7720755953008318652.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:45:25] [INFO ] Decomposing Gal with order
[2025-06-02 16:45:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:45:25] [INFO ] Removed a total of 722 redundant transitions.
[2025-06-02 16:45:25] [INFO ] Flatten gal took : 204 ms
[2025-06-02 16:45:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 80 ms.
[2025-06-02 16:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15007999904534823847.gal : 39 ms
[2025-06-02 16:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9671612225838770513.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/ReachabilityCardinality15007999904534823847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9671612225838770513.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/ReachabilityCardinality9671612225838770513.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 585
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :585 after 913
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :913 after 81465
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :81465 after 401686
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/191 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/256 constraints. Problems are: Problem set: 0 solved, 461 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :401686 after 4.31929e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 461/717 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:43] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 718 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60461ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61477 ms. Remains : 170/170 places, 467/467 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 144 edges and 170 vertex of which 29 / 170 are part of one of the 4 SCC in 7 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 144 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 144 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 143 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 143 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 142 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 142 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 141 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 141 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 140 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 140 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 139 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 139 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 138 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 138 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 137 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 137 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 136 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 136 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 135 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 135 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 134 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 134 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 133 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 34 place count 133 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 132 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 132 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 131 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 130 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 130 transition count 239
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 130 transition count 224
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 62 place count 121 transition count 221
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 121 transition count 221
Applied a total of 68 rules in 96 ms. Remains 121 /170 variables (removed 49) and now considering 221/467 (removed 246) transitions.
Running SMT prover for 2 properties.
[2025-06-02 16:45:52] [INFO ] Flow matrix only has 219 transitions (discarded 2 similar events)
// Phase 1: matrix 219 rows 121 cols
[2025-06-02 16:45:52] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:45:52] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 16:45:53] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:53] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 4 ms to minimize.
TRAPS : Iteration 1
[2025-06-02 16:45:53] [INFO ] After 266ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 16:45:53] [INFO ] After 345ms 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 16:45:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 16:45:53] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:53] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:53] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
[2025-06-02 16:45:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
TRAPS : Iteration 1
[2025-06-02 16:45:53] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:45:53] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:45:53] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:45:53] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:45:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7462307099961161444.gal : 6 ms
[2025-06-02 16:45:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1170741550688056932.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/ReachabilityCardinality7462307099961161444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1170741550688056932.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/ReachabilityCardinality1170741550688056932.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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 66
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :66 after 136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 242
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :242 after 418
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :418 after 4238
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4238 after 12270
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :12270 after 126624
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :126624 after 1.6363e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.6363e+06 after 4.32288e+06
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,2.8281e+07,1.38358,36652,2,3012,17,99151,8,0,707,125837,0
Total reachable state count : 28280970
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,26620,1.38462,36652,2,828,17,99151,8,0,709,125837,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,26620,1.38526,36652,2,828,17,99151,8,0,709,125837,0
Over-approximation ignoring read arcs solved 0 properties in 2373 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-14-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-14-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-14-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for FireWire-PT-14-UpperBounds-00
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 16:45:55] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-06-02 16:45:55] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (324 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (64 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 16:45:55] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-06-02 16:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:45:55] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 16:45:55] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-02 16:45:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 16:45:55] [INFO ] [Real]Added 65 Read/Feed constraints in 152 ms returned sat
[2025-06-02 16:45:55] [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 16:45:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:45:55] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-06-02 16:45:55] [INFO ] [Nat]Added 65 Read/Feed constraints in 136 ms returned sat
[2025-06-02 16:45:56] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:56] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 5 ms to minimize.
[2025-06-02 16:45:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-02 16:45:56] [INFO ] Added : 20 causal constraints over 6 iterations in 502 ms. Result :sat
Minimization took 355 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 170 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p153) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 464/464 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 167 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 167 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 166 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 166 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 164 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 164 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 163 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 163 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 162 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 162 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 161 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 161 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 160 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 160 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 159 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 159 transition count 438
Applied a total of 22 rules in 37 ms. Remains 159 /170 variables (removed 11) and now considering 438/464 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 159/170 places, 438/464 transitions.
[2025-06-02 16:45:56] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 159 cols
[2025-06-02 16:45:56] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32155 resets) in 1851 ms. (539 steps per ms)
BEST_FIRST walk for 1000001 steps (6813 resets) in 553 ms. (1805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 16:45:59] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:45:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:45:59] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:45:59] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-02 16:45:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:45:59] [INFO ] [Real]Added 60 Read/Feed constraints in 36 ms returned sat
[2025-06-02 16:45:59] [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 16:45:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 16:45:59] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-06-02 16:45:59] [INFO ] [Nat]Added 60 Read/Feed constraints in 36 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:00] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 4 ms to minimize.
[2025-06-02 16:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2025-06-02 16:46:00] [INFO ] Computed and/alt/rep : 163/596/163 causal constraints (skipped 232 transitions) in 42 ms.
[2025-06-02 16:46:00] [INFO ] Added : 24 causal constraints over 5 iterations in 247 ms. Result :sat
Minimization took 214 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 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 159/159 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-06-02 16:46:00] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:00] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-02 16:46:00] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:46:01] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:46:01] [INFO ] Redundant transitions in 6 ms returned []
Running 432 sub problems to find dead transitions.
[2025-06-02 16:46:01] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:01] [INFO ] Invariant cache hit.
[2025-06-02 16:46:01] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:05] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:06] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:16] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:16] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:16] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:16] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:20] [INFO ] Deduced a trap composed of 50 places in 272 ms of which 38 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:23] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SMT process timed out in 30255ms, After SMT, problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 30257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31212 ms. Remains : 159/159 places, 438/438 transitions.
[2025-06-02 16:46:31] [INFO ] Flatten gal took : 77 ms
RANDOM walk for 40000 steps (1289 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (264 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
[2025-06-02 16:46:31] [INFO ] Flatten gal took : 73 ms
BEST_FIRST walk for 40004 steps (266 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2025-06-02 16:46:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11412017532826276407.gal : 10 ms
[2025-06-02 16:46:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8378185246346512001.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/ReachabilityCardinality11412017532826276407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8378185246346512001.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8378185246346512001.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 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 128
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :128 after 196
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :196 after 479
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :479 after 3700
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3700 after 14060
Interrupted probabilistic random walk after 500842 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 2
Probabilistic random walk after 500842 steps, saw 148578 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2025-06-02 16:46:34] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:34] [INFO ] Invariant cache hit.
[2025-06-02 16:46:34] [INFO ] State equation strengthened by 60 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, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/558 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/560 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14060 after 26725
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/558 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/558 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/560 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 896ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 438/438 transitions.
RANDOM walk for 40000 steps (1299 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (276 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (269 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :26725 after 133155
Interrupted probabilistic random walk after 542011 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 2
Probabilistic random walk after 542011 steps, saw 160705 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-06-02 16:46:39] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:39] [INFO ] Invariant cache hit.
[2025-06-02 16:46:39] [INFO ] State equation strengthened by 60 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, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/558 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/560 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/558 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/558 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/560 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-06-02 16:46:40] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:40] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 16:46:40] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:46:40] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:46:40] [INFO ] Redundant transitions in 4 ms returned []
Running 432 sub problems to find dead transitions.
[2025-06-02 16:46:40] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-06-02 16:46:40] [INFO ] Invariant cache hit.
[2025-06-02 16:46:40] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :133155 after 583184
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:44] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:45] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:51] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:51] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:52] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:52] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:54] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :583184 after 1.76753e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:56] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (OVERLAPS) 401/560 variables, 159/174 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 60/234 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:03] [INFO ] Deduced a trap composed of 39 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 16:47:06] [INFO ] Deduced a trap composed of 31 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 16:47:06] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 237 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.76753e+06 after 1.90895e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 401/560 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:47:22] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:47:22] [INFO ] Applying decomposition
[2025-06-02 16:47:22] [INFO ] Flatten gal took : 20 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/graph15422380523728788448.txt' '-o' '/tmp/graph15422380523728788448.bin' '-w' '/tmp/graph15422380523728788448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15422380523728788448.bin' '-l' '-1' '-v' '-w' '/tmp/graph15422380523728788448.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:47:22] [INFO ] Decomposing Gal with order
[2025-06-02 16:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:47:22] [INFO ] Removed a total of 677 redundant transitions.
[2025-06-02 16:47:22] [INFO ] Flatten gal took : 50 ms
[2025-06-02 16:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 16 ms.
[2025-06-02 16:47:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2571405519610766894.gal : 5 ms
[2025-06-02 16:47:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14138700126802046835.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/ReachabilityCardinality2571405519610766894.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14138700126802046835.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/ReachabilityCardinality14138700126802046835.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 247
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :247 after 7936
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7936 after 21527
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :21527 after 115272
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 432/669 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :115272 after 1.7067e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 669 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60900 ms. Remains : 159/159 places, 438/438 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 237
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 222
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 219
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 219
Applied a total of 46 rules in 35 ms. Remains 121 /159 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 2 properties.
[2025-06-02 16:47:41] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 121 cols
[2025-06-02 16:47:41] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:47:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 16:47:41] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:41] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 3 ms to minimize.
TRAPS : Iteration 1
[2025-06-02 16:47:41] [INFO ] After 218ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 16:47:41] [INFO ] After 295ms 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 16:47:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 16:47:41] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:41] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
[2025-06-02 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
TRAPS : Iteration 1
[2025-06-02 16:47:41] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:47:41] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:47:41] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:47:41] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4931493022113217740.gal : 4 ms
[2025-06-02 16:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7959574604884086728.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/ReachabilityCardinality4931493022113217740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7959574604884086728.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/ReachabilityCardinality7959574604884086728.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 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 153
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :153 after 242
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :242 after 431
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :431 after 3866
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3866 after 11323
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11323 after 307615
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :307615 after 735173
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.68965e+07 after 1.77401e+07
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,2.81262e+07,1.28488,36104,2,2786,18,96694,8,0,702,126446,0
Total reachable state count : 28126193
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,11147,1.2861,36104,2,495,18,96694,8,0,704,126446,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,11147,1.28688,36104,2,495,18,96694,8,0,704,126446,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 2094 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-00 in 108053 ms.
[2025-06-02 16:47:43] [INFO ] Flatten gal took : 18 ms
[2025-06-02 16:47:43] [INFO ] Applying decomposition
[2025-06-02 16:47:43] [INFO ] Flatten gal took : 18 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/graph4804332081593144055.txt' '-o' '/tmp/graph4804332081593144055.bin' '-w' '/tmp/graph4804332081593144055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4804332081593144055.bin' '-l' '-1' '-v' '-w' '/tmp/graph4804332081593144055.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:47:43] [INFO ] Decomposing Gal with order
[2025-06-02 16:47:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:47:43] [INFO ] Removed a total of 735 redundant transitions.
[2025-06-02 16:47:43] [INFO ] Flatten gal took : 39 ms
[2025-06-02 16:47:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 15 ms.
[2025-06-02 16:47:43] [INFO ] Time to serialize gal into /tmp/UpperBounds5769162220833633669.gal : 5 ms
[2025-06-02 16:47:43] [INFO ] Time to serialize properties into /tmp/UpperBounds18269120063097335961.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/UpperBounds5769162220833633669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18269120063097335961.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 ...284
Loading property file /tmp/UpperBounds18269120063097335961.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.66705e+08,157.681,2214972,7497,490,3.0563e+06,35726,772,8.22589e+06,133,423377,0
Total reachable state count : 266705212
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-14-UpperBounds-00 :0 <= i0.u41.p153 <= 1
FORMULA FireWire-PT-14-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-14-UpperBounds-00,0,158.307,2214972,1,0,3.0563e+06,35726,1010,8.22589e+06,158,423377,2604
Total runtime 463021 ms.
BK_STOP 1748883022057
--------------------
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="FireWire-PT-14"
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 FireWire-PT-14, 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 r086-smll-174860102300349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 ;