About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4394.848 | 617098.00 | 1014785.00 | 1791.70 | FFFFTTFFFFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350700019.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700019
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716566941136
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 16:09:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 16:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:09:02] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-05-24 16:09:02] [INFO ] Transformed 4260 places.
[2024-05-24 16:09:02] [INFO ] Transformed 6027 transitions.
[2024-05-24 16:09:02] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1095 place count 3165 transition count 4960
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2162 place count 3165 transition count 4960
Discarding 926 places :
Symmetric choice reduction at 1 with 926 rule applications. Total rules 3088 place count 2239 transition count 4034
Iterating global reduction 1 with 926 rules applied. Total rules applied 4014 place count 2239 transition count 4034
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 4225 place count 2028 transition count 3190
Iterating global reduction 1 with 211 rules applied. Total rules applied 4436 place count 2028 transition count 3190
Applied a total of 4436 rules in 865 ms. Remains 2028 /4260 variables (removed 2232) and now considering 3190/6027 (removed 2837) transitions.
[2024-05-24 16:09:04] [INFO ] Flow matrix only has 2918 transitions (discarded 272 similar events)
// Phase 1: matrix 2918 rows 2028 cols
[2024-05-24 16:09:04] [INFO ] Computed 469 invariants in 144 ms
[2024-05-24 16:09:06] [INFO ] Implicit Places using invariants in 2903 ms returned [4, 8, 12, 14, 16, 18, 20, 25, 32, 41, 52, 65, 80, 96, 112, 114, 116, 120, 133, 144, 153, 160, 167, 170, 189, 196, 201, 203, 204, 214, 221, 232, 243, 256, 270, 284, 285, 286, 287, 288, 299, 308, 315, 320, 323, 325, 344, 351, 356, 357, 358, 362, 366, 371, 378, 387, 401, 413, 425, 426, 427, 429, 438, 445, 450, 453, 455, 460, 479, 486, 489, 490, 491, 492, 493, 495, 497, 500, 505, 512, 521, 531, 541, 542, 543, 546, 555, 560, 563, 565, 567, 569, 588, 599, 600, 601, 602, 604, 606, 608, 613, 618, 625, 633, 641, 642, 643, 645, 650, 653, 655, 659, 661, 663, 682, 689, 692, 693, 694, 695, 696, 698, 700, 702, 704, 707, 712, 718, 725, 726, 727, 728, 731, 733, 735, 737, 739, 743, 762, 769, 772, 773, 774, 775, 776, 778, 780, 782, 784, 786, 789, 793, 797, 798, 799, 800, 801, 803, 805, 807, 809, 811, 813, 832, 839, 844, 845, 846, 850, 854, 856, 858, 860, 862, 864, 867, 868, 869, 870, 871, 873, 875, 877, 879, 881, 883, 902, 904, 908, 911, 912, 915, 917, 919, 921, 923, 925, 927, 933, 938, 939, 940, 942, 944, 946, 948, 953, 958, 977, 984, 987, 988, 989, 990, 991, 993, 995, 997, 999, 1001, 1003, 1005, 1008, 1009, 1010, 1011, 1012, 1014, 1016, 1018, 1020, 1022, 1024, 1043, 1050, 1053, 1054, 1056, 1057, 1062, 1064, 1066, 1068, 1070, 1072, 1075, 1080, 1081, 1082, 1083, 1084, 1087, 1089, 1091, 1093, 1095, 1097, 1116, 1123, 1126, 1127, 1128, 1129, 1130, 1132, 1134, 1136, 1138, 1140, 1143, 1148, 1155, 1156, 1157, 1159, 1164, 1167, 1169, 1171, 1173, 1175, 1197, 1204, 1207, 1208, 1209, 1211, 1213, 1215, 1217, 1221, 1224, 1229, 1236, 1245, 1246, 1247, 1249, 1256, 1264, 1267, 1269, 1271, 1273, 1299, 1303, 1304, 1305, 1306, 1308, 1312, 1314, 1318, 1323, 1330, 1339, 1350, 1353, 1354, 1366, 1373, 1378, 1381, 1386, 1388, 1407, 1414, 1417, 1418, 1419, 1420, 1421, 1423, 1425, 1428, 1433, 1440, 1449, 1460, 1473, 1474, 1475, 1476, 1477, 1488, 1497, 1504, 1509, 1512, 1514, 1533, 1540, 1543, 1544, 1545, 1547, 1551, 1554, 1559, 1566, 1575, 1588, 1601, 1616, 1617, 1619, 1620, 1633, 1644, 1656, 1663, 1668, 1671, 1690, 1692, 1696, 1699, 1700, 1701, 1702, 1703, 1706, 1711, 1718, 1727, 1738, 1751, 1766, 1783, 1784, 1785, 1786, 1787, 1802, 1815, 1826, 1835, 1842, 1847, 1867]
[2024-05-24 16:09:06] [INFO ] Actually due to overlaps returned [189, 344, 479, 588, 682, 762, 832, 902, 977, 1043, 1116, 1197, 1407, 1533, 1690, 1867, 4, 12, 14, 16, 18, 112, 114, 116, 144, 201, 203, 284, 285, 286, 287, 308, 356, 357, 425, 426, 427, 445, 489, 490, 491, 492, 541, 542, 543, 560, 599, 600, 601, 641, 642, 643, 653, 692, 693, 694, 695, 725, 726, 727, 733, 772, 773, 774, 775, 797, 798, 799, 800, 805, 844, 845, 867, 868, 869, 870, 875, 904, 911, 912, 938, 939, 944, 987, 988, 989, 990, 1008, 1009, 1010, 1011, 1016, 1053, 1054, 1056, 1080, 1081, 1082, 1083, 1089, 1126, 1127, 1128, 1129, 1155, 1156, 1157, 1167, 1207, 1208, 1209, 1245, 1246, 1247, 1303, 1304, 1305, 1350, 1353, 1378, 1417, 1418, 1419, 1420, 1473, 1474, 1475, 1476, 1504, 1543, 1544, 1545, 1616, 1617, 1619, 1656, 1692, 1699, 1700, 1701, 1702, 1783, 1784, 1785, 1786, 1826]
Discarding 146 places :
Implicit Place search using SMT only with invariants took 2944 ms to find 146 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1882/4260 places, 3190/6027 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 1782 transition count 3090
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1782 transition count 3090
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 299 place count 1683 transition count 2991
Iterating global reduction 0 with 99 rules applied. Total rules applied 398 place count 1683 transition count 2991
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 497 place count 1584 transition count 2892
Iterating global reduction 0 with 99 rules applied. Total rules applied 596 place count 1584 transition count 2892
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 608 place count 1572 transition count 2844
Iterating global reduction 0 with 12 rules applied. Total rules applied 620 place count 1572 transition count 2844
Applied a total of 620 rules in 240 ms. Remains 1572 /1882 variables (removed 310) and now considering 2844/3190 (removed 346) transitions.
[2024-05-24 16:09:07] [INFO ] Flow matrix only has 2572 transitions (discarded 272 similar events)
// Phase 1: matrix 2572 rows 1572 cols
[2024-05-24 16:09:07] [INFO ] Computed 323 invariants in 55 ms
[2024-05-24 16:09:08] [INFO ] Implicit Places using invariants in 1721 ms returned [7, 15, 20, 27, 36, 47, 60, 75, 91, 112, 125, 144, 151, 158, 161, 186, 192, 202, 209, 220, 231, 244, 258, 272, 283, 298, 303, 306, 308, 325, 330, 334, 338, 343, 350, 359, 373, 385, 398, 407, 418, 421, 423, 428, 445, 447, 449, 451, 454, 459, 466, 475, 485, 497, 506, 513, 515, 517, 519, 534, 536, 538, 540, 545, 550, 557, 565, 574, 579, 583, 587, 589, 591, 604, 606, 608, 610, 612, 614, 617, 622, 628, 635, 638, 641, 643, 645, 649, 660, 662, 664, 666, 668, 670, 672, 675, 679, 682, 684, 687, 689, 691, 693, 702, 707, 711, 715, 717, 719, 721, 723, 725, 727, 729, 732, 734, 736, 738, 749, 754, 756, 758, 760, 762, 764, 766, 772, 777, 779, 782, 784, 789, 794, 811, 813, 815, 817, 819, 821, 823, 825, 827, 829, 831, 834, 836, 838, 840, 849, 853, 858, 860, 862, 864, 866, 868, 871, 875, 878, 881, 883, 885, 887, 899, 901, 903, 905, 907, 909, 911, 914, 919, 927, 932, 936, 938, 940, 942, 956, 960, 962, 964, 966, 970, 973, 978, 985, 995, 1002, 1010, 1013, 1015, 1017, 1019, 1033, 1037, 1039, 1043, 1045, 1049, 1054, 1061, 1070, 1083, 1095, 1102, 1109, 1114, 1116, 1131, 1133, 1135, 1137, 1140, 1145, 1152, 1161, 1172, 1184, 1195, 1204, 1215, 1218, 1220, 1229, 1233, 1237, 1240, 1245, 1252, 1261, 1274, 1287, 1303, 1316, 1327, 1345, 1350, 1353, 1364, 1366, 1369, 1374, 1381, 1390, 1401, 1414, 1429, 1446, 1461, 1474, 1493, 1500, 1505]
Discarding 254 places :
Implicit Place search using SMT only with invariants took 1729 ms to find 254 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1318/4260 places, 2844/6027 transitions.
Applied a total of 0 rules in 39 ms. Remains 1318 /1318 variables (removed 0) and now considering 2844/2844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5834 ms. Remains : 1318/4260 places, 2844/6027 transitions.
Support contains 42 out of 1318 places after structural reductions.
[2024-05-24 16:09:09] [INFO ] Flatten gal took : 201 ms
[2024-05-24 16:09:09] [INFO ] Flatten gal took : 136 ms
[2024-05-24 16:09:09] [INFO ] Input system was already deterministic with 2844 transitions.
RANDOM walk for 40000 steps (956 resets) in 1916 ms. (20 steps per ms) remains 17/27 properties
BEST_FIRST walk for 4004 steps (24 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
[2024-05-24 16:09:10] [INFO ] Flow matrix only has 2572 transitions (discarded 272 similar events)
// Phase 1: matrix 2572 rows 1318 cols
[2024-05-24 16:09:10] [INFO ] Computed 69 invariants in 28 ms
[2024-05-24 16:09:10] [INFO ] State equation strengthened by 965 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 1173/1193 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1193 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 89/1282 variables, 29/33 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1282 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/1310 variables, 28/61 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1310 variables, 0/61 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/1318 variables, 8/69 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1318 variables, 0/69 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2572/3890 variables, 1318/1387 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3890 variables, 965/2352 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3890 variables, 0/2352 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3890 variables, 0/2352 constraints. Problems are: Problem set: 13 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3890/3890 variables, and 2352 constraints, problems are : Problem set: 13 solved, 3 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1318/1318 constraints, ReadFeed: 965/965 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1184/1190 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 3 unsolved
[2024-05-24 16:09:13] [INFO ] Deduced a trap composed of 257 places in 627 ms of which 63 ms to minimize.
[2024-05-24 16:09:14] [INFO ] Deduced a trap composed of 295 places in 569 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1190 variables, 2/6 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1190 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 92/1282 variables, 29/35 constraints. Problems are: Problem set: 13 solved, 3 unsolved
[2024-05-24 16:09:14] [INFO ] Deduced a trap composed of 171 places in 667 ms of which 10 ms to minimize.
[2024-05-24 16:09:15] [INFO ] Deduced a trap composed of 210 places in 664 ms of which 12 ms to minimize.
[2024-05-24 16:09:16] [INFO ] Deduced a trap composed of 229 places in 658 ms of which 9 ms to minimize.
[2024-05-24 16:09:16] [INFO ] Deduced a trap composed of 206 places in 634 ms of which 9 ms to minimize.
[2024-05-24 16:09:17] [INFO ] Deduced a trap composed of 196 places in 649 ms of which 9 ms to minimize.
SMT process timed out in 6894ms, After SMT, problems are : Problem set: 13 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1318 transition count 2823
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1297 transition count 2823
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1297 transition count 2796
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1270 transition count 2796
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 113 place count 1253 transition count 2773
Iterating global reduction 2 with 17 rules applied. Total rules applied 130 place count 1253 transition count 2773
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 144 place count 1239 transition count 2729
Iterating global reduction 2 with 14 rules applied. Total rules applied 158 place count 1239 transition count 2729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 1238 transition count 2725
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 1238 transition count 2725
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 224 place count 1206 transition count 2693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 235 place count 1195 transition count 2682
Iterating global reduction 2 with 11 rules applied. Total rules applied 246 place count 1195 transition count 2682
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 257 place count 1184 transition count 2638
Iterating global reduction 2 with 11 rules applied. Total rules applied 268 place count 1184 transition count 2638
Free-agglomeration rule (complex) applied 153 times.
Iterating global reduction 2 with 153 rules applied. Total rules applied 421 place count 1184 transition count 3226
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 574 place count 1031 transition count 3226
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 599 place count 1031 transition count 3226
Applied a total of 599 rules in 1008 ms. Remains 1031 /1318 variables (removed 287) and now considering 3226/2844 (removed -382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 1031/1318 places, 3226/2844 transitions.
RANDOM walk for 40000 steps (1704 resets) in 943 ms. (42 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (184 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
[2024-05-24 16:09:19] [INFO ] Flow matrix only has 2829 transitions (discarded 397 similar events)
// Phase 1: matrix 2829 rows 1031 cols
[2024-05-24 16:09:19] [INFO ] Computed 69 invariants in 28 ms
[2024-05-24 16:09:19] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 920/924 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/995 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/995 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1023 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1023 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1031 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1031 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2829/3860 variables, 1031/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3860 variables, 1634/2734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3860 variables, 0/2734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3860 variables, 0/2734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3860/3860 variables, and 2734 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1031/1031 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 920/924 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:09:21] [INFO ] Deduced a trap composed of 132 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:09:21] [INFO ] Deduced a trap composed of 129 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:09:22] [INFO ] Deduced a trap composed of 136 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:09:22] [INFO ] Deduced a trap composed of 146 places in 490 ms of which 5 ms to minimize.
[2024-05-24 16:09:23] [INFO ] Deduced a trap composed of 116 places in 462 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 71/995 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:09:23] [INFO ] Deduced a trap composed of 80 places in 596 ms of which 6 ms to minimize.
[2024-05-24 16:09:24] [INFO ] Deduced a trap composed of 99 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:09:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
[2024-05-24 16:09:24] [INFO ] Deduced a trap composed of 73 places in 583 ms of which 7 ms to minimize.
[2024-05-24 16:09:25] [INFO ] Deduced a trap composed of 69 places in 571 ms of which 7 ms to minimize.
[2024-05-24 16:09:26] [INFO ] Deduced a trap composed of 84 places in 591 ms of which 7 ms to minimize.
[2024-05-24 16:09:26] [INFO ] Deduced a trap composed of 92 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:09:27] [INFO ] Deduced a trap composed of 27 places in 545 ms of which 6 ms to minimize.
[2024-05-24 16:09:27] [INFO ] Deduced a trap composed of 27 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:09:28] [INFO ] Deduced a trap composed of 113 places in 547 ms of which 7 ms to minimize.
[2024-05-24 16:09:29] [INFO ] Deduced a trap composed of 46 places in 574 ms of which 7 ms to minimize.
[2024-05-24 16:09:29] [INFO ] Deduced a trap composed of 97 places in 552 ms of which 6 ms to minimize.
[2024-05-24 16:09:30] [INFO ] Deduced a trap composed of 97 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:09:30] [INFO ] Deduced a trap composed of 107 places in 542 ms of which 6 ms to minimize.
[2024-05-24 16:09:31] [INFO ] Deduced a trap composed of 46 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:09:31] [INFO ] Deduced a trap composed of 100 places in 591 ms of which 7 ms to minimize.
[2024-05-24 16:09:32] [INFO ] Deduced a trap composed of 94 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:09:33] [INFO ] Deduced a trap composed of 107 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:09:33] [INFO ] Deduced a trap composed of 102 places in 585 ms of which 11 ms to minimize.
[2024-05-24 16:09:34] [INFO ] Deduced a trap composed of 100 places in 583 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:09:34] [INFO ] Deduced a trap composed of 120 places in 582 ms of which 7 ms to minimize.
[2024-05-24 16:09:35] [INFO ] Deduced a trap composed of 142 places in 570 ms of which 10 ms to minimize.
[2024-05-24 16:09:36] [INFO ] Deduced a trap composed of 71 places in 504 ms of which 10 ms to minimize.
[2024-05-24 16:09:36] [INFO ] Deduced a trap composed of 103 places in 544 ms of which 6 ms to minimize.
[2024-05-24 16:09:37] [INFO ] Deduced a trap composed of 92 places in 541 ms of which 7 ms to minimize.
[2024-05-24 16:09:37] [INFO ] Deduced a trap composed of 109 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:09:38] [INFO ] Deduced a trap composed of 107 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:09:38] [INFO ] Deduced a trap composed of 94 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:09:39] [INFO ] Deduced a trap composed of 126 places in 542 ms of which 6 ms to minimize.
[2024-05-24 16:09:39] [INFO ] Deduced a trap composed of 92 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:09:40] [INFO ] Deduced a trap composed of 102 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:09:41] [INFO ] Deduced a trap composed of 89 places in 550 ms of which 6 ms to minimize.
[2024-05-24 16:09:41] [INFO ] Deduced a trap composed of 113 places in 554 ms of which 7 ms to minimize.
[2024-05-24 16:09:42] [INFO ] Deduced a trap composed of 101 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:09:42] [INFO ] Deduced a trap composed of 84 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:09:43] [INFO ] Deduced a trap composed of 111 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:09:43] [INFO ] Deduced a trap composed of 98 places in 552 ms of which 6 ms to minimize.
[2024-05-24 16:09:44] [INFO ] Deduced a trap composed of 121 places in 535 ms of which 7 ms to minimize.
[2024-05-24 16:09:45] [INFO ] Deduced a trap composed of 98 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:09:45] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:09:46] [INFO ] Deduced a trap composed of 126 places in 555 ms of which 7 ms to minimize.
[2024-05-24 16:09:46] [INFO ] Deduced a trap composed of 164 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:09:47] [INFO ] Deduced a trap composed of 105 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:09:47] [INFO ] Deduced a trap composed of 100 places in 526 ms of which 7 ms to minimize.
[2024-05-24 16:09:48] [INFO ] Deduced a trap composed of 374 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:09:48] [INFO ] Deduced a trap composed of 96 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:09:49] [INFO ] Deduced a trap composed of 127 places in 524 ms of which 7 ms to minimize.
[2024-05-24 16:09:50] [INFO ] Deduced a trap composed of 117 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:09:50] [INFO ] Deduced a trap composed of 108 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:09:51] [INFO ] Deduced a trap composed of 139 places in 535 ms of which 7 ms to minimize.
[2024-05-24 16:09:51] [INFO ] Deduced a trap composed of 110 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:09:52] [INFO ] Deduced a trap composed of 62 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:09:52] [INFO ] Deduced a trap composed of 93 places in 544 ms of which 6 ms to minimize.
[2024-05-24 16:09:53] [INFO ] Deduced a trap composed of 86 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:09:53] [INFO ] Deduced a trap composed of 65 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:09:54] [INFO ] Deduced a trap composed of 221 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:09:55] [INFO ] Deduced a trap composed of 57 places in 556 ms of which 6 ms to minimize.
[2024-05-24 16:09:55] [INFO ] Deduced a trap composed of 81 places in 551 ms of which 7 ms to minimize.
[2024-05-24 16:09:56] [INFO ] Deduced a trap composed of 95 places in 558 ms of which 6 ms to minimize.
[2024-05-24 16:09:56] [INFO ] Deduced a trap composed of 103 places in 561 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/995 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:09:57] [INFO ] Deduced a trap composed of 98 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:09:57] [INFO ] Deduced a trap composed of 101 places in 551 ms of which 7 ms to minimize.
[2024-05-24 16:09:58] [INFO ] Deduced a trap composed of 105 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:09:59] [INFO ] Deduced a trap composed of 140 places in 545 ms of which 6 ms to minimize.
[2024-05-24 16:09:59] [INFO ] Deduced a trap composed of 84 places in 569 ms of which 6 ms to minimize.
[2024-05-24 16:10:00] [INFO ] Deduced a trap composed of 94 places in 549 ms of which 6 ms to minimize.
[2024-05-24 16:10:00] [INFO ] Deduced a trap composed of 88 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:10:01] [INFO ] Deduced a trap composed of 99 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:10:01] [INFO ] Deduced a trap composed of 93 places in 539 ms of which 17 ms to minimize.
[2024-05-24 16:10:02] [INFO ] Deduced a trap composed of 102 places in 556 ms of which 6 ms to minimize.
[2024-05-24 16:10:03] [INFO ] Deduced a trap composed of 86 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:10:03] [INFO ] Deduced a trap composed of 104 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:10:04] [INFO ] Deduced a trap composed of 100 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:10:04] [INFO ] Deduced a trap composed of 87 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:10:05] [INFO ] Deduced a trap composed of 112 places in 556 ms of which 6 ms to minimize.
[2024-05-24 16:10:05] [INFO ] Deduced a trap composed of 86 places in 525 ms of which 7 ms to minimize.
SMT process timed out in 46841ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 3226/3226 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 1031 transition count 3225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1030 transition count 3225
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1030 transition count 3225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1028 transition count 3223
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1028 transition count 3223
Applied a total of 8 rules in 192 ms. Remains 1028 /1031 variables (removed 3) and now considering 3223/3226 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 1028/1031 places, 3223/3226 transitions.
RANDOM walk for 40000 steps (1704 resets) in 770 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (184 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (185 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 76517 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :1 out of 2
Probabilistic random walk after 76517 steps, saw 32267 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :1
[2024-05-24 16:10:09] [INFO ] Flow matrix only has 2826 transitions (discarded 397 similar events)
// Phase 1: matrix 2826 rows 1028 cols
[2024-05-24 16:10:09] [INFO ] Computed 69 invariants in 30 ms
[2024-05-24 16:10:09] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 935/937 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/992 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/992 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/1020 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1020 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1028 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1028 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2826/3854 variables, 1028/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3854 variables, 1634/2731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3854 variables, 0/2731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3854 variables, 0/2731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3854/3854 variables, and 2731 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1028/1028 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 935/937 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:11] [INFO ] Deduced a trap composed of 171 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:10:11] [INFO ] Deduced a trap composed of 130 places in 507 ms of which 7 ms to minimize.
[2024-05-24 16:10:12] [INFO ] Deduced a trap composed of 136 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:10:12] [INFO ] Deduced a trap composed of 220 places in 515 ms of which 6 ms to minimize.
[2024-05-24 16:10:13] [INFO ] Deduced a trap composed of 168 places in 517 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/937 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/992 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:13] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:10:14] [INFO ] Deduced a trap composed of 27 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:10:14] [INFO ] Deduced a trap composed of 46 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:10:15] [INFO ] Deduced a trap composed of 151 places in 485 ms of which 7 ms to minimize.
[2024-05-24 16:10:15] [INFO ] Deduced a trap composed of 62 places in 493 ms of which 7 ms to minimize.
[2024-05-24 16:10:16] [INFO ] Deduced a trap composed of 76 places in 493 ms of which 7 ms to minimize.
[2024-05-24 16:10:17] [INFO ] Deduced a trap composed of 86 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:10:17] [INFO ] Deduced a trap composed of 188 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:10:18] [INFO ] Deduced a trap composed of 86 places in 552 ms of which 7 ms to minimize.
[2024-05-24 16:10:18] [INFO ] Deduced a trap composed of 187 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:10:19] [INFO ] Deduced a trap composed of 183 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:10:19] [INFO ] Deduced a trap composed of 177 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:10:20] [INFO ] Deduced a trap composed of 76 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:10:20] [INFO ] Deduced a trap composed of 114 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:10:21] [INFO ] Deduced a trap composed of 133 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:10:21] [INFO ] Deduced a trap composed of 101 places in 514 ms of which 6 ms to minimize.
[2024-05-24 16:10:22] [INFO ] Deduced a trap composed of 27 places in 574 ms of which 6 ms to minimize.
[2024-05-24 16:10:23] [INFO ] Deduced a trap composed of 116 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:10:23] [INFO ] Deduced a trap composed of 107 places in 541 ms of which 6 ms to minimize.
[2024-05-24 16:10:24] [INFO ] Deduced a trap composed of 176 places in 519 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/992 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:24] [INFO ] Deduced a trap composed of 118 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:10:25] [INFO ] Deduced a trap composed of 88 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:10:25] [INFO ] Deduced a trap composed of 89 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:10:26] [INFO ] Deduced a trap composed of 113 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:10:26] [INFO ] Deduced a trap composed of 101 places in 575 ms of which 7 ms to minimize.
[2024-05-24 16:10:27] [INFO ] Deduced a trap composed of 102 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:10:28] [INFO ] Deduced a trap composed of 89 places in 546 ms of which 7 ms to minimize.
[2024-05-24 16:10:28] [INFO ] Deduced a trap composed of 106 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 83 places in 577 ms of which 7 ms to minimize.
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 102 places in 572 ms of which 7 ms to minimize.
[2024-05-24 16:10:30] [INFO ] Deduced a trap composed of 102 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:10:30] [INFO ] Deduced a trap composed of 71 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:10:31] [INFO ] Deduced a trap composed of 93 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:10:32] [INFO ] Deduced a trap composed of 90 places in 557 ms of which 7 ms to minimize.
[2024-05-24 16:10:32] [INFO ] Deduced a trap composed of 101 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:10:33] [INFO ] Deduced a trap composed of 81 places in 563 ms of which 7 ms to minimize.
[2024-05-24 16:10:33] [INFO ] Deduced a trap composed of 114 places in 556 ms of which 7 ms to minimize.
[2024-05-24 16:10:34] [INFO ] Deduced a trap composed of 111 places in 559 ms of which 7 ms to minimize.
[2024-05-24 16:10:35] [INFO ] Deduced a trap composed of 83 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:10:35] [INFO ] Deduced a trap composed of 96 places in 549 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/992 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:36] [INFO ] Deduced a trap composed of 78 places in 565 ms of which 6 ms to minimize.
[2024-05-24 16:10:36] [INFO ] Deduced a trap composed of 46 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:10:37] [INFO ] Deduced a trap composed of 145 places in 493 ms of which 6 ms to minimize.
[2024-05-24 16:10:37] [INFO ] Deduced a trap composed of 62 places in 498 ms of which 7 ms to minimize.
[2024-05-24 16:10:38] [INFO ] Deduced a trap composed of 76 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:10:38] [INFO ] Deduced a trap composed of 111 places in 515 ms of which 7 ms to minimize.
[2024-05-24 16:10:39] [INFO ] Deduced a trap composed of 86 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:10:39] [INFO ] Deduced a trap composed of 74 places in 589 ms of which 7 ms to minimize.
[2024-05-24 16:10:40] [INFO ] Deduced a trap composed of 85 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 165 places in 499 ms of which 7 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 91 places in 582 ms of which 7 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 79 places in 566 ms of which 7 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 81 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:10:43] [INFO ] Deduced a trap composed of 81 places in 598 ms of which 6 ms to minimize.
[2024-05-24 16:10:43] [INFO ] Deduced a trap composed of 46 places in 585 ms of which 6 ms to minimize.
[2024-05-24 16:10:44] [INFO ] Deduced a trap composed of 100 places in 533 ms of which 7 ms to minimize.
[2024-05-24 16:10:45] [INFO ] Deduced a trap composed of 216 places in 598 ms of which 6 ms to minimize.
[2024-05-24 16:10:45] [INFO ] Deduced a trap composed of 101 places in 581 ms of which 7 ms to minimize.
[2024-05-24 16:10:46] [INFO ] Deduced a trap composed of 165 places in 586 ms of which 6 ms to minimize.
[2024-05-24 16:10:46] [INFO ] Deduced a trap composed of 210 places in 583 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/992 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:47] [INFO ] Deduced a trap composed of 207 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:10:48] [INFO ] Deduced a trap composed of 76 places in 592 ms of which 7 ms to minimize.
[2024-05-24 16:10:48] [INFO ] Deduced a trap composed of 85 places in 559 ms of which 6 ms to minimize.
[2024-05-24 16:10:49] [INFO ] Deduced a trap composed of 104 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:10:49] [INFO ] Deduced a trap composed of 88 places in 557 ms of which 7 ms to minimize.
[2024-05-24 16:10:50] [INFO ] Deduced a trap composed of 145 places in 555 ms of which 7 ms to minimize.
[2024-05-24 16:10:51] [INFO ] Deduced a trap composed of 165 places in 535 ms of which 7 ms to minimize.
[2024-05-24 16:10:51] [INFO ] Deduced a trap composed of 80 places in 559 ms of which 7 ms to minimize.
[2024-05-24 16:10:52] [INFO ] Deduced a trap composed of 87 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:10:52] [INFO ] Deduced a trap composed of 156 places in 571 ms of which 7 ms to minimize.
[2024-05-24 16:10:53] [INFO ] Deduced a trap composed of 95 places in 567 ms of which 6 ms to minimize.
[2024-05-24 16:10:53] [INFO ] Deduced a trap composed of 145 places in 513 ms of which 7 ms to minimize.
[2024-05-24 16:10:54] [INFO ] Deduced a trap composed of 105 places in 560 ms of which 7 ms to minimize.
[2024-05-24 16:10:55] [INFO ] Deduced a trap composed of 143 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:10:55] [INFO ] Deduced a trap composed of 118 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:10:56] [INFO ] Deduced a trap composed of 152 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:10:56] [INFO ] Deduced a trap composed of 156 places in 548 ms of which 6 ms to minimize.
[2024-05-24 16:10:57] [INFO ] Deduced a trap composed of 81 places in 560 ms of which 7 ms to minimize.
[2024-05-24 16:10:57] [INFO ] Deduced a trap composed of 163 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:10:58] [INFO ] Deduced a trap composed of 90 places in 567 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/992 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:59] [INFO ] Deduced a trap composed of 99 places in 563 ms of which 6 ms to minimize.
[2024-05-24 16:10:59] [INFO ] Deduced a trap composed of 88 places in 537 ms of which 7 ms to minimize.
[2024-05-24 16:11:00] [INFO ] Deduced a trap composed of 104 places in 538 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/1020 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:00] [INFO ] Deduced a trap composed of 127 places in 551 ms of which 7 ms to minimize.
[2024-05-24 16:11:01] [INFO ] Deduced a trap composed of 123 places in 581 ms of which 6 ms to minimize.
[2024-05-24 16:11:01] [INFO ] Deduced a trap composed of 93 places in 542 ms of which 6 ms to minimize.
[2024-05-24 16:11:02] [INFO ] Deduced a trap composed of 143 places in 558 ms of which 6 ms to minimize.
[2024-05-24 16:11:03] [INFO ] Deduced a trap composed of 107 places in 582 ms of which 6 ms to minimize.
[2024-05-24 16:11:03] [INFO ] Deduced a trap composed of 119 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:11:04] [INFO ] Deduced a trap composed of 103 places in 578 ms of which 7 ms to minimize.
[2024-05-24 16:11:04] [INFO ] Deduced a trap composed of 107 places in 539 ms of which 6 ms to minimize.
[2024-05-24 16:11:05] [INFO ] Deduced a trap composed of 226 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:11:05] [INFO ] Deduced a trap composed of 84 places in 553 ms of which 6 ms to minimize.
[2024-05-24 16:11:06] [INFO ] Deduced a trap composed of 225 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:11:07] [INFO ] Deduced a trap composed of 127 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:11:07] [INFO ] Deduced a trap composed of 131 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:11:08] [INFO ] Deduced a trap composed of 114 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:11:08] [INFO ] Deduced a trap composed of 106 places in 573 ms of which 6 ms to minimize.
[2024-05-24 16:11:09] [INFO ] Deduced a trap composed of 109 places in 558 ms of which 6 ms to minimize.
[2024-05-24 16:11:09] [INFO ] Deduced a trap composed of 247 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:11:10] [INFO ] Deduced a trap composed of 126 places in 562 ms of which 6 ms to minimize.
[2024-05-24 16:11:11] [INFO ] Deduced a trap composed of 133 places in 558 ms of which 7 ms to minimize.
[2024-05-24 16:11:11] [INFO ] Deduced a trap composed of 247 places in 507 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1020 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:12] [INFO ] Deduced a trap composed of 235 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:11:12] [INFO ] Deduced a trap composed of 102 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:11:13] [INFO ] Deduced a trap composed of 130 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:11:13] [INFO ] Deduced a trap composed of 109 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:11:14] [INFO ] Deduced a trap composed of 127 places in 553 ms of which 11 ms to minimize.
[2024-05-24 16:11:15] [INFO ] Deduced a trap composed of 105 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:11:15] [INFO ] Deduced a trap composed of 256 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:11:16] [INFO ] Deduced a trap composed of 133 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:11:16] [INFO ] Deduced a trap composed of 120 places in 526 ms of which 6 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 110 places in 531 ms of which 7 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 95 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Deduced a trap composed of 89 places in 538 ms of which 6 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Deduced a trap composed of 213 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:11:19] [INFO ] Deduced a trap composed of 211 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:11:19] [INFO ] Deduced a trap composed of 217 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:11:20] [INFO ] Deduced a trap composed of 111 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:11:20] [INFO ] Deduced a trap composed of 118 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:11:21] [INFO ] Deduced a trap composed of 82 places in 545 ms of which 6 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 97 places in 553 ms of which 6 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 102 places in 525 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1020 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:23] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:11:23] [INFO ] Deduced a trap composed of 76 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:11:24] [INFO ] Deduced a trap composed of 230 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:11:24] [INFO ] Deduced a trap composed of 95 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:11:25] [INFO ] Deduced a trap composed of 104 places in 567 ms of which 7 ms to minimize.
[2024-05-24 16:11:25] [INFO ] Deduced a trap composed of 104 places in 506 ms of which 6 ms to minimize.
SMT process timed out in 76519ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 3223/3223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1028 transition count 3222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1027 transition count 3222
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1027 transition count 3222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1026 transition count 3221
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1026 transition count 3221
Applied a total of 5 rules in 326 ms. Remains 1026 /1028 variables (removed 2) and now considering 3221/3223 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 1026/1028 places, 3221/3223 transitions.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 486 stabilizing places and 1211 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2807
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 90 place count 1259 transition count 2743
Iterating global reduction 0 with 28 rules applied. Total rules applied 118 place count 1259 transition count 2743
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 133 place count 1244 transition count 2692
Iterating global reduction 0 with 15 rules applied. Total rules applied 148 place count 1244 transition count 2692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 1243 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 1243 transition count 2688
Applied a total of 150 rules in 162 ms. Remains 1243 /1318 variables (removed 75) and now considering 2688/2844 (removed 156) transitions.
[2024-05-24 16:11:26] [INFO ] Flow matrix only has 2416 transitions (discarded 272 similar events)
// Phase 1: matrix 2416 rows 1243 cols
[2024-05-24 16:11:26] [INFO ] Computed 69 invariants in 26 ms
[2024-05-24 16:11:27] [INFO ] Implicit Places using invariants in 1099 ms returned [101, 171, 172, 175, 289, 347, 425, 454, 484, 528, 575, 576, 603, 604, 614, 615, 663, 710, 733, 758, 780, 789, 823, 824, 946, 1004]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1217/1318 places, 2688/2844 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1193 transition count 2664
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1193 transition count 2664
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1169 transition count 2640
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1169 transition count 2640
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1145 transition count 2616
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1145 transition count 2616
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1127 transition count 2544
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1127 transition count 2544
Applied a total of 180 rules in 160 ms. Remains 1127 /1217 variables (removed 90) and now considering 2544/2688 (removed 144) transitions.
[2024-05-24 16:11:27] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1127 cols
[2024-05-24 16:11:28] [INFO ] Computed 43 invariants in 25 ms
[2024-05-24 16:11:28] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-24 16:11:28] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
[2024-05-24 16:11:28] [INFO ] Invariant cache hit.
[2024-05-24 16:11:29] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:11:40] [INFO ] Implicit Places using invariants and state equation in 11819 ms returned [1116]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12778 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1126/1318 places, 2544/2844 transitions.
Applied a total of 0 rules in 31 ms. Remains 1126 /1126 variables (removed 0) and now considering 2544/2544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14235 ms. Remains : 1126/1318 places, 2544/2844 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 749 ms.
Product exploration explored 100000 steps with 50000 reset in 806 ms.
Computed a total of 294 stabilizing places and 911 stable transitions
Computed a total of 294 stabilizing places and 911 stable transitions
Detected a total of 294/1126 stabilizing places and 911/2544 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 finished in 16122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1289 transition count 2809
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1289 transition count 2809
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 1263 transition count 2753
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 1263 transition count 2753
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 125 place count 1248 transition count 2699
Iterating global reduction 0 with 15 rules applied. Total rules applied 140 place count 1248 transition count 2699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 1247 transition count 2695
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 1247 transition count 2695
Applied a total of 142 rules in 241 ms. Remains 1247 /1318 variables (removed 71) and now considering 2695/2844 (removed 149) transitions.
[2024-05-24 16:11:42] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1247 cols
[2024-05-24 16:11:42] [INFO ] Computed 69 invariants in 23 ms
[2024-05-24 16:11:44] [INFO ] Implicit Places using invariants in 1127 ms returned [173, 174, 177, 293, 294, 348, 426, 452, 455, 531, 578, 579, 606, 607, 617, 618, 666, 713, 736, 761, 783, 792, 826, 827, 949, 1007]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1133 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1221/1318 places, 2695/2844 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1198 transition count 2672
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1198 transition count 2672
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1175 transition count 2649
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1175 transition count 2649
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1152 transition count 2626
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1152 transition count 2626
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 155 place count 1135 transition count 2558
Iterating global reduction 0 with 17 rules applied. Total rules applied 172 place count 1135 transition count 2558
Applied a total of 172 rules in 179 ms. Remains 1135 /1221 variables (removed 86) and now considering 2558/2695 (removed 137) transitions.
[2024-05-24 16:11:44] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
// Phase 1: matrix 2286 rows 1135 cols
[2024-05-24 16:11:44] [INFO ] Computed 43 invariants in 28 ms
[2024-05-24 16:11:45] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-05-24 16:11:45] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
[2024-05-24 16:11:45] [INFO ] Invariant cache hit.
[2024-05-24 16:11:45] [INFO ] State equation strengthened by 836 read => feed constraints.
[2024-05-24 16:11:56] [INFO ] Implicit Places using invariants and state equation in 11301 ms returned [1109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1134/1318 places, 2558/2844 transitions.
Applied a total of 0 rules in 32 ms. Remains 1134 /1134 variables (removed 0) and now considering 2558/2558 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13877 ms. Remains : 1134/1318 places, 2558/2844 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06 finished in 13954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2810
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2810
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 91 place count 1258 transition count 2745
Iterating global reduction 0 with 29 rules applied. Total rules applied 120 place count 1258 transition count 2745
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 136 place count 1242 transition count 2690
Iterating global reduction 0 with 16 rules applied. Total rules applied 152 place count 1242 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 1241 transition count 2686
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 1241 transition count 2686
Applied a total of 154 rules in 169 ms. Remains 1241 /1318 variables (removed 77) and now considering 2686/2844 (removed 158) transitions.
[2024-05-24 16:11:56] [INFO ] Flow matrix only has 2414 transitions (discarded 272 similar events)
// Phase 1: matrix 2414 rows 1241 cols
[2024-05-24 16:11:56] [INFO ] Computed 69 invariants in 25 ms
[2024-05-24 16:11:57] [INFO ] Implicit Places using invariants in 1165 ms returned [101, 171, 172, 175, 289, 290, 345, 423, 449, 452, 482, 526, 573, 574, 601, 602, 612, 613, 661, 708, 731, 756, 778, 787, 821, 822, 944, 1002]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1178 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1213/1318 places, 2686/2844 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1188 transition count 2661
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1188 transition count 2661
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 75 place count 1163 transition count 2636
Iterating global reduction 0 with 25 rules applied. Total rules applied 100 place count 1163 transition count 2636
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 1138 transition count 2611
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 1138 transition count 2611
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 169 place count 1119 transition count 2535
Iterating global reduction 0 with 19 rules applied. Total rules applied 188 place count 1119 transition count 2535
Applied a total of 188 rules in 158 ms. Remains 1119 /1213 variables (removed 94) and now considering 2535/2686 (removed 151) transitions.
[2024-05-24 16:11:58] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1119 cols
[2024-05-24 16:11:58] [INFO ] Computed 41 invariants in 32 ms
[2024-05-24 16:11:59] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-24 16:11:59] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 16:11:59] [INFO ] Invariant cache hit.
[2024-05-24 16:11:59] [INFO ] State equation strengthened by 827 read => feed constraints.
[2024-05-24 16:12:10] [INFO ] Implicit Places using invariants and state equation in 11435 ms returned [1108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12398 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1118/1318 places, 2535/2844 transitions.
Applied a total of 0 rules in 36 ms. Remains 1118 /1118 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13940 ms. Remains : 1118/1318 places, 2535/2844 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08 finished in 14061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||F(p1)))'
Support contains 3 out of 1318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1318 transition count 2823
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1297 transition count 2823
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1297 transition count 2796
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1270 transition count 2796
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 114 place count 1252 transition count 2772
Iterating global reduction 2 with 18 rules applied. Total rules applied 132 place count 1252 transition count 2772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 132 place count 1252 transition count 2771
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 1251 transition count 2771
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 149 place count 1236 transition count 2723
Iterating global reduction 2 with 15 rules applied. Total rules applied 164 place count 1236 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 1235 transition count 2719
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 1235 transition count 2719
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 1204 transition count 2688
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 239 place count 1193 transition count 2677
Iterating global reduction 2 with 11 rules applied. Total rules applied 250 place count 1193 transition count 2677
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 261 place count 1182 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 272 place count 1182 transition count 2633
Applied a total of 272 rules in 778 ms. Remains 1182 /1318 variables (removed 136) and now considering 2633/2844 (removed 211) transitions.
[2024-05-24 16:12:11] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1182 cols
[2024-05-24 16:12:11] [INFO ] Computed 69 invariants in 33 ms
[2024-05-24 16:12:12] [INFO ] Implicit Places using invariants in 1133 ms returned [93, 153, 157, 269, 270, 324, 398, 422, 425, 455, 496, 540, 541, 565, 566, 576, 577, 619, 664, 685, 733, 741, 775, 896, 954]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1150 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1318 places, 2633/2844 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1142 transition count 2618
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1142 transition count 2618
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1127 transition count 2603
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1127 transition count 2603
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1118 transition count 2567
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1118 transition count 2567
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 1111 transition count 2560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 1104 transition count 2553
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 1104 transition count 2553
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 1097 transition count 2525
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 1097 transition count 2525
Applied a total of 120 rules in 284 ms. Remains 1097 /1157 variables (removed 60) and now considering 2525/2633 (removed 108) transitions.
[2024-05-24 16:12:12] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1097 cols
[2024-05-24 16:12:12] [INFO ] Computed 44 invariants in 15 ms
[2024-05-24 16:12:13] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2024-05-24 16:12:13] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2024-05-24 16:12:13] [INFO ] Invariant cache hit.
[2024-05-24 16:12:14] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-24 16:12:23] [INFO ] Implicit Places using invariants and state equation in 9158 ms returned []
Implicit Place search using SMT with State Equation took 10218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1097/1318 places, 2525/2844 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12431 ms. Remains : 1097/1318 places, 2525/2844 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09 finished in 12530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2807
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 91 place count 1258 transition count 2742
Iterating global reduction 0 with 29 rules applied. Total rules applied 120 place count 1258 transition count 2742
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 135 place count 1243 transition count 2691
Iterating global reduction 0 with 15 rules applied. Total rules applied 150 place count 1243 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 1242 transition count 2687
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 1242 transition count 2687
Applied a total of 152 rules in 169 ms. Remains 1242 /1318 variables (removed 76) and now considering 2687/2844 (removed 157) transitions.
[2024-05-24 16:12:23] [INFO ] Flow matrix only has 2415 transitions (discarded 272 similar events)
// Phase 1: matrix 2415 rows 1242 cols
[2024-05-24 16:12:23] [INFO ] Computed 69 invariants in 18 ms
[2024-05-24 16:12:24] [INFO ] Implicit Places using invariants in 1187 ms returned [101, 171, 172, 175, 289, 290, 344, 422, 448, 451, 481, 525, 572, 573, 600, 613, 614, 662, 709, 732, 757, 779, 788, 822, 823, 945, 1003]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1215/1318 places, 2687/2844 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1191 transition count 2663
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1191 transition count 2663
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1167 transition count 2639
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1167 transition count 2639
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1143 transition count 2615
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1143 transition count 2615
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1125 transition count 2543
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1125 transition count 2543
Applied a total of 180 rules in 163 ms. Remains 1125 /1215 variables (removed 90) and now considering 2543/2687 (removed 144) transitions.
[2024-05-24 16:12:24] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2024-05-24 16:12:24] [INFO ] Computed 42 invariants in 15 ms
[2024-05-24 16:12:25] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-24 16:12:25] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:12:25] [INFO ] Invariant cache hit.
[2024-05-24 16:12:26] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:12:37] [INFO ] Implicit Places using invariants and state equation in 12277 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13232 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1318 places, 2543/2844 transitions.
Applied a total of 0 rules in 31 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14785 ms. Remains : 1124/1318 places, 2543/2844 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 finished in 14898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1289 transition count 2809
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1289 transition count 2809
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 1263 transition count 2747
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 1263 transition count 2747
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 124 place count 1249 transition count 2700
Iterating global reduction 0 with 14 rules applied. Total rules applied 138 place count 1249 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 1248 transition count 2696
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 1248 transition count 2696
Applied a total of 140 rules in 173 ms. Remains 1248 /1318 variables (removed 70) and now considering 2696/2844 (removed 148) transitions.
[2024-05-24 16:12:38] [INFO ] Flow matrix only has 2424 transitions (discarded 272 similar events)
// Phase 1: matrix 2424 rows 1248 cols
[2024-05-24 16:12:38] [INFO ] Computed 69 invariants in 17 ms
[2024-05-24 16:12:39] [INFO ] Implicit Places using invariants in 1064 ms returned [101, 171, 172, 175, 289, 290, 344, 422, 448, 451, 481, 525, 572, 573, 600, 601, 611, 612, 660, 734, 759, 781, 790, 825, 950, 1008]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1222/1318 places, 2696/2844 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1199 transition count 2673
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1199 transition count 2673
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1176 transition count 2650
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1176 transition count 2650
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1153 transition count 2627
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1153 transition count 2627
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 154 place count 1137 transition count 2563
Iterating global reduction 0 with 16 rules applied. Total rules applied 170 place count 1137 transition count 2563
Applied a total of 170 rules in 157 ms. Remains 1137 /1222 variables (removed 85) and now considering 2563/2696 (removed 133) transitions.
[2024-05-24 16:12:39] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1137 cols
[2024-05-24 16:12:39] [INFO ] Computed 43 invariants in 20 ms
[2024-05-24 16:12:40] [INFO ] Implicit Places using invariants in 997 ms returned []
[2024-05-24 16:12:40] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
[2024-05-24 16:12:40] [INFO ] Invariant cache hit.
[2024-05-24 16:12:41] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 16:12:51] [INFO ] Implicit Places using invariants and state equation in 11336 ms returned [1111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1136/1318 places, 2563/2844 transitions.
Applied a total of 0 rules in 31 ms. Remains 1136 /1136 variables (removed 0) and now considering 2563/2563 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13786 ms. Remains : 1136/1318 places, 2563/2844 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 finished in 13902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 5 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1290 transition count 2810
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1290 transition count 2810
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 81 place count 1265 transition count 2755
Iterating global reduction 0 with 25 rules applied. Total rules applied 106 place count 1265 transition count 2755
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 120 place count 1251 transition count 2705
Iterating global reduction 0 with 14 rules applied. Total rules applied 134 place count 1251 transition count 2705
Applied a total of 134 rules in 132 ms. Remains 1251 /1318 variables (removed 67) and now considering 2705/2844 (removed 139) transitions.
[2024-05-24 16:12:52] [INFO ] Flow matrix only has 2433 transitions (discarded 272 similar events)
// Phase 1: matrix 2433 rows 1251 cols
[2024-05-24 16:12:52] [INFO ] Computed 69 invariants in 26 ms
[2024-05-24 16:12:53] [INFO ] Implicit Places using invariants in 1107 ms returned [101, 171, 172, 289, 290, 425, 451, 454, 484, 577, 578, 605, 606, 616, 617, 665, 712, 735, 760, 782, 827, 828, 950, 1008]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1109 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1318 places, 2705/2844 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1205 transition count 2683
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1205 transition count 2683
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 1183 transition count 2661
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 1183 transition count 2661
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 110 place count 1161 transition count 2639
Iterating global reduction 0 with 22 rules applied. Total rules applied 132 place count 1161 transition count 2639
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 148 place count 1145 transition count 2575
Iterating global reduction 0 with 16 rules applied. Total rules applied 164 place count 1145 transition count 2575
Applied a total of 164 rules in 170 ms. Remains 1145 /1227 variables (removed 82) and now considering 2575/2705 (removed 130) transitions.
[2024-05-24 16:12:53] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
// Phase 1: matrix 2303 rows 1145 cols
[2024-05-24 16:12:53] [INFO ] Computed 45 invariants in 18 ms
[2024-05-24 16:12:54] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-24 16:12:54] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
[2024-05-24 16:12:54] [INFO ] Invariant cache hit.
[2024-05-24 16:12:55] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 16:13:06] [INFO ] Implicit Places using invariants and state equation in 12119 ms returned []
Implicit Place search using SMT with State Equation took 13110 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1145/1318 places, 2575/2844 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14522 ms. Remains : 1145/1318 places, 2575/2844 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Product exploration explored 100000 steps with 2404 reset in 479 ms.
Product exploration explored 100000 steps with 2405 reset in 592 ms.
Computed a total of 313 stabilizing places and 942 stable transitions
Computed a total of 313 stabilizing places and 942 stable transitions
Detected a total of 313/1145 stabilizing places and 942/2575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (957 resets) in 698 ms. (57 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (244 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
[2024-05-24 16:13:08] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
[2024-05-24 16:13:08] [INFO ] Invariant cache hit.
[2024-05-24 16:13:08] [INFO ] State equation strengthened by 845 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1040/1045 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/1079 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1109 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1137 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1145 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2303/3448 variables, 1145/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3448 variables, 845/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3448 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3448 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3448/3448 variables, and 2035 constraints, problems are : Problem set: 0 solved, 1 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1145/1145 constraints, ReadFeed: 845/845 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1040/1045 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/1079 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1109/3448 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/32 constraints, Generalized P Invariants (flows): 5/13 constraints, State Equation: 0/1145 constraints, ReadFeed: 0/845 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1091ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 263 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Support contains 3 out of 1145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1145/1145 places, 2575/2575 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1145 transition count 2563
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1133 transition count 2563
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 24 place count 1133 transition count 2553
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 1123 transition count 2553
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 1101 transition count 2531
Applied a total of 88 rules in 135 ms. Remains 1101 /1145 variables (removed 44) and now considering 2531/2575 (removed 44) transitions.
[2024-05-24 16:13:10] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1101 cols
[2024-05-24 16:13:10] [INFO ] Computed 45 invariants in 24 ms
[2024-05-24 16:13:11] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 16:13:11] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:13:11] [INFO ] Invariant cache hit.
[2024-05-24 16:13:11] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 16:13:21] [INFO ] Implicit Places using invariants and state equation in 10425 ms returned []
Implicit Place search using SMT with State Equation took 11397 ms to find 0 implicit places.
[2024-05-24 16:13:21] [INFO ] Redundant transitions in 107 ms returned []
Running 2514 sub problems to find dead transitions.
[2024-05-24 16:13:21] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:13:21] [INFO ] Invariant cache hit.
[2024-05-24 16:13:21] [INFO ] State equation strengthened by 845 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1099 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2514 unsolved
SMT process timed out in 33532ms, After SMT, problems are : Problem set: 0 solved, 2514 unsolved
Search for dead transitions found 0 dead transitions in 33580ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1101/1145 places, 2531/2575 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45246 ms. Remains : 1101/1145 places, 2531/2575 transitions.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 2713 steps (89 resets) in 28 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3366 reset in 477 ms.
Product exploration explored 100000 steps with 3365 reset in 505 ms.
Built C files in :
/tmp/ltsmin8783836701441099905
[2024-05-24 16:13:56] [INFO ] Too many transitions (2531) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:13:56] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8783836701441099905
Running compilation step : cd /tmp/ltsmin8783836701441099905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8783836701441099905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8783836701441099905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 1101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1099 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1099 transition count 2526
Applied a total of 4 rules in 132 ms. Remains 1099 /1101 variables (removed 2) and now considering 2526/2531 (removed 5) transitions.
[2024-05-24 16:14:00] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1099 cols
[2024-05-24 16:14:00] [INFO ] Computed 45 invariants in 18 ms
[2024-05-24 16:14:01] [INFO ] Implicit Places using invariants in 1007 ms returned [156, 693]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1023 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1097/1101 places, 2526/2531 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1096 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1095 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1095 transition count 2524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1094 transition count 2520
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1094 transition count 2520
Applied a total of 6 rules in 165 ms. Remains 1094 /1097 variables (removed 3) and now considering 2520/2526 (removed 6) transitions.
[2024-05-24 16:14:01] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
// Phase 1: matrix 2248 rows 1094 cols
[2024-05-24 16:14:01] [INFO ] Computed 43 invariants in 17 ms
[2024-05-24 16:14:02] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-24 16:14:02] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
[2024-05-24 16:14:02] [INFO ] Invariant cache hit.
[2024-05-24 16:14:02] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 16:14:12] [INFO ] Implicit Places using invariants and state equation in 9840 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10819 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1101 places, 2520/2531 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2519
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2519
Applied a total of 2 rules in 69 ms. Remains 1092 /1093 variables (removed 1) and now considering 2519/2520 (removed 1) transitions.
[2024-05-24 16:14:12] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1092 cols
[2024-05-24 16:14:12] [INFO ] Computed 42 invariants in 23 ms
[2024-05-24 16:14:13] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-24 16:14:13] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
[2024-05-24 16:14:13] [INFO ] Invariant cache hit.
[2024-05-24 16:14:13] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 16:14:22] [INFO ] Implicit Places using invariants and state equation in 9669 ms returned []
Implicit Place search using SMT with State Equation took 10652 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1092/1101 places, 2519/2531 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 22860 ms. Remains : 1092/1101 places, 2519/2531 transitions.
Built C files in :
/tmp/ltsmin17222689340250469046
[2024-05-24 16:14:22] [INFO ] Too many transitions (2519) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:14:22] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17222689340250469046
Running compilation step : cd /tmp/ltsmin17222689340250469046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17222689340250469046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17222689340250469046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:14:26] [INFO ] Flatten gal took : 163 ms
[2024-05-24 16:14:26] [INFO ] Flatten gal took : 155 ms
[2024-05-24 16:14:26] [INFO ] Time to serialize gal into /tmp/LTL8505996401426108539.gal : 53 ms
[2024-05-24 16:14:26] [INFO ] Time to serialize properties into /tmp/LTL14663933158566382625.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8505996401426108539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12499779357197938156.hoa' '-atoms' '/tmp/LTL14663933158566382625.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14663933158566382625.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12499779357197938156.hoa
Detected timeout of ITS tools.
[2024-05-24 16:14:41] [INFO ] Flatten gal took : 122 ms
[2024-05-24 16:14:41] [INFO ] Flatten gal took : 139 ms
[2024-05-24 16:14:41] [INFO ] Time to serialize gal into /tmp/LTL5223384938850277813.gal : 53 ms
[2024-05-24 16:14:41] [INFO ] Time to serialize properties into /tmp/LTL13478904769172231340.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5223384938850277813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13478904769172231340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=Node1WantsToManageTheCrashOfNode3)"))U(X(G("((Node2HasTheLeafSetOfRx3ToReplaceNod...243
Formula 0 simplified : G!"(Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=Node1WantsToManageTheCrashOfNode3)" R XF!"((Node2HasTheLeafSetOfRx3ToReplaceNode15<...234
Detected timeout of ITS tools.
[2024-05-24 16:14:57] [INFO ] Flatten gal took : 92 ms
[2024-05-24 16:14:57] [INFO ] Applying decomposition
[2024-05-24 16:14:57] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4561911402495747697.txt' '-o' '/tmp/graph4561911402495747697.bin' '-w' '/tmp/graph4561911402495747697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4561911402495747697.bin' '-l' '-1' '-v' '-w' '/tmp/graph4561911402495747697.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:14:57] [INFO ] Decomposing Gal with order
[2024-05-24 16:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:14:57] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-24 16:14:58] [INFO ] Flatten gal took : 254 ms
[2024-05-24 16:14:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-24 16:14:58] [INFO ] Time to serialize gal into /tmp/LTL6761606931317578571.gal : 38 ms
[2024-05-24 16:14:58] [INFO ] Time to serialize properties into /tmp/LTL10676419488019373568.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6761606931317578571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10676419488019373568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu7.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu7.Node1WantsToManageTheCrashOfNode3)"))U(X(G("((gi0.gi6.gu10.Node2HasTheLea...274
Formula 0 simplified : G!"(gu7.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu7.Node1WantsToManageTheCrashOfNode3)" R XF!"((gi0.gi6.gu10.Node2HasTheLeafSet...265
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 finished in 141484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 5 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1318 transition count 2823
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1297 transition count 2823
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1297 transition count 2796
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1270 transition count 2796
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 112 place count 1254 transition count 2774
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 1254 transition count 2774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 128 place count 1254 transition count 2773
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 1253 transition count 2773
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 143 place count 1240 transition count 2730
Iterating global reduction 2 with 13 rules applied. Total rules applied 156 place count 1240 transition count 2730
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 218 place count 1209 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 230 place count 1197 transition count 2687
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 1197 transition count 2687
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 254 place count 1185 transition count 2639
Iterating global reduction 2 with 12 rules applied. Total rules applied 266 place count 1185 transition count 2639
Applied a total of 266 rules in 318 ms. Remains 1185 /1318 variables (removed 133) and now considering 2639/2844 (removed 205) transitions.
[2024-05-24 16:15:14] [INFO ] Flow matrix only has 2367 transitions (discarded 272 similar events)
// Phase 1: matrix 2367 rows 1185 cols
[2024-05-24 16:15:14] [INFO ] Computed 69 invariants in 18 ms
[2024-05-24 16:15:15] [INFO ] Implicit Places using invariants in 1352 ms returned [93, 153, 154, 267, 268, 399, 423, 426, 456, 543, 544, 568, 569, 579, 580, 622, 667, 688, 713, 733, 777, 778, 895, 953]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1361 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1161/1318 places, 2639/2844 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1146 transition count 2624
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1146 transition count 2624
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1131 transition count 2609
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1131 transition count 2609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1123 transition count 2577
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1123 transition count 2577
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 1116 transition count 2570
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 1109 transition count 2563
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 1109 transition count 2563
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 1101 transition count 2531
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 1101 transition count 2531
Applied a total of 120 rules in 266 ms. Remains 1101 /1161 variables (removed 60) and now considering 2531/2639 (removed 108) transitions.
[2024-05-24 16:15:15] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1101 cols
[2024-05-24 16:15:15] [INFO ] Computed 45 invariants in 28 ms
[2024-05-24 16:15:16] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-05-24 16:15:16] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:15:16] [INFO ] Invariant cache hit.
[2024-05-24 16:15:17] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 16:15:27] [INFO ] Implicit Places using invariants and state equation in 10666 ms returned []
Implicit Place search using SMT with State Equation took 11688 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1101/1318 places, 2531/2844 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13633 ms. Remains : 1101/1318 places, 2531/2844 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Product exploration explored 100000 steps with 3377 reset in 544 ms.
Product exploration explored 100000 steps with 3380 reset in 534 ms.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (1344 resets) in 442 ms. (90 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (264 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
[2024-05-24 16:15:29] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:15:29] [INFO ] Invariant cache hit.
[2024-05-24 16:15:29] [INFO ] State equation strengthened by 845 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1018 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1035 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1065 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1093 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1101 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2259/3360 variables, 1101/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3360 variables, 845/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3360 variables, 0/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3360 variables, 0/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3360/3360 variables, and 1991 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1101/1101 constraints, ReadFeed: 845/845 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1018 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1035 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1065/3360 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 4/32 constraints, Generalized P Invariants (flows): 5/13 constraints, State Equation: 0/1101 constraints, ReadFeed: 0/845 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1272ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 3 out of 1101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Applied a total of 0 rules in 64 ms. Remains 1101 /1101 variables (removed 0) and now considering 2531/2531 (removed 0) transitions.
[2024-05-24 16:15:30] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:15:30] [INFO ] Invariant cache hit.
[2024-05-24 16:15:31] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-24 16:15:31] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:15:31] [INFO ] Invariant cache hit.
[2024-05-24 16:15:32] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 16:15:41] [INFO ] Implicit Places using invariants and state equation in 10282 ms returned []
Implicit Place search using SMT with State Equation took 11192 ms to find 0 implicit places.
[2024-05-24 16:15:42] [INFO ] Redundant transitions in 109 ms returned []
Running 2514 sub problems to find dead transitions.
[2024-05-24 16:15:42] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 16:15:42] [INFO ] Invariant cache hit.
[2024-05-24 16:15:42] [INFO ] State equation strengthened by 845 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1099 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2514 unsolved
SMT process timed out in 32987ms, After SMT, problems are : Problem set: 0 solved, 2514 unsolved
Search for dead transitions found 0 dead transitions in 33012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44390 ms. Remains : 1101/1101 places, 2531/2531 transitions.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 3441 steps (114 resets) in 28 ms. (118 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3367 reset in 481 ms.
Product exploration explored 100000 steps with 3366 reset in 533 ms.
Built C files in :
/tmp/ltsmin10066983519919186782
[2024-05-24 16:16:16] [INFO ] Too many transitions (2531) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:16:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10066983519919186782
Running compilation step : cd /tmp/ltsmin10066983519919186782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10066983519919186782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10066983519919186782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 1101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1099 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1099 transition count 2526
Applied a total of 4 rules in 162 ms. Remains 1099 /1101 variables (removed 2) and now considering 2526/2531 (removed 5) transitions.
[2024-05-24 16:16:19] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1099 cols
[2024-05-24 16:16:19] [INFO ] Computed 45 invariants in 21 ms
[2024-05-24 16:16:20] [INFO ] Implicit Places using invariants in 1052 ms returned [153, 690]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1097/1101 places, 2526/2531 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1096 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1095 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1095 transition count 2524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1094 transition count 2520
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1094 transition count 2520
Applied a total of 6 rules in 259 ms. Remains 1094 /1097 variables (removed 3) and now considering 2520/2526 (removed 6) transitions.
[2024-05-24 16:16:21] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
// Phase 1: matrix 2248 rows 1094 cols
[2024-05-24 16:16:21] [INFO ] Computed 43 invariants in 16 ms
[2024-05-24 16:16:22] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2024-05-24 16:16:22] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
[2024-05-24 16:16:22] [INFO ] Invariant cache hit.
[2024-05-24 16:16:22] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 16:16:33] [INFO ] Implicit Places using invariants and state equation in 10894 ms returned [1073]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11980 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1101 places, 2520/2531 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2519
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2519
Applied a total of 2 rules in 75 ms. Remains 1092 /1093 variables (removed 1) and now considering 2519/2520 (removed 1) transitions.
[2024-05-24 16:16:33] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1092 cols
[2024-05-24 16:16:33] [INFO ] Computed 42 invariants in 24 ms
[2024-05-24 16:16:34] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-24 16:16:34] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
[2024-05-24 16:16:34] [INFO ] Invariant cache hit.
[2024-05-24 16:16:34] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 16:16:44] [INFO ] Implicit Places using invariants and state equation in 10772 ms returned []
Implicit Place search using SMT with State Equation took 11872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1092/1101 places, 2519/2531 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 25422 ms. Remains : 1092/1101 places, 2519/2531 transitions.
Built C files in :
/tmp/ltsmin3856292252563092892
[2024-05-24 16:16:44] [INFO ] Too many transitions (2519) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:16:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3856292252563092892
Running compilation step : cd /tmp/ltsmin3856292252563092892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3856292252563092892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3856292252563092892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:16:48] [INFO ] Flatten gal took : 86 ms
[2024-05-24 16:16:48] [INFO ] Flatten gal took : 88 ms
[2024-05-24 16:16:48] [INFO ] Time to serialize gal into /tmp/LTL16259305117298393074.gal : 15 ms
[2024-05-24 16:16:48] [INFO ] Time to serialize properties into /tmp/LTL3111874690097664394.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16259305117298393074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6573211312139050669.hoa' '-atoms' '/tmp/LTL3111874690097664394.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3111874690097664394.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6573211312139050669.hoa
Detected timeout of ITS tools.
[2024-05-24 16:17:03] [INFO ] Flatten gal took : 82 ms
[2024-05-24 16:17:03] [INFO ] Flatten gal took : 104 ms
[2024-05-24 16:17:03] [INFO ] Time to serialize gal into /tmp/LTL5056451653178325478.gal : 12 ms
[2024-05-24 16:17:03] [INFO ] Time to serialize properties into /tmp/LTL6270699273757485726.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5056451653178325478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6270699273757485726.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=Node1WantsToManageTheCrashOfNode3)"))U(X(G("((Node2HasTheLeafSetOfRx3ToReplaceNod...243
Formula 0 simplified : G!"(Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=Node1WantsToManageTheCrashOfNode3)" R XF!"((Node2HasTheLeafSetOfRx3ToReplaceNode15<...234
Detected timeout of ITS tools.
[2024-05-24 16:17:18] [INFO ] Flatten gal took : 56 ms
[2024-05-24 16:17:18] [INFO ] Applying decomposition
[2024-05-24 16:17:18] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2520073691130922358.txt' '-o' '/tmp/graph2520073691130922358.bin' '-w' '/tmp/graph2520073691130922358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2520073691130922358.bin' '-l' '-1' '-v' '-w' '/tmp/graph2520073691130922358.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:17:18] [INFO ] Decomposing Gal with order
[2024-05-24 16:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:17:19] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-24 16:17:19] [INFO ] Flatten gal took : 193 ms
[2024-05-24 16:17:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-24 16:17:19] [INFO ] Time to serialize gal into /tmp/LTL14733989610173590353.gal : 40 ms
[2024-05-24 16:17:19] [INFO ] Time to serialize properties into /tmp/LTL4007185531518718924.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14733989610173590353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4007185531518718924.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu6.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu6.Node1WantsToManageTheCrashOfNode3)"))U(X(G("((gi0.gi6.gu21.Node2HasTheLea...272
Formula 0 simplified : G!"(gu6.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu6.Node1WantsToManageTheCrashOfNode3)" R XF!"((gi0.gi6.gu21.Node2HasTheLeafSet...263
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 finished in 141143 ms.
[2024-05-24 16:17:34] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6485040402171326713
[2024-05-24 16:17:34] [INFO ] Too many transitions (2844) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:17:34] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6485040402171326713
Running compilation step : cd /tmp/ltsmin6485040402171326713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 16:17:34] [INFO ] Applying decomposition
[2024-05-24 16:17:34] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6840938487289910505.txt' '-o' '/tmp/graph6840938487289910505.bin' '-w' '/tmp/graph6840938487289910505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6840938487289910505.bin' '-l' '-1' '-v' '-w' '/tmp/graph6840938487289910505.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:17:35] [INFO ] Decomposing Gal with order
[2024-05-24 16:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:17:35] [INFO ] Removed a total of 1996 redundant transitions.
[2024-05-24 16:17:36] [INFO ] Flatten gal took : 539 ms
[2024-05-24 16:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 121 ms.
[2024-05-24 16:17:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality17683190559632973257.gal : 31 ms
[2024-05-24 16:17:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality17990708156064308688.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17683190559632973257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17990708156064308688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((F("(gu32.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu32.Node1WantsToManageTheCrashOfNode3)"))U(X(G("((gi0.gi6.gu188.Node2HasThe...277
Formula 0 simplified : G!"(gu32.Node13HasAskedItsLeafSetToLx0ToReplaceNode2<=gu32.Node1WantsToManageTheCrashOfNode3)" R XF!"((gi0.gi6.gu188.Node2HasTheLeaf...268
Compilation finished in 8920 ms.
Running link step : cd /tmp/ltsmin6485040402171326713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 404 ms.
Running LTSmin : cd /tmp/ltsmin6485040402171326713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 93935 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 615864 ms.
BK_STOP 1716567558234
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350700019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;