About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.623 | 3600000.00 | 2681820.00 | 678972.70 | 1 1 1 0 1 1 1 1 1 ? ? ? ? ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821300773.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S24C10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 15K Apr 29 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18M May 10 09:34 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
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652860240738
Running Version 202205111006
[2022-05-18 07:50:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 07:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 07:50:42] [INFO ] Load time of PNML (sax parser for PT used): 870 ms
[2022-05-18 07:50:43] [INFO ] Transformed 17896 places.
[2022-05-18 07:50:43] [INFO ] Transformed 26071 transitions.
[2022-05-18 07:50:43] [INFO ] Parsed PT model containing 17896 places and 26071 transitions in 1097 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Normalized transition count is 25471 out of 26071 initially.
// Phase 1: matrix 25471 rows 17896 cols
[2022-05-18 07:50:45] [INFO ] Computed 1245 place invariants in 2523 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :3
[2022-05-18 07:50:47] [INFO ] Flow matrix only has 25471 transitions (discarded 600 similar events)
// Phase 1: matrix 25471 rows 17896 cols
[2022-05-18 07:50:49] [INFO ] Computed 1245 place invariants in 2247 ms
[2022-05-18 07:50:52] [INFO ] [Real]Absence check using 74 positive place invariants in 514 ms returned sat
[2022-05-18 07:50:53] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 1011 ms returned sat
[2022-05-18 07:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:50:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:50:57] [INFO ] [Real]Absence check using 74 positive place invariants in 496 ms returned sat
[2022-05-18 07:50:58] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 943 ms returned sat
[2022-05-18 07:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:02] [INFO ] [Real]Absence check using 74 positive place invariants in 502 ms returned sat
[2022-05-18 07:51:02] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 396 ms returned unsat
[2022-05-18 07:51:05] [INFO ] [Real]Absence check using 74 positive place invariants in 504 ms returned sat
[2022-05-18 07:51:06] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 1006 ms returned sat
[2022-05-18 07:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:10] [INFO ] [Real]Absence check using 74 positive place invariants in 512 ms returned sat
[2022-05-18 07:51:11] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 928 ms returned sat
[2022-05-18 07:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:15] [INFO ] [Real]Absence check using 74 positive place invariants in 497 ms returned sat
[2022-05-18 07:51:15] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 361 ms returned unsat
[2022-05-18 07:51:18] [INFO ] [Real]Absence check using 74 positive place invariants in 496 ms returned sat
[2022-05-18 07:51:18] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 377 ms returned unsat
[2022-05-18 07:51:20] [INFO ] [Real]Absence check using 74 positive place invariants in 489 ms returned sat
[2022-05-18 07:51:21] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 359 ms returned unsat
[2022-05-18 07:51:23] [INFO ] [Real]Absence check using 74 positive place invariants in 531 ms returned sat
[2022-05-18 07:51:24] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 474 ms returned unsat
[2022-05-18 07:51:26] [INFO ] [Real]Absence check using 74 positive place invariants in 523 ms returned sat
[2022-05-18 07:51:27] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 1117 ms returned sat
[2022-05-18 07:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:31] [INFO ] [Real]Absence check using 74 positive place invariants in 501 ms returned sat
[2022-05-18 07:51:32] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 972 ms returned sat
[2022-05-18 07:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:36] [INFO ] [Real]Absence check using 74 positive place invariants in 506 ms returned sat
[2022-05-18 07:51:37] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 925 ms returned sat
[2022-05-18 07:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:41] [INFO ] [Real]Absence check using 74 positive place invariants in 488 ms returned sat
[2022-05-18 07:51:42] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 860 ms returned sat
[2022-05-18 07:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:46] [INFO ] [Real]Absence check using 74 positive place invariants in 481 ms returned sat
[2022-05-18 07:51:47] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 934 ms returned sat
[2022-05-18 07:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:51] [INFO ] [Real]Absence check using 74 positive place invariants in 484 ms returned sat
[2022-05-18 07:51:52] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 930 ms returned sat
[2022-05-18 07:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:51:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 07:51:56] [INFO ] [Real]Absence check using 74 positive place invariants in 497 ms returned sat
[2022-05-18 07:51:57] [INFO ] [Real]Absence check using 74 positive and 1171 generalized place invariants in 370 ms returned unsat
Current structural bounds on expressions (after SMT) : [75, 25, 1, 1, 25, 1, 1, 1, 1, 1, 1, 1, 25, 25, 25, 1] Max seen :[0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 17896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17896/17896 places, 26071/26071 transitions.
Graph (complete) has 56805 edges and 17896 vertex of which 17848 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.58 ms
Discarding 48 places :
Also discarding 0 output transitions
Drop transitions removed 5995 transitions
Trivial Post-agglo rules discarded 5995 transitions
Performed 5995 trivial Post agglomeration. Transition count delta: 5995
Iterating post reduction 0 with 5995 rules applied. Total rules applied 5996 place count 17848 transition count 20076
Reduce places removed 5995 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5996 rules applied. Total rules applied 11992 place count 11853 transition count 20075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11993 place count 11852 transition count 20075
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 11993 place count 11852 transition count 19575
Deduced a syphon composed of 500 places in 29 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 12993 place count 11352 transition count 19575
Discarding 5495 places :
Symmetric choice reduction at 3 with 5495 rule applications. Total rules 18488 place count 5857 transition count 14080
Iterating global reduction 3 with 5495 rules applied. Total rules applied 23983 place count 5857 transition count 14080
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 23983 place count 5857 transition count 14064
Deduced a syphon composed of 16 places in 33 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 24015 place count 5841 transition count 14064
Discarding 545 places :
Symmetric choice reduction at 3 with 545 rule applications. Total rules 24560 place count 5296 transition count 8614
Iterating global reduction 3 with 545 rules applied. Total rules applied 25105 place count 5296 transition count 8614
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 15 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 25155 place count 5271 transition count 8589
Free-agglomeration rule (complex) applied 341 times.
Iterating global reduction 3 with 341 rules applied. Total rules applied 25496 place count 5271 transition count 13153
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 3 with 341 rules applied. Total rules applied 25837 place count 4930 transition count 13153
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 25937 place count 4930 transition count 13153
Applied a total of 25937 rules in 7055 ms. Remains 4930 /17896 variables (removed 12966) and now considering 13153/26071 (removed 12918) transitions.
Finished structural reductions, in 1 iterations. Remains : 4930/17896 places, 13153/26071 transitions.
Normalized transition count is 12267 out of 13153 initially.
// Phase 1: matrix 12267 rows 4930 cols
[2022-05-18 07:52:04] [INFO ] Computed 1197 place invariants in 324 ms
Interrupted random walk after 519401 steps, including 8426 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 4
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 564319 steps, including 1222 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 1
Interrupted Best-First random walk after 566224 steps, including 1226 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen 1
Interrupted Best-First random walk after 558874 steps, including 1210 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 1
Interrupted Best-First random walk after 571143 steps, including 1237 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 1
Interrupted Best-First random walk after 576320 steps, including 1248 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen 1
Interrupted Best-First random walk after 576947 steps, including 1249 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen 0
Interrupted Best-First random walk after 574919 steps, including 1245 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 1
[2022-05-18 07:53:09] [INFO ] Flow matrix only has 12267 transitions (discarded 886 similar events)
// Phase 1: matrix 12267 rows 4930 cols
[2022-05-18 07:53:09] [INFO ] Computed 1197 place invariants in 328 ms
[2022-05-18 07:53:10] [INFO ] [Real]Absence check using 47 positive place invariants in 95 ms returned sat
[2022-05-18 07:53:10] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 196 ms returned unsat
[2022-05-18 07:53:11] [INFO ] [Real]Absence check using 47 positive place invariants in 90 ms returned sat
[2022-05-18 07:53:11] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 308 ms returned sat
[2022-05-18 07:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:53:18] [INFO ] [Real]Absence check using state equation in 7042 ms returned sat
[2022-05-18 07:53:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:53:19] [INFO ] [Nat]Absence check using 47 positive place invariants in 97 ms returned sat
[2022-05-18 07:53:19] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 346 ms returned sat
[2022-05-18 07:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:53:27] [INFO ] [Nat]Absence check using state equation in 7914 ms returned sat
[2022-05-18 07:53:28] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 07:53:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:53:31] [INFO ] [Nat]Added 8002 Read/Feed constraints in 3797 ms returned unsat
[2022-05-18 07:53:32] [INFO ] [Real]Absence check using 47 positive place invariants in 92 ms returned sat
[2022-05-18 07:53:32] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 311 ms returned sat
[2022-05-18 07:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:53:38] [INFO ] [Real]Absence check using state equation in 5953 ms returned sat
[2022-05-18 07:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:53:39] [INFO ] [Nat]Absence check using 47 positive place invariants in 80 ms returned sat
[2022-05-18 07:53:39] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 285 ms returned sat
[2022-05-18 07:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:53:45] [INFO ] [Nat]Absence check using state equation in 6032 ms returned sat
[2022-05-18 07:53:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:53:52] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6467 ms returned unknown
[2022-05-18 07:53:52] [INFO ] [Real]Absence check using 47 positive place invariants in 89 ms returned sat
[2022-05-18 07:53:53] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 334 ms returned sat
[2022-05-18 07:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:53:58] [INFO ] [Real]Absence check using state equation in 5200 ms returned sat
[2022-05-18 07:53:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:53:59] [INFO ] [Nat]Absence check using 47 positive place invariants in 80 ms returned sat
[2022-05-18 07:53:59] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 293 ms returned sat
[2022-05-18 07:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:54:06] [INFO ] [Nat]Absence check using state equation in 7010 ms returned sat
[2022-05-18 07:54:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:54:13] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6472 ms returned unknown
[2022-05-18 07:54:13] [INFO ] [Real]Absence check using 47 positive place invariants in 82 ms returned sat
[2022-05-18 07:54:13] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 320 ms returned sat
[2022-05-18 07:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:54:21] [INFO ] [Real]Absence check using state equation in 7215 ms returned sat
[2022-05-18 07:54:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:54:21] [INFO ] [Nat]Absence check using 47 positive place invariants in 78 ms returned sat
[2022-05-18 07:54:22] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 296 ms returned sat
[2022-05-18 07:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:54:29] [INFO ] [Nat]Absence check using state equation in 6961 ms returned sat
[2022-05-18 07:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:54:35] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6406 ms returned unknown
[2022-05-18 07:54:36] [INFO ] [Real]Absence check using 47 positive place invariants in 85 ms returned sat
[2022-05-18 07:54:36] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 281 ms returned sat
[2022-05-18 07:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:54:42] [INFO ] [Real]Absence check using state equation in 6012 ms returned sat
[2022-05-18 07:54:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:54:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 81 ms returned sat
[2022-05-18 07:54:43] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 299 ms returned sat
[2022-05-18 07:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:54:49] [INFO ] [Nat]Absence check using state equation in 5437 ms returned sat
[2022-05-18 07:54:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:54:53] [INFO ] [Nat]Added 8002 Read/Feed constraints in 4133 ms returned sat
[2022-05-18 07:55:00] [INFO ] Deduced a trap composed of 478 places in 7218 ms of which 11 ms to minimize.
[2022-05-18 07:55:11] [INFO ] Deduced a trap composed of 493 places in 8299 ms of which 7 ms to minimize.
[2022-05-18 07:55:20] [INFO ] Deduced a trap composed of 574 places in 7111 ms of which 5 ms to minimize.
[2022-05-18 07:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 29933 ms
[2022-05-18 07:55:23] [INFO ] [Real]Absence check using 47 positive place invariants in 139 ms returned sat
[2022-05-18 07:55:23] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 299 ms returned sat
[2022-05-18 07:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:55:31] [INFO ] [Real]Absence check using state equation in 7727 ms returned sat
[2022-05-18 07:55:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:55:32] [INFO ] [Nat]Absence check using 47 positive place invariants in 83 ms returned sat
[2022-05-18 07:55:32] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 383 ms returned sat
[2022-05-18 07:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:55:41] [INFO ] [Nat]Absence check using state equation in 8711 ms returned sat
[2022-05-18 07:55:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:55:46] [INFO ] [Nat]Added 8002 Read/Feed constraints in 4463 ms returned sat
[2022-05-18 07:55:54] [INFO ] Deduced a trap composed of 671 places in 8293 ms of which 7 ms to minimize.
[2022-05-18 07:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11340 ms
[2022-05-18 07:55:58] [INFO ] Computed and/alt/rep : 4619/6656/4619 causal constraints (skipped 7623 transitions) in 1290 ms.
[2022-05-18 07:56:02] [INFO ] Added : 11 causal constraints over 3 iterations in 4643 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 4930 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4930/4930 places, 13153/13153 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4930 transition count 13151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4928 transition count 13151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4928 transition count 13149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 4926 transition count 13149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 4923 transition count 13146
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 4923 transition count 13146
Applied a total of 14 rules in 1991 ms. Remains 4923 /4930 variables (removed 7) and now considering 13146/13153 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 4923/4930 places, 13146/13153 transitions.
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:56:05] [INFO ] Computed 1197 place invariants in 325 ms
Interrupted random walk after 492871 steps, including 7993 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 513570 steps, including 1112 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
Interrupted Best-First random walk after 516912 steps, including 1119 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted Best-First random walk after 511804 steps, including 1108 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
Interrupted Best-First random walk after 515824 steps, including 1117 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted Best-First random walk after 512144 steps, including 1109 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
[2022-05-18 07:57:00] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:57:01] [INFO ] Computed 1197 place invariants in 319 ms
[2022-05-18 07:57:01] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2022-05-18 07:57:01] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 327 ms returned sat
[2022-05-18 07:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:57:10] [INFO ] [Real]Absence check using state equation in 8898 ms returned sat
[2022-05-18 07:57:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:57:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 105 ms returned sat
[2022-05-18 07:57:12] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 364 ms returned sat
[2022-05-18 07:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:57:20] [INFO ] [Nat]Absence check using state equation in 8719 ms returned sat
[2022-05-18 07:57:21] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 07:57:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:57:27] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6477 ms returned unknown
[2022-05-18 07:57:28] [INFO ] [Real]Absence check using 49 positive place invariants in 113 ms returned sat
[2022-05-18 07:57:28] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 345 ms returned sat
[2022-05-18 07:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:57:38] [INFO ] [Real]Absence check using state equation in 9482 ms returned sat
[2022-05-18 07:57:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:57:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 117 ms returned sat
[2022-05-18 07:57:39] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 370 ms returned sat
[2022-05-18 07:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:57:48] [INFO ] [Nat]Absence check using state equation in 9322 ms returned sat
[2022-05-18 07:57:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:57:55] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6502 ms returned unknown
[2022-05-18 07:57:55] [INFO ] [Real]Absence check using 49 positive place invariants in 118 ms returned sat
[2022-05-18 07:57:56] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 365 ms returned sat
[2022-05-18 07:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:58:04] [INFO ] [Real]Absence check using state equation in 8596 ms returned sat
[2022-05-18 07:58:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:58:05] [INFO ] [Nat]Absence check using 49 positive place invariants in 117 ms returned sat
[2022-05-18 07:58:06] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 380 ms returned sat
[2022-05-18 07:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:58:15] [INFO ] [Nat]Absence check using state equation in 9507 ms returned sat
[2022-05-18 07:58:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:58:22] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6493 ms returned unknown
[2022-05-18 07:58:22] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 07:58:23] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 340 ms returned sat
[2022-05-18 07:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:58:32] [INFO ] [Real]Absence check using state equation in 9232 ms returned sat
[2022-05-18 07:58:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:58:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2022-05-18 07:58:33] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 351 ms returned sat
[2022-05-18 07:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:58:41] [INFO ] [Nat]Absence check using state equation in 8286 ms returned sat
[2022-05-18 07:58:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 07:58:46] [INFO ] [Nat]Added 8002 Read/Feed constraints in 5020 ms returned sat
[2022-05-18 07:58:54] [INFO ] Deduced a trap composed of 452 places in 7114 ms of which 6 ms to minimize.
[2022-05-18 07:58:57] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 10573 ms
[2022-05-18 07:58:58] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 07:58:58] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 315 ms returned sat
[2022-05-18 07:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:59:06] [INFO ] [Real]Absence check using state equation in 7927 ms returned sat
[2022-05-18 07:59:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 07:59:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 105 ms returned sat
[2022-05-18 07:59:07] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 376 ms returned sat
[2022-05-18 07:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 07:59:14] [INFO ] [Nat]Absence check using state equation in 7274 ms returned sat
[2022-05-18 07:59:17] [INFO ] [Nat]Added 8002 Read/Feed constraints in 2868 ms returned sat
[2022-05-18 07:59:19] [INFO ] Computed and/alt/rep : 4614/6648/4614 causal constraints (skipped 7621 transitions) in 1368 ms.
[2022-05-18 07:59:22] [INFO ] Added : 11 causal constraints over 3 iterations in 4462 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Applied a total of 0 rules in 833 ms. Remains 4923 /4923 variables (removed 0) and now considering 13146/13146 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4923/4923 places, 13146/13146 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Applied a total of 0 rules in 812 ms. Remains 4923 /4923 variables (removed 0) and now considering 13146/13146 (removed 0) transitions.
[2022-05-18 07:59:25] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:59:25] [INFO ] Computed 1197 place invariants in 340 ms
[2022-05-18 07:59:32] [INFO ] Implicit Places using invariants in 7233 ms returned []
Implicit Place search using SMT only with invariants took 7237 ms to find 0 implicit places.
[2022-05-18 07:59:32] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:59:33] [INFO ] Computed 1197 place invariants in 322 ms
[2022-05-18 07:59:41] [INFO ] Dead Transitions using invariants and state equation in 8762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4923/4923 places, 13146/13146 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-09
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:59:41] [INFO ] Computed 1197 place invariants in 342 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
[2022-05-18 07:59:42] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 07:59:42] [INFO ] Computed 1197 place invariants in 327 ms
[2022-05-18 07:59:43] [INFO ] [Real]Absence check using 49 positive place invariants in 110 ms returned sat
[2022-05-18 07:59:43] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 333 ms returned sat
[2022-05-18 07:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 07:59:47] [INFO ] [Real]Absence check using state equation in 4091 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4923 transition count 13144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4921 transition count 13144
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4921 transition count 13142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 4919 transition count 13142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 4917 transition count 13140
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 4917 transition count 13140
Applied a total of 12 rules in 2010 ms. Remains 4917 /4923 variables (removed 6) and now considering 13140/13146 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4923 places, 13140/13146 transitions.
Normalized transition count is 12254 out of 13140 initially.
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 07:59:50] [INFO ] Computed 1197 place invariants in 349 ms
Interrupted random walk after 509908 steps, including 8270 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 558849 steps, including 1210 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
[2022-05-18 08:00:25] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:00:25] [INFO ] Computed 1197 place invariants in 374 ms
[2022-05-18 08:00:26] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2022-05-18 08:00:26] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 318 ms returned sat
[2022-05-18 08:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:00:34] [INFO ] [Real]Absence check using state equation in 7889 ms returned sat
[2022-05-18 08:00:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:00:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 118 ms returned sat
[2022-05-18 08:00:35] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 303 ms returned sat
[2022-05-18 08:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:00:42] [INFO ] [Nat]Absence check using state equation in 7178 ms returned sat
[2022-05-18 08:00:43] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 08:00:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:00:49] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6678 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 778 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 780 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
[2022-05-18 08:00:51] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:00:51] [INFO ] Computed 1197 place invariants in 360 ms
[2022-05-18 08:00:56] [INFO ] Implicit Places using invariants in 4911 ms returned []
Implicit Place search using SMT only with invariants took 4912 ms to find 0 implicit places.
[2022-05-18 08:00:56] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:00:56] [INFO ] Computed 1197 place invariants in 339 ms
[2022-05-18 08:01:04] [INFO ] Dead Transitions using invariants and state equation in 8490 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-09 in 83130 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-10
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:01:05] [INFO ] Computed 1197 place invariants in 367 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
[2022-05-18 08:01:05] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:01:06] [INFO ] Computed 1197 place invariants in 351 ms
[2022-05-18 08:01:06] [INFO ] [Real]Absence check using 49 positive place invariants in 117 ms returned sat
[2022-05-18 08:01:07] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 314 ms returned sat
[2022-05-18 08:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:01:11] [INFO ] [Real]Absence check using state equation in 4109 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4923 transition count 13144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4921 transition count 13144
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4921 transition count 13142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 4919 transition count 13142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 4917 transition count 13140
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 4917 transition count 13140
Applied a total of 12 rules in 1934 ms. Remains 4917 /4923 variables (removed 6) and now considering 13140/13146 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4923 places, 13140/13146 transitions.
Normalized transition count is 12254 out of 13140 initially.
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:01:13] [INFO ] Computed 1197 place invariants in 329 ms
Interrupted random walk after 518640 steps, including 8416 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Interrupted Best-First random walk after 552981 steps, including 1197 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
[2022-05-18 08:01:48] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:01:48] [INFO ] Computed 1197 place invariants in 336 ms
[2022-05-18 08:01:49] [INFO ] [Real]Absence check using 49 positive place invariants in 109 ms returned sat
[2022-05-18 08:01:49] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 316 ms returned sat
[2022-05-18 08:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:01:56] [INFO ] [Real]Absence check using state equation in 6435 ms returned sat
[2022-05-18 08:01:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:01:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 119 ms returned sat
[2022-05-18 08:01:57] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 310 ms returned sat
[2022-05-18 08:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:02:04] [INFO ] [Nat]Absence check using state equation in 7507 ms returned sat
[2022-05-18 08:02:05] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 08:02:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:02:11] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6494 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 772 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 804 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
[2022-05-18 08:02:13] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:02:13] [INFO ] Computed 1197 place invariants in 326 ms
[2022-05-18 08:02:18] [INFO ] Implicit Places using invariants in 5401 ms returned []
Implicit Place search using SMT only with invariants took 5402 ms to find 0 implicit places.
[2022-05-18 08:02:18] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:02:18] [INFO ] Computed 1197 place invariants in 348 ms
[2022-05-18 08:02:26] [INFO ] Dead Transitions using invariants and state equation in 8205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-10 in 82034 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-11
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:02:27] [INFO ] Computed 1197 place invariants in 337 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
[2022-05-18 08:02:27] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:02:28] [INFO ] Computed 1197 place invariants in 338 ms
[2022-05-18 08:02:28] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 08:02:29] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 314 ms returned sat
[2022-05-18 08:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:02:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4923 transition count 13144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4921 transition count 13144
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4921 transition count 13142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 4919 transition count 13142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 4917 transition count 13140
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 4917 transition count 13140
Applied a total of 12 rules in 2018 ms. Remains 4917 /4923 variables (removed 6) and now considering 13140/13146 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4923 places, 13140/13146 transitions.
Normalized transition count is 12254 out of 13140 initially.
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:02:35] [INFO ] Computed 1197 place invariants in 327 ms
Interrupted random walk after 498016 steps, including 8080 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 542379 steps, including 1174 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
[2022-05-18 08:03:10] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:03:10] [INFO ] Computed 1197 place invariants in 340 ms
[2022-05-18 08:03:11] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2022-05-18 08:03:11] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 323 ms returned sat
[2022-05-18 08:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:03:19] [INFO ] [Real]Absence check using state equation in 7261 ms returned sat
[2022-05-18 08:03:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:03:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2022-05-18 08:03:20] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 294 ms returned sat
[2022-05-18 08:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:03:25] [INFO ] [Nat]Absence check using state equation in 4954 ms returned sat
[2022-05-18 08:03:25] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 08:03:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:03:31] [INFO ] [Nat]Added 8002 Read/Feed constraints in 6455 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 843 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4917/4917 places, 13140/13140 transitions.
Applied a total of 0 rules in 803 ms. Remains 4917 /4917 variables (removed 0) and now considering 13140/13140 (removed 0) transitions.
[2022-05-18 08:03:33] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:03:33] [INFO ] Computed 1197 place invariants in 330 ms
[2022-05-18 08:03:38] [INFO ] Implicit Places using invariants in 5366 ms returned []
Implicit Place search using SMT only with invariants took 5368 ms to find 0 implicit places.
[2022-05-18 08:03:38] [INFO ] Flow matrix only has 12254 transitions (discarded 886 similar events)
// Phase 1: matrix 12254 rows 4917 cols
[2022-05-18 08:03:39] [INFO ] Computed 1197 place invariants in 332 ms
[2022-05-18 08:03:46] [INFO ] Dead Transitions using invariants and state equation in 7471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4917/4917 places, 13140/13140 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-11 in 79562 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-12
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:03:46] [INFO ] Computed 1197 place invariants in 316 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
[2022-05-18 08:03:47] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:03:47] [INFO ] Computed 1197 place invariants in 315 ms
[2022-05-18 08:03:48] [INFO ] [Real]Absence check using 49 positive place invariants in 102 ms returned sat
[2022-05-18 08:03:48] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 283 ms returned sat
[2022-05-18 08:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:03:52] [INFO ] [Real]Absence check using state equation in 4176 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4923 transition count 13145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4922 transition count 13145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4922 transition count 13144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4921 transition count 13144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4920 transition count 13143
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4920 transition count 13143
Applied a total of 6 rules in 1894 ms. Remains 4920 /4923 variables (removed 3) and now considering 13143/13146 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4923 places, 13143/13146 transitions.
Normalized transition count is 12257 out of 13143 initially.
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:03:54] [INFO ] Computed 1197 place invariants in 329 ms
Interrupted random walk after 541194 steps, including 8781 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 593129 steps, including 1284 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
[2022-05-18 08:04:29] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:04:30] [INFO ] Computed 1197 place invariants in 317 ms
[2022-05-18 08:04:30] [INFO ] [Real]Absence check using 47 positive place invariants in 70 ms returned sat
[2022-05-18 08:04:31] [INFO ] [Real]Absence check using 47 positive and 1150 generalized place invariants in 329 ms returned sat
[2022-05-18 08:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:04:36] [INFO ] [Real]Absence check using state equation in 5506 ms returned sat
[2022-05-18 08:04:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:04:37] [INFO ] [Nat]Absence check using 47 positive place invariants in 65 ms returned sat
[2022-05-18 08:04:37] [INFO ] [Nat]Absence check using 47 positive and 1150 generalized place invariants in 342 ms returned sat
[2022-05-18 08:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:04:44] [INFO ] [Nat]Absence check using state equation in 6819 ms returned sat
[2022-05-18 08:04:44] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 08:04:47] [INFO ] [Nat]Added 8002 Read/Feed constraints in 2434 ms returned sat
[2022-05-18 08:04:54] [INFO ] Deduced a trap composed of 517 places in 6586 ms of which 6 ms to minimize.
[2022-05-18 08:05:02] [INFO ] Deduced a trap composed of 576 places in 6456 ms of which 5 ms to minimize.
[2022-05-18 08:05:10] [INFO ] Deduced a trap composed of 745 places in 6483 ms of which 6 ms to minimize.
[2022-05-18 08:05:13] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 26821 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4920 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4920/4920 places, 13143/13143 transitions.
Applied a total of 0 rules in 751 ms. Remains 4920 /4920 variables (removed 0) and now considering 13143/13143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4920 places, 13143/13143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4920/4920 places, 13143/13143 transitions.
Applied a total of 0 rules in 756 ms. Remains 4920 /4920 variables (removed 0) and now considering 13143/13143 (removed 0) transitions.
[2022-05-18 08:05:15] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:05:16] [INFO ] Computed 1197 place invariants in 305 ms
[2022-05-18 08:05:21] [INFO ] Implicit Places using invariants in 5857 ms returned []
Implicit Place search using SMT only with invariants took 5870 ms to find 0 implicit places.
[2022-05-18 08:05:21] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:05:22] [INFO ] Computed 1197 place invariants in 355 ms
[2022-05-18 08:05:29] [INFO ] Dead Transitions using invariants and state equation in 8199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4920 places, 13143/13143 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-12 in 103611 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-13
Normalized transition count is 12260 out of 13146 initially.
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:05:30] [INFO ] Computed 1197 place invariants in 303 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
[2022-05-18 08:05:30] [INFO ] Flow matrix only has 12260 transitions (discarded 886 similar events)
// Phase 1: matrix 12260 rows 4923 cols
[2022-05-18 08:05:31] [INFO ] Computed 1197 place invariants in 307 ms
[2022-05-18 08:05:31] [INFO ] [Real]Absence check using 49 positive place invariants in 99 ms returned sat
[2022-05-18 08:05:31] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 283 ms returned sat
[2022-05-18 08:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:05:36] [INFO ] [Real]Absence check using state equation in 4223 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4923/4923 places, 13146/13146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4923 transition count 13145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4922 transition count 13145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4922 transition count 13144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4921 transition count 13144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4920 transition count 13143
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4920 transition count 13143
Applied a total of 6 rules in 1788 ms. Remains 4920 /4923 variables (removed 3) and now considering 13143/13146 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4923 places, 13143/13146 transitions.
Normalized transition count is 12257 out of 13143 initially.
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:05:38] [INFO ] Computed 1197 place invariants in 333 ms
Interrupted random walk after 559861 steps, including 9083 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 611505 steps, including 1324 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
[2022-05-18 08:06:13] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:06:13] [INFO ] Computed 1197 place invariants in 337 ms
[2022-05-18 08:06:14] [INFO ] [Real]Absence check using 49 positive place invariants in 100 ms returned sat
[2022-05-18 08:06:14] [INFO ] [Real]Absence check using 49 positive and 1148 generalized place invariants in 280 ms returned sat
[2022-05-18 08:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:06:20] [INFO ] [Real]Absence check using state equation in 5880 ms returned sat
[2022-05-18 08:06:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:06:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2022-05-18 08:06:21] [INFO ] [Nat]Absence check using 49 positive and 1148 generalized place invariants in 282 ms returned sat
[2022-05-18 08:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:06:27] [INFO ] [Nat]Absence check using state equation in 5871 ms returned sat
[2022-05-18 08:06:27] [INFO ] State equation strengthened by 8002 read => feed constraints.
[2022-05-18 08:06:30] [INFO ] [Nat]Added 8002 Read/Feed constraints in 2536 ms returned sat
[2022-05-18 08:06:31] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 7620 transitions) in 902 ms.
[2022-05-18 08:06:34] [INFO ] Added : 11 causal constraints over 3 iterations in 3750 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4920 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4920/4920 places, 13143/13143 transitions.
Applied a total of 0 rules in 726 ms. Remains 4920 /4920 variables (removed 0) and now considering 13143/13143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4920 places, 13143/13143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4920/4920 places, 13143/13143 transitions.
Applied a total of 0 rules in 714 ms. Remains 4920 /4920 variables (removed 0) and now considering 13143/13143 (removed 0) transitions.
[2022-05-18 08:06:36] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:06:36] [INFO ] Computed 1197 place invariants in 382 ms
[2022-05-18 08:06:43] [INFO ] Implicit Places using invariants in 6909 ms returned []
Implicit Place search using SMT only with invariants took 6928 ms to find 0 implicit places.
[2022-05-18 08:06:43] [INFO ] Flow matrix only has 12257 transitions (discarded 886 similar events)
// Phase 1: matrix 12257 rows 4920 cols
[2022-05-18 08:06:43] [INFO ] Computed 1197 place invariants in 312 ms
[2022-05-18 08:06:51] [INFO ] Dead Transitions using invariants and state equation in 7988 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4920/4920 places, 13143/13143 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C10-UpperBounds-13 in 81338 ms.
[2022-05-18 08:06:52] [INFO ] Flatten gal took : 868 ms
[2022-05-18 08:06:53] [INFO ] Applying decomposition
[2022-05-18 08:06:53] [INFO ] Flatten gal took : 651 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9557121516632759012.txt' '-o' '/tmp/graph9557121516632759012.bin' '-w' '/tmp/graph9557121516632759012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9557121516632759012.bin' '-l' '-1' '-v' '-w' '/tmp/graph9557121516632759012.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:06:55] [INFO ] Decomposing Gal with order
[2022-05-18 08:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:07:00] [INFO ] Removed a total of 31204 redundant transitions.
[2022-05-18 08:07:02] [INFO ] Flatten gal took : 5958 ms
[2022-05-18 08:07:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6736 labels/synchronizations in 1025 ms.
[2022-05-18 08:07:04] [INFO ] Time to serialize gal into /tmp/UpperBounds1885804070431166199.gal : 146 ms
[2022-05-18 08:07:04] [INFO ] Time to serialize properties into /tmp/UpperBounds7628159094345685339.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1885804070431166199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7628159094345685339.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7628159094345685339.prop.
Detected timeout of ITS tools.
[2022-05-18 08:32:51] [INFO ] Flatten gal took : 4176 ms
[2022-05-18 08:32:52] [INFO ] Time to serialize gal into /tmp/UpperBounds13774604328645592485.gal : 311 ms
[2022-05-18 08:32:52] [INFO ] Time to serialize properties into /tmp/UpperBounds2729847482506132810.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13774604328645592485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2729847482506132810.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds2729847482506132810.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="MultiCrashLeafsetExtension-PT-S24C10"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C10, 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 r132-tall-165271821300773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C10.tgz
mv MultiCrashLeafsetExtension-PT-S24C10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;