About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.191 | 2246824.00 | 7173730.00 | 11696.50 | TFFTTFFFFFFFFFFT | 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.r263-tall-171654371900018.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 gold2023
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K 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.6M 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-S16C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716625289865
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 08:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:21:31] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-05-25 08:21:31] [INFO ] Transformed 4914 places.
[2024-05-25 08:21:31] [INFO ] Transformed 6913 transitions.
[2024-05-25 08:21:31] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1347 places :
Symmetric choice reduction at 1 with 1347 rule applications. Total rules 1377 place count 3537 transition count 5566
Iterating global reduction 1 with 1347 rules applied. Total rules applied 2724 place count 3537 transition count 5566
Discarding 1178 places :
Symmetric choice reduction at 1 with 1178 rule applications. Total rules 3902 place count 2359 transition count 4388
Iterating global reduction 1 with 1178 rules applied. Total rules applied 5080 place count 2359 transition count 4388
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 5299 place count 2140 transition count 3293
Iterating global reduction 1 with 219 rules applied. Total rules applied 5518 place count 2140 transition count 3293
Applied a total of 5518 rules in 1229 ms. Remains 2140 /4914 variables (removed 2774) and now considering 3293/6913 (removed 3620) transitions.
[2024-05-25 08:21:33] [INFO ] Flow matrix only has 3021 transitions (discarded 272 similar events)
// Phase 1: matrix 3021 rows 2140 cols
[2024-05-25 08:21:33] [INFO ] Computed 505 invariants in 142 ms
[2024-05-25 08:21:36] [INFO ] Implicit Places using invariants in 3767 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 114, 116, 118, 120, 122, 124, 137, 148, 157, 164, 169, 172, 195, 202, 205, 206, 207, 208, 209, 210, 213, 218, 225, 234, 245, 258, 272, 286, 288, 289, 290, 291, 304, 313, 320, 325, 328, 330, 353, 360, 363, 365, 366, 367, 368, 370, 373, 380, 387, 396, 407, 419, 431, 432, 433, 434, 436, 445, 452, 457, 461, 465, 467, 497, 500, 501, 502, 503, 504, 505, 507, 509, 513, 518, 525, 534, 544, 554, 555, 556, 557, 558, 559, 566, 571, 574, 576, 578, 580, 603, 610, 613, 614, 616, 617, 618, 620, 622, 624, 630, 635, 642, 650, 658, 659, 660, 661, 662, 663, 668, 671, 673, 675, 677, 679, 702, 709, 712, 713, 714, 715, 716, 717, 719, 721, 723, 725, 728, 733, 739, 745, 746, 747, 748, 749, 750, 754, 756, 758, 760, 762, 764, 787, 794, 797, 798, 799, 800, 801, 802, 804, 806, 808, 810, 812, 815, 819, 823, 824, 825, 826, 827, 828, 830, 832, 834, 836, 838, 841, 864, 871, 874, 876, 877, 878, 879, 883, 885, 887, 889, 891, 893, 895, 898, 901, 902, 903, 907, 909, 911, 913, 915, 917, 942, 944, 948, 951, 952, 953, 954, 955, 956, 958, 960, 962, 964, 966, 968, 970, 973, 974, 975, 976, 977, 978, 980, 982, 984, 986, 988, 990, 1013, 1020, 1023, 1024, 1025, 1026, 1027, 1028, 1032, 1034, 1036, 1038, 1040, 1042, 1045, 1046, 1047, 1048, 1049, 1050, 1052, 1054, 1056, 1058, 1060, 1062, 1085, 1092, 1097, 1098, 1099, 1100, 1102, 1107, 1109, 1111, 1113, 1115, 1120, 1125, 1126, 1127, 1128, 1129, 1130, 1133, 1135, 1137, 1139, 1141, 1143, 1166, 1173, 1176, 1177, 1178, 1179, 1180, 1181, 1183, 1185, 1187, 1189, 1191, 1194, 1199, 1206, 1207, 1208, 1209, 1210, 1211, 1217, 1221, 1223, 1225, 1227, 1229, 1252, 1259, 1262, 1263, 1264, 1265, 1266, 1267, 1269, 1271, 1273, 1275, 1278, 1283, 1290, 1299, 1300, 1301, 1302, 1303, 1304, 1311, 1316, 1319, 1321, 1323, 1325, 1348, 1355, 1358, 1359, 1360, 1361, 1362, 1363, 1365, 1367, 1369, 1372, 1377, 1384, 1393, 1404, 1405, 1406, 1407, 1408, 1409, 1418, 1425, 1430, 1433, 1435, 1437, 1460, 1467, 1471, 1472, 1473, 1475, 1477, 1482, 1485, 1490, 1508, 1519, 1532, 1533, 1534, 1535, 1536, 1537, 1548, 1557, 1564, 1569, 1572, 1574, 1597, 1604, 1607, 1608, 1609, 1610, 1611, 1612, 1614, 1617, 1622, 1629, 1638, 1649, 1662, 1677, 1678, 1679, 1680, 1681, 1682, 1696, 1707, 1716, 1723, 1728, 1731, 1754, 1756, 1760, 1763, 1764, 1765, 1767, 1768, 1771, 1776, 1783, 1794, 1805, 1818, 1833, 1850, 1851, 1852, 1853, 1854, 1855, 1870, 1883, 1894, 1903, 1910, 1915, 1939]
Discarding 447 places :
Implicit Place search using SMT only with invariants took 3828 ms to find 447 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1693/4914 places, 3293/6913 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 1545 transition count 3145
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 1545 transition count 3145
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 444 place count 1397 transition count 2997
Iterating global reduction 0 with 148 rules applied. Total rules applied 592 place count 1397 transition count 2997
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 738 place count 1251 transition count 2851
Iterating global reduction 0 with 146 rules applied. Total rules applied 884 place count 1251 transition count 2851
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 906 place count 1229 transition count 2741
Iterating global reduction 0 with 22 rules applied. Total rules applied 928 place count 1229 transition count 2741
Applied a total of 928 rules in 206 ms. Remains 1229 /1693 variables (removed 464) and now considering 2741/3293 (removed 552) transitions.
[2024-05-25 08:21:37] [INFO ] Flow matrix only has 2469 transitions (discarded 272 similar events)
// Phase 1: matrix 2469 rows 1229 cols
[2024-05-25 08:21:37] [INFO ] Computed 58 invariants in 34 ms
[2024-05-25 08:21:38] [INFO ] Implicit Places using invariants in 956 ms returned [861]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 959 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1228/4914 places, 2741/6913 transitions.
Applied a total of 0 rules in 37 ms. Remains 1228 /1228 variables (removed 0) and now considering 2741/2741 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6261 ms. Remains : 1228/4914 places, 2741/6913 transitions.
Support contains 58 out of 1228 places after structural reductions.
[2024-05-25 08:21:38] [INFO ] Flatten gal took : 200 ms
[2024-05-25 08:21:38] [INFO ] Flatten gal took : 130 ms
[2024-05-25 08:21:38] [INFO ] Input system was already deterministic with 2741 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2024-05-25 08:21:40] [INFO ] Flow matrix only has 2469 transitions (discarded 272 similar events)
// Phase 1: matrix 2469 rows 1228 cols
[2024-05-25 08:21:40] [INFO ] Computed 57 invariants in 28 ms
[2024-05-25 08:21:40] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-25 08:21:40] [INFO ] [Real]Absence check using 31 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-25 08:21:42] [INFO ] After 2093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:21:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2024-05-25 08:21:42] [INFO ] [Nat]Absence check using 31 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-25 08:21:44] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:21:44] [INFO ] State equation strengthened by 942 read => feed constraints.
[2024-05-25 08:21:48] [INFO ] After 4219ms SMT Verify possible using 942 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2024-05-25 08:21:50] [INFO ] Deduced a trap composed of 237 places in 516 ms of which 10 ms to minimize.
[2024-05-25 08:21:50] [INFO ] Deduced a trap composed of 262 places in 587 ms of which 1 ms to minimize.
[2024-05-25 08:21:51] [INFO ] Deduced a trap composed of 265 places in 541 ms of which 5 ms to minimize.
[2024-05-25 08:21:52] [INFO ] Deduced a trap composed of 273 places in 515 ms of which 2 ms to minimize.
[2024-05-25 08:21:52] [INFO ] Deduced a trap composed of 261 places in 507 ms of which 1 ms to minimize.
[2024-05-25 08:21:53] [INFO ] Deduced a trap composed of 268 places in 496 ms of which 2 ms to minimize.
[2024-05-25 08:21:53] [INFO ] Deduced a trap composed of 272 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:21:54] [INFO ] Deduced a trap composed of 254 places in 511 ms of which 2 ms to minimize.
[2024-05-25 08:21:55] [INFO ] Deduced a trap composed of 278 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:21:55] [INFO ] Deduced a trap composed of 305 places in 526 ms of which 1 ms to minimize.
[2024-05-25 08:21:56] [INFO ] Deduced a trap composed of 265 places in 504 ms of which 1 ms to minimize.
[2024-05-25 08:21:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6930 ms
[2024-05-25 08:21:56] [INFO ] After 12412ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 1150 ms.
[2024-05-25 08:21:57] [INFO ] After 15622ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 11 out of 1228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 30 place count 1213 transition count 2709
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 64 place count 1196 transition count 2709
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 79 place count 1181 transition count 2670
Iterating global reduction 2 with 15 rules applied. Total rules applied 94 place count 1181 transition count 2670
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 94 place count 1181 transition count 2667
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 1178 transition count 2667
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 108 place count 1170 transition count 2627
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 1170 transition count 2627
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 164 place count 1146 transition count 2603
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 1143 transition count 2600
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 1143 transition count 2600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 173 place count 1140 transition count 2585
Iterating global reduction 2 with 3 rules applied. Total rules applied 176 place count 1140 transition count 2585
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 309 place count 1140 transition count 3484
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 442 place count 1007 transition count 3484
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 448 place count 1007 transition count 3484
Applied a total of 448 rules in 781 ms. Remains 1007 /1228 variables (removed 221) and now considering 3484/2741 (removed -743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 1007/1228 places, 3484/2741 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 64498 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{1=1}
Probabilistic random walk after 64498 steps, saw 27218 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :1
Running SMT prover for 4 properties.
[2024-05-25 08:22:02] [INFO ] Flow matrix only has 3095 transitions (discarded 389 similar events)
// Phase 1: matrix 3095 rows 1007 cols
[2024-05-25 08:22:02] [INFO ] Computed 57 invariants in 37 ms
[2024-05-25 08:22:02] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-25 08:22:02] [INFO ] [Real]Absence check using 33 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 08:22:03] [INFO ] After 1312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-25 08:22:03] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:22:04] [INFO ] After 523ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:04] [INFO ] After 2132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2024-05-25 08:22:04] [INFO ] [Nat]Absence check using 33 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-25 08:22:05] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:07] [INFO ] After 1620ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:08] [INFO ] Deduced a trap composed of 113 places in 417 ms of which 1 ms to minimize.
[2024-05-25 08:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2024-05-25 08:22:09] [INFO ] Deduced a trap composed of 162 places in 414 ms of which 0 ms to minimize.
[2024-05-25 08:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2024-05-25 08:22:10] [INFO ] Deduced a trap composed of 123 places in 448 ms of which 1 ms to minimize.
[2024-05-25 08:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 629 ms
[2024-05-25 08:22:10] [INFO ] After 4394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1219 ms.
[2024-05-25 08:22:11] [INFO ] After 7007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 3484/3484 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1007 transition count 3483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1006 transition count 3483
Applied a total of 2 rules in 190 ms. Remains 1006 /1007 variables (removed 1) and now considering 3483/3484 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1006/1007 places, 3483/3484 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67299 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67299 steps, saw 28410 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:22:15] [INFO ] Flow matrix only has 3093 transitions (discarded 390 similar events)
// Phase 1: matrix 3093 rows 1006 cols
[2024-05-25 08:22:15] [INFO ] Computed 57 invariants in 34 ms
[2024-05-25 08:22:15] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-25 08:22:15] [INFO ] [Real]Absence check using 33 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-25 08:22:16] [INFO ] After 1141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-25 08:22:16] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:22:17] [INFO ] After 561ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:17] [INFO ] After 1994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2024-05-25 08:22:17] [INFO ] [Nat]Absence check using 33 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-25 08:22:18] [INFO ] After 1046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:20] [INFO ] After 2084ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:21] [INFO ] Deduced a trap composed of 118 places in 444 ms of which 1 ms to minimize.
[2024-05-25 08:22:21] [INFO ] Deduced a trap composed of 158 places in 444 ms of which 0 ms to minimize.
[2024-05-25 08:22:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1181 ms
[2024-05-25 08:22:23] [INFO ] Deduced a trap composed of 141 places in 463 ms of which 1 ms to minimize.
[2024-05-25 08:22:24] [INFO ] Deduced a trap composed of 168 places in 438 ms of which 1 ms to minimize.
[2024-05-25 08:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1279 ms
[2024-05-25 08:22:24] [INFO ] After 5942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1126 ms.
[2024-05-25 08:22:25] [INFO ] After 8362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 9 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 3483/3483 transitions.
Applied a total of 0 rules in 89 ms. Remains 1006 /1006 variables (removed 0) and now considering 3483/3483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1006/1006 places, 3483/3483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 3483/3483 transitions.
Applied a total of 0 rules in 89 ms. Remains 1006 /1006 variables (removed 0) and now considering 3483/3483 (removed 0) transitions.
[2024-05-25 08:22:25] [INFO ] Flow matrix only has 3093 transitions (discarded 390 similar events)
[2024-05-25 08:22:25] [INFO ] Invariant cache hit.
[2024-05-25 08:22:26] [INFO ] Implicit Places using invariants in 1106 ms returned [198, 234, 306, 368, 461, 470, 471, 509, 531, 532, 681, 851]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1117 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 994/1006 places, 3483/3483 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 987 transition count 3476
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 987 transition count 3476
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 980 transition count 3469
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 980 transition count 3469
Applied a total of 28 rules in 152 ms. Remains 980 /994 variables (removed 14) and now considering 3469/3483 (removed 14) transitions.
[2024-05-25 08:22:26] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
// Phase 1: matrix 3079 rows 980 cols
[2024-05-25 08:22:26] [INFO ] Computed 45 invariants in 26 ms
[2024-05-25 08:22:27] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-05-25 08:22:27] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
[2024-05-25 08:22:27] [INFO ] Invariant cache hit.
[2024-05-25 08:22:28] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:22:42] [INFO ] Implicit Places using invariants and state equation in 14087 ms returned []
Implicit Place search using SMT with State Equation took 15104 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 980/1006 places, 3469/3483 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16462 ms. Remains : 980/1006 places, 3469/3483 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67137 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67137 steps, saw 28162 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:22:45] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
[2024-05-25 08:22:45] [INFO ] Invariant cache hit.
[2024-05-25 08:22:45] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-25 08:22:45] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-25 08:22:47] [INFO ] After 1458ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-25 08:22:47] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:22:47] [INFO ] After 336ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:47] [INFO ] After 2050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:22:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 08:22:47] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-25 08:22:49] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:50] [INFO ] After 1270ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:22:51] [INFO ] Deduced a trap composed of 111 places in 436 ms of which 1 ms to minimize.
[2024-05-25 08:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2024-05-25 08:22:52] [INFO ] Deduced a trap composed of 67 places in 514 ms of which 1 ms to minimize.
[2024-05-25 08:22:52] [INFO ] Deduced a trap composed of 59 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:22:53] [INFO ] Deduced a trap composed of 66 places in 498 ms of which 1 ms to minimize.
[2024-05-25 08:22:54] [INFO ] Deduced a trap composed of 65 places in 504 ms of which 1 ms to minimize.
[2024-05-25 08:22:55] [INFO ] Deduced a trap composed of 71 places in 462 ms of which 1 ms to minimize.
[2024-05-25 08:22:55] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 1 ms to minimize.
[2024-05-25 08:22:56] [INFO ] Deduced a trap composed of 63 places in 464 ms of which 1 ms to minimize.
[2024-05-25 08:22:57] [INFO ] Deduced a trap composed of 53 places in 534 ms of which 1 ms to minimize.
[2024-05-25 08:22:58] [INFO ] Deduced a trap composed of 68 places in 514 ms of which 0 ms to minimize.
[2024-05-25 08:22:58] [INFO ] Deduced a trap composed of 65 places in 482 ms of which 0 ms to minimize.
[2024-05-25 08:22:59] [INFO ] Deduced a trap composed of 69 places in 479 ms of which 1 ms to minimize.
[2024-05-25 08:23:00] [INFO ] Deduced a trap composed of 68 places in 486 ms of which 1 ms to minimize.
[2024-05-25 08:23:00] [INFO ] Deduced a trap composed of 96 places in 473 ms of which 1 ms to minimize.
[2024-05-25 08:23:01] [INFO ] Deduced a trap composed of 72 places in 490 ms of which 1 ms to minimize.
[2024-05-25 08:23:02] [INFO ] Deduced a trap composed of 66 places in 468 ms of which 1 ms to minimize.
[2024-05-25 08:23:02] [INFO ] Deduced a trap composed of 66 places in 494 ms of which 1 ms to minimize.
[2024-05-25 08:23:03] [INFO ] Deduced a trap composed of 70 places in 500 ms of which 1 ms to minimize.
[2024-05-25 08:23:04] [INFO ] Deduced a trap composed of 78 places in 501 ms of which 1 ms to minimize.
[2024-05-25 08:23:04] [INFO ] Deduced a trap composed of 64 places in 472 ms of which 1 ms to minimize.
[2024-05-25 08:23:05] [INFO ] Deduced a trap composed of 64 places in 580 ms of which 1 ms to minimize.
[2024-05-25 08:23:06] [INFO ] Deduced a trap composed of 156 places in 476 ms of which 0 ms to minimize.
[2024-05-25 08:23:07] [INFO ] Deduced a trap composed of 76 places in 524 ms of which 1 ms to minimize.
[2024-05-25 08:23:08] [INFO ] Deduced a trap composed of 181 places in 502 ms of which 0 ms to minimize.
[2024-05-25 08:23:08] [INFO ] Deduced a trap composed of 222 places in 526 ms of which 1 ms to minimize.
[2024-05-25 08:23:09] [INFO ] Deduced a trap composed of 69 places in 513 ms of which 0 ms to minimize.
[2024-05-25 08:23:10] [INFO ] Deduced a trap composed of 79 places in 536 ms of which 1 ms to minimize.
[2024-05-25 08:23:11] [INFO ] Deduced a trap composed of 62 places in 517 ms of which 1 ms to minimize.
[2024-05-25 08:23:12] [INFO ] Deduced a trap composed of 167 places in 544 ms of which 1 ms to minimize.
[2024-05-25 08:23:13] [INFO ] Deduced a trap composed of 2 places in 537 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:23:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:23:13] [INFO ] After 25559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 3469/3469 transitions.
Applied a total of 0 rules in 91 ms. Remains 980 /980 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 980/980 places, 3469/3469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 3469/3469 transitions.
Applied a total of 0 rules in 98 ms. Remains 980 /980 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
[2024-05-25 08:23:13] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
[2024-05-25 08:23:13] [INFO ] Invariant cache hit.
[2024-05-25 08:23:14] [INFO ] Implicit Places using invariants in 989 ms returned []
[2024-05-25 08:23:14] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
[2024-05-25 08:23:14] [INFO ] Invariant cache hit.
[2024-05-25 08:23:14] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:23:28] [INFO ] Implicit Places using invariants and state equation in 14636 ms returned []
Implicit Place search using SMT with State Equation took 15627 ms to find 0 implicit places.
[2024-05-25 08:23:29] [INFO ] Redundant transitions in 241 ms returned []
[2024-05-25 08:23:29] [INFO ] Flow matrix only has 3079 transitions (discarded 390 similar events)
[2024-05-25 08:23:29] [INFO ] Invariant cache hit.
[2024-05-25 08:23:30] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17245 ms. Remains : 980/980 places, 3469/3469 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 396 stabilizing places and 1108 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 83 place count 1178 transition count 2663
Iterating global reduction 2 with 17 rules applied. Total rules applied 100 place count 1178 transition count 2663
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 100 place count 1178 transition count 2659
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 1174 transition count 2659
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 1165 transition count 2614
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 1165 transition count 2614
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 174 place count 1141 transition count 2590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1138 transition count 2587
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1138 transition count 2587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1135 transition count 2572
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 511 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-25 08:23:31] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-25 08:23:31] [INFO ] Computed 57 invariants in 37 ms
[2024-05-25 08:23:32] [INFO ] Implicit Places using invariants in 959 ms returned [222, 264, 348, 418, 527, 537, 538, 577, 600, 601, 773, 774, 964]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 960 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1122/1228 places, 2572/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1114 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1114 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1106 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1106 transition count 2556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1102 transition count 2536
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1102 transition count 2536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1099 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1096 transition count 2530
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1096 transition count 2530
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1092 transition count 2510
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1092 transition count 2510
Applied a total of 60 rules in 379 ms. Remains 1092 /1122 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-25 08:23:32] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-25 08:23:32] [INFO ] Computed 44 invariants in 27 ms
[2024-05-25 08:23:33] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2024-05-25 08:23:33] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-25 08:23:33] [INFO ] Invariant cache hit.
[2024-05-25 08:23:34] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:23:42] [INFO ] Implicit Places using invariants and state equation in 8799 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9928 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1228 places, 2510/2741 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 1091 transition count 2509
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 1090 transition count 2509
Applied a total of 2 rules in 87 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-25 08:23:42] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:23:42] [INFO ] Computed 43 invariants in 27 ms
[2024-05-25 08:23:43] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 08:23:43] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:23:43] [INFO ] Invariant cache hit.
[2024-05-25 08:23:44] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:23:52] [INFO ] Implicit Places using invariants and state equation in 9073 ms returned []
Implicit Place search using SMT with State Equation took 9968 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1228 places, 2509/2741 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21835 ms. Remains : 1090/1228 places, 2509/2741 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s336 1) (LT s340 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2727 reset in 608 ms.
Product exploration explored 100000 steps with 2728 reset in 496 ms.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1090 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 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 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86794 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86794 steps, saw 36486 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:23:56] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:23:56] [INFO ] Invariant cache hit.
[2024-05-25 08:23:57] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-25 08:23:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2024-05-25 08:23:57] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:23:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-25 08:23:57] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 9 ms returned sat
[2024-05-25 08:23:58] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:23:58] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:23:58] [INFO ] After 172ms SMT Verify possible using 834 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:23:59] [INFO ] Deduced a trap composed of 238 places in 403 ms of which 1 ms to minimize.
[2024-05-25 08:23:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2024-05-25 08:23:59] [INFO ] After 760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-25 08:23:59] [INFO ] After 1662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1090 transition count 3448
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 957 transition count 3448
Applied a total of 266 rules in 173 ms. Remains 957 /1090 variables (removed 133) and now considering 3448/2509 (removed -939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 957/1090 places, 3448/2509 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80101 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80101 steps, saw 33378 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:24:02] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
// Phase 1: matrix 3050 rows 957 cols
[2024-05-25 08:24:02] [INFO ] Computed 43 invariants in 51 ms
[2024-05-25 08:24:02] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 08:24:02] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 9 ms returned sat
[2024-05-25 08:24:03] [INFO ] After 779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:24:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-25 08:24:03] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2024-05-25 08:24:04] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:04] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:24:05] [INFO ] After 487ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:05] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-25 08:24:05] [INFO ] After 1663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3448/3448 transitions.
Applied a total of 0 rules in 87 ms. Remains 957 /957 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 957/957 places, 3448/3448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3448/3448 transitions.
Applied a total of 0 rules in 80 ms. Remains 957 /957 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
[2024-05-25 08:24:05] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:24:05] [INFO ] Invariant cache hit.
[2024-05-25 08:24:06] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-25 08:24:06] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:24:06] [INFO ] Invariant cache hit.
[2024-05-25 08:24:07] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:24:20] [INFO ] Implicit Places using invariants and state equation in 14084 ms returned []
Implicit Place search using SMT with State Equation took 15084 ms to find 0 implicit places.
[2024-05-25 08:24:20] [INFO ] Redundant transitions in 185 ms returned []
[2024-05-25 08:24:20] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:24:20] [INFO ] Invariant cache hit.
[2024-05-25 08:24:21] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16556 ms. Remains : 957/957 places, 3448/3448 transitions.
Graph (trivial) has 1047 edges and 957 vertex of which 17 / 957 are part of one of the 1 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3987 edges and 941 vertex of which 927 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1207.t1423 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 910 transition count 2679
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 813 transition count 2486
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 717 transition count 2318
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 645 transition count 2176
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 575 transition count 2056
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 525 transition count 1958
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 477 transition count 1878
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 445 transition count 1816
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 415 transition count 1768
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 397 transition count 1734
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 381 transition count 1710
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 373 transition count 1696
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 367 transition count 1688
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 364 transition count 1686
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 1640 place count 364 transition count 1677
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 1658 place count 355 transition count 1677
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1942 place count 71 transition count 321
Iterating global reduction 14 with 284 rules applied. Total rules applied 2226 place count 71 transition count 321
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 254 rules applied. Total rules applied 2480 place count 71 transition count 67
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2488 place count 63 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2488 place count 63 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2490 place count 62 transition count 66
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2502 place count 50 transition count 49
Iterating global reduction 16 with 12 rules applied. Total rules applied 2514 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2519 place count 45 transition count 44
Iterating global reduction 16 with 5 rules applied. Total rules applied 2524 place count 45 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2528 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2529 place count 42 transition count 40
Iterating global reduction 16 with 1 rules applied. Total rules applied 2530 place count 42 transition count 40
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 16 with 9 rules applied. Total rules applied 2539 place count 42 transition count 31
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2548 place count 33 transition count 31
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2549 place count 33 transition count 31
Applied a total of 2549 rules in 330 ms. Remains 33 /957 variables (removed 924) and now considering 31/3448 (removed 3417) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 33 cols
[2024-05-25 08:24:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-25 08:24:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 08:24:22] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-25 08:24:22] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 08:24:22] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 08:24:22] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 77 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:24:22] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:24:22] [INFO ] Computed 43 invariants in 52 ms
[2024-05-25 08:24:23] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-05-25 08:24:23] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:24:23] [INFO ] Invariant cache hit.
[2024-05-25 08:24:24] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:24:32] [INFO ] Implicit Places using invariants and state equation in 9265 ms returned []
Implicit Place search using SMT with State Equation took 10176 ms to find 0 implicit places.
[2024-05-25 08:24:32] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-25 08:24:32] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:24:32] [INFO ] Invariant cache hit.
[2024-05-25 08:24:33] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11296 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1090 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 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 p0)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86319 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86319 steps, saw 36282 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:24:36] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:24:36] [INFO ] Invariant cache hit.
[2024-05-25 08:24:37] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-25 08:24:37] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 9 ms returned sat
[2024-05-25 08:24:37] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:24:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-25 08:24:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 19 ms returned sat
[2024-05-25 08:24:38] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:38] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:24:38] [INFO ] After 178ms SMT Verify possible using 834 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:39] [INFO ] Deduced a trap composed of 238 places in 382 ms of which 1 ms to minimize.
[2024-05-25 08:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2024-05-25 08:24:39] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-25 08:24:39] [INFO ] After 1676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1090 transition count 3448
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 957 transition count 3448
Applied a total of 266 rules in 180 ms. Remains 957 /1090 variables (removed 133) and now considering 3448/2509 (removed -939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 957/1090 places, 3448/2509 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78189 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78189 steps, saw 32596 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:24:42] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
// Phase 1: matrix 3050 rows 957 cols
[2024-05-25 08:24:42] [INFO ] Computed 43 invariants in 40 ms
[2024-05-25 08:24:43] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-25 08:24:43] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2024-05-25 08:24:43] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:24:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-25 08:24:43] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2024-05-25 08:24:44] [INFO ] After 717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:44] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:24:45] [INFO ] After 478ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:24:45] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-25 08:24:45] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3448/3448 transitions.
Applied a total of 0 rules in 82 ms. Remains 957 /957 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 957/957 places, 3448/3448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3448/3448 transitions.
Applied a total of 0 rules in 83 ms. Remains 957 /957 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
[2024-05-25 08:24:45] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:24:45] [INFO ] Invariant cache hit.
[2024-05-25 08:24:46] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2024-05-25 08:24:46] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:24:46] [INFO ] Invariant cache hit.
[2024-05-25 08:24:47] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:25:01] [INFO ] Implicit Places using invariants and state equation in 14915 ms returned []
Implicit Place search using SMT with State Equation took 15941 ms to find 0 implicit places.
[2024-05-25 08:25:01] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-25 08:25:01] [INFO ] Flow matrix only has 3050 transitions (discarded 398 similar events)
[2024-05-25 08:25:01] [INFO ] Invariant cache hit.
[2024-05-25 08:25:02] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17373 ms. Remains : 957/957 places, 3448/3448 transitions.
Graph (trivial) has 1047 edges and 957 vertex of which 17 / 957 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3987 edges and 941 vertex of which 927 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1207.t1423 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 910 transition count 2679
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 813 transition count 2486
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 717 transition count 2318
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 645 transition count 2176
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 575 transition count 2056
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 525 transition count 1958
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 477 transition count 1878
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 445 transition count 1816
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 415 transition count 1768
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 397 transition count 1734
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 381 transition count 1710
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 373 transition count 1696
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 367 transition count 1688
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 364 transition count 1686
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 1640 place count 364 transition count 1677
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 1658 place count 355 transition count 1677
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1942 place count 71 transition count 321
Iterating global reduction 14 with 284 rules applied. Total rules applied 2226 place count 71 transition count 321
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 254 rules applied. Total rules applied 2480 place count 71 transition count 67
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2488 place count 63 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2488 place count 63 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2490 place count 62 transition count 66
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2502 place count 50 transition count 49
Iterating global reduction 16 with 12 rules applied. Total rules applied 2514 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2519 place count 45 transition count 44
Iterating global reduction 16 with 5 rules applied. Total rules applied 2524 place count 45 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2528 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2529 place count 42 transition count 40
Iterating global reduction 16 with 1 rules applied. Total rules applied 2530 place count 42 transition count 40
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 16 with 9 rules applied. Total rules applied 2539 place count 42 transition count 31
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2548 place count 33 transition count 31
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2549 place count 33 transition count 31
Applied a total of 2549 rules in 282 ms. Remains 33 /957 variables (removed 924) and now considering 31/3448 (removed 3417) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 33 cols
[2024-05-25 08:25:03] [INFO ] Computed 12 invariants in 0 ms
[2024-05-25 08:25:03] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 08:25:03] [INFO ] [Real]Absence check using 2 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-25 08:25:03] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 08:25:03] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 08:25:03] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2726 reset in 466 ms.
Product exploration explored 100000 steps with 2727 reset in 491 ms.
Built C files in :
/tmp/ltsmin8754743653896065288
[2024-05-25 08:25:04] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:25:04] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8754743653896065288
Running compilation step : cd /tmp/ltsmin8754743653896065288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8754743653896065288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8754743653896065288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 76 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:25:07] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:25:07] [INFO ] Computed 43 invariants in 20 ms
[2024-05-25 08:25:08] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-25 08:25:08] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:25:08] [INFO ] Invariant cache hit.
[2024-05-25 08:25:09] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:25:17] [INFO ] Implicit Places using invariants and state equation in 8759 ms returned []
Implicit Place search using SMT with State Equation took 9658 ms to find 0 implicit places.
[2024-05-25 08:25:17] [INFO ] Redundant transitions in 83 ms returned []
[2024-05-25 08:25:17] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:25:17] [INFO ] Invariant cache hit.
[2024-05-25 08:25:18] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10845 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin10332922450469880338
[2024-05-25 08:25:18] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:25:18] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10332922450469880338
Running compilation step : cd /tmp/ltsmin10332922450469880338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10332922450469880338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10332922450469880338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:25:21] [INFO ] Flatten gal took : 76 ms
[2024-05-25 08:25:22] [INFO ] Flatten gal took : 70 ms
[2024-05-25 08:25:22] [INFO ] Time to serialize gal into /tmp/LTL5833635753737559633.gal : 22 ms
[2024-05-25 08:25:22] [INFO ] Time to serialize properties into /tmp/LTL4083704362702251992.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5833635753737559633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6348535855567323749.hoa' '-atoms' '/tmp/LTL4083704362702251992.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4083704362702251992.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6348535855567323749.hoa
Detected timeout of ITS tools.
[2024-05-25 08:25:37] [INFO ] Flatten gal took : 60 ms
[2024-05-25 08:25:37] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:25:37] [INFO ] Time to serialize gal into /tmp/LTL8102583555298712422.gal : 13 ms
[2024-05-25 08:25:37] [INFO ] Time to serialize properties into /tmp/LTL17852749751634229681.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8102583555298712422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17852749751634229681.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(LeafSetOfRx4IsSentToNode2<1))"))))
Formula 0 simplified : GF!"((Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(LeafSetOfRx4IsSentToNode2<1))"
Detected timeout of ITS tools.
[2024-05-25 08:25:52] [INFO ] Flatten gal took : 71 ms
[2024-05-25 08:25:52] [INFO ] Applying decomposition
[2024-05-25 08:25:52] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11247916388902733151.txt' '-o' '/tmp/graph11247916388902733151.bin' '-w' '/tmp/graph11247916388902733151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11247916388902733151.bin' '-l' '-1' '-v' '-w' '/tmp/graph11247916388902733151.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:25:52] [INFO ] Decomposing Gal with order
[2024-05-25 08:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:25:53] [INFO ] Removed a total of 2242 redundant transitions.
[2024-05-25 08:25:53] [INFO ] Flatten gal took : 617 ms
[2024-05-25 08:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1297 labels/synchronizations in 124 ms.
[2024-05-25 08:25:53] [INFO ] Time to serialize gal into /tmp/LTL3616607979354601756.gal : 22 ms
[2024-05-25 08:25:54] [INFO ] Time to serialize properties into /tmp/LTL728279959927827780.ltl : 430 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3616607979354601756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL728279959927827780.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G("((i17.u160.Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(i17.u160.LeafSetOfRx4IsSentToNode2<1))"))))
Formula 0 simplified : GF!"((i17.u160.Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(i17.u160.LeafSetOfRx4IsSentToNode2<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin426703316894807533
[2024-05-25 08:26:09] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin426703316894807533
Running compilation step : cd /tmp/ltsmin426703316894807533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin426703316894807533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin426703316894807533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 finished in 161601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 83 place count 1178 transition count 2663
Iterating global reduction 2 with 17 rules applied. Total rules applied 100 place count 1178 transition count 2663
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 100 place count 1178 transition count 2658
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 1173 transition count 2658
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 119 place count 1164 transition count 2613
Iterating global reduction 2 with 9 rules applied. Total rules applied 128 place count 1164 transition count 2613
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 174 place count 1141 transition count 2590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1138 transition count 2587
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1138 transition count 2587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1135 transition count 2572
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 392 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-25 08:26:12] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-25 08:26:12] [INFO ] Computed 57 invariants in 43 ms
[2024-05-25 08:26:13] [INFO ] Implicit Places using invariants in 1044 ms returned [221, 263, 317, 344, 414, 523, 533, 534, 573, 597, 772, 773, 963]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1047 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1122/1228 places, 2572/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1114 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1114 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1106 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1106 transition count 2556
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1101 transition count 2531
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1101 transition count 2531
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1098 transition count 2528
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1095 transition count 2525
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1095 transition count 2525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1092 transition count 2510
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1092 transition count 2510
Applied a total of 60 rules in 371 ms. Remains 1092 /1122 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-25 08:26:14] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-25 08:26:14] [INFO ] Computed 44 invariants in 32 ms
[2024-05-25 08:26:14] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 08:26:14] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-25 08:26:14] [INFO ] Invariant cache hit.
[2024-05-25 08:26:15] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:26:24] [INFO ] Implicit Places using invariants and state equation in 9258 ms returned [1086]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1228 places, 2510/2741 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 1091 transition count 2509
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 1090 transition count 2509
Applied a total of 2 rules in 79 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-25 08:26:24] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:26:24] [INFO ] Computed 43 invariants in 29 ms
[2024-05-25 08:26:25] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-05-25 08:26:25] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:26:25] [INFO ] Invariant cache hit.
[2024-05-25 08:26:25] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:26:34] [INFO ] Implicit Places using invariants and state equation in 8960 ms returned []
Implicit Place search using SMT with State Equation took 9813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1228 places, 2509/2741 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21853 ms. Remains : 1090/1228 places, 2509/2741 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s413 1) (GEQ s547 1)), p0:(AND (GEQ s584 1) (GEQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 finished in 21969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2698
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2698
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1197 transition count 2650
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1197 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1194 transition count 2635
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1194 transition count 2635
Applied a total of 68 rules in 191 ms. Remains 1194 /1228 variables (removed 34) and now considering 2635/2741 (removed 106) transitions.
[2024-05-25 08:26:34] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1194 cols
[2024-05-25 08:26:34] [INFO ] Computed 57 invariants in 36 ms
[2024-05-25 08:26:35] [INFO ] Implicit Places using invariants in 1020 ms returned [243, 287, 341, 370, 442, 556, 566, 613, 637, 638, 816, 817, 1011]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1181/1228 places, 2635/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1170 transition count 2624
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1170 transition count 2624
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1159 transition count 2613
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1159 transition count 2613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1148 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1148 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1140 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1140 transition count 2562
Applied a total of 82 rules in 246 ms. Remains 1140 /1181 variables (removed 41) and now considering 2562/2635 (removed 73) transitions.
[2024-05-25 08:26:35] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2024-05-25 08:26:35] [INFO ] Computed 44 invariants in 41 ms
[2024-05-25 08:26:36] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-25 08:26:36] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-25 08:26:36] [INFO ] Invariant cache hit.
[2024-05-25 08:26:37] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:26:43] [INFO ] Implicit Places using invariants and state equation in 7419 ms returned []
Implicit Place search using SMT with State Equation took 8367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1228 places, 2562/2741 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9828 ms. Remains : 1140/1228 places, 2562/2741 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s550 1) (LT s558 1)), p0:(OR (LT s490 1) (LT s1123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1923 reset in 435 ms.
Product exploration explored 100000 steps with 1922 reset in 420 ms.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3516 steps, including 67 resets, run visited all 2 properties in 25 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 38 place count 1121 transition count 2533
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 58 place count 1111 transition count 2533
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 94 place count 1093 transition count 2515
Applied a total of 94 rules in 173 ms. Remains 1093 /1140 variables (removed 47) and now considering 2515/2562 (removed 47) transitions.
[2024-05-25 08:26:45] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2024-05-25 08:26:45] [INFO ] Computed 44 invariants in 25 ms
[2024-05-25 08:26:46] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 08:26:46] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:26:46] [INFO ] Invariant cache hit.
[2024-05-25 08:26:47] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:26:55] [INFO ] Implicit Places using invariants and state equation in 8502 ms returned [1075]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9394 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1092/1140 places, 2515/2562 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 1092 transition count 2514
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 1091 transition count 2514
Applied a total of 2 rules in 78 ms. Remains 1091 /1092 variables (removed 1) and now considering 2514/2515 (removed 1) transitions.
[2024-05-25 08:26:55] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2024-05-25 08:26:55] [INFO ] Computed 43 invariants in 25 ms
[2024-05-25 08:26:56] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-25 08:26:56] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-25 08:26:56] [INFO ] Invariant cache hit.
[2024-05-25 08:26:56] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:27:03] [INFO ] Implicit Places using invariants and state equation in 7542 ms returned []
Implicit Place search using SMT with State Equation took 8449 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1140 places, 2514/2562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18095 ms. Remains : 1091/1140 places, 2514/2562 transitions.
Computed a total of 276 stabilizing places and 898 stable transitions
Computed a total of 276 stabilizing places and 898 stable transitions
Detected a total of 276/1091 stabilizing places and 898/2514 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 7500 steps, including 203 resets, run visited all 2 properties in 63 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 2726 reset in 532 ms.
Product exploration explored 100000 steps with 2725 reset in 535 ms.
Built C files in :
/tmp/ltsmin13430526068191765372
[2024-05-25 08:27:05] [INFO ] Too many transitions (2514) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:27:05] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13430526068191765372
Running compilation step : cd /tmp/ltsmin13430526068191765372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13430526068191765372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13430526068191765372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 71 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2024-05-25 08:27:08] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-25 08:27:08] [INFO ] Invariant cache hit.
[2024-05-25 08:27:09] [INFO ] Implicit Places using invariants in 849 ms returned []
[2024-05-25 08:27:09] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-25 08:27:09] [INFO ] Invariant cache hit.
[2024-05-25 08:27:10] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:27:18] [INFO ] Implicit Places using invariants and state equation in 9075 ms returned []
Implicit Place search using SMT with State Equation took 9925 ms to find 0 implicit places.
[2024-05-25 08:27:18] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-25 08:27:18] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-25 08:27:18] [INFO ] Invariant cache hit.
[2024-05-25 08:27:19] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11155 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Built C files in :
/tmp/ltsmin5933542732856507914
[2024-05-25 08:27:19] [INFO ] Too many transitions (2514) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:27:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5933542732856507914
Running compilation step : cd /tmp/ltsmin5933542732856507914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5933542732856507914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5933542732856507914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:27:22] [INFO ] Flatten gal took : 124 ms
[2024-05-25 08:27:23] [INFO ] Flatten gal took : 108 ms
[2024-05-25 08:27:23] [INFO ] Time to serialize gal into /tmp/LTL3229755122082500187.gal : 49 ms
[2024-05-25 08:27:23] [INFO ] Time to serialize properties into /tmp/LTL10266502627579423426.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3229755122082500187.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8252309409616213854.hoa' '-atoms' '/tmp/LTL10266502627579423426.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10266502627579423426.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8252309409616213854.hoa
Detected timeout of ITS tools.
[2024-05-25 08:27:38] [INFO ] Flatten gal took : 50 ms
[2024-05-25 08:27:38] [INFO ] Flatten gal took : 53 ms
[2024-05-25 08:27:38] [INFO ] Time to serialize gal into /tmp/LTL17763583685561426719.gal : 10 ms
[2024-05-25 08:27:38] [INFO ] Time to serialize properties into /tmp/LTL2495109306105450726.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17763583685561426719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2495109306105450726.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))")))||(G("((Node7HasAskedItsLeafSetToRx2ToReplace...202
Formula 0 simplified : X(GF!"((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))" & F!"((Node7HasAskedItsLeafSetToRx2ToReplaceNode10...192
Detected timeout of ITS tools.
[2024-05-25 08:27:53] [INFO ] Flatten gal took : 56 ms
[2024-05-25 08:27:53] [INFO ] Applying decomposition
[2024-05-25 08:27:53] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15457950870915721372.txt' '-o' '/tmp/graph15457950870915721372.bin' '-w' '/tmp/graph15457950870915721372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15457950870915721372.bin' '-l' '-1' '-v' '-w' '/tmp/graph15457950870915721372.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:27:53] [INFO ] Decomposing Gal with order
[2024-05-25 08:27:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:27:53] [INFO ] Removed a total of 2258 redundant transitions.
[2024-05-25 08:27:53] [INFO ] Flatten gal took : 196 ms
[2024-05-25 08:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1523 labels/synchronizations in 127 ms.
[2024-05-25 08:27:54] [INFO ] Time to serialize gal into /tmp/LTL10609429870014681.gal : 19 ms
[2024-05-25 08:27:54] [INFO ] Time to serialize properties into /tmp/LTL15842326841788811832.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10609429870014681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15842326841788811832.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i3.i0.u157.Node5ManageTheCrashOfNode9<1)||(i3.i5.u160.Rx2IsAtTheRightExtremityOfTheLeafSet<1))")))||(G("((i3.i5.u159.Node...246
Formula 0 simplified : X(GF!"((i3.i0.u157.Node5ManageTheCrashOfNode9<1)||(i3.i5.u160.Rx2IsAtTheRightExtremityOfTheLeafSet<1))" & F!"((i3.i5.u159.Node7HasAs...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4944701024581427292
[2024-05-25 08:28:09] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4944701024581427292
Running compilation step : cd /tmp/ltsmin4944701024581427292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4944701024581427292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4944701024581427292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 98130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1210 transition count 2703
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1210 transition count 2703
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1198 transition count 2651
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1198 transition count 2651
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1196 transition count 2641
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1196 transition count 2641
Applied a total of 64 rules in 196 ms. Remains 1196 /1228 variables (removed 32) and now considering 2641/2741 (removed 100) transitions.
[2024-05-25 08:28:12] [INFO ] Flow matrix only has 2369 transitions (discarded 272 similar events)
// Phase 1: matrix 2369 rows 1196 cols
[2024-05-25 08:28:12] [INFO ] Computed 57 invariants in 30 ms
[2024-05-25 08:28:13] [INFO ] Implicit Places using invariants in 983 ms returned [243, 287, 341, 370, 443, 556, 566, 567, 611, 635, 818, 819, 1013]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 986 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1183/1228 places, 2641/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 2630
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 2630
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1161 transition count 2619
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1161 transition count 2619
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1150 transition count 2608
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1150 transition count 2608
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1142 transition count 2568
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1142 transition count 2568
Applied a total of 82 rules in 248 ms. Remains 1142 /1183 variables (removed 41) and now considering 2568/2641 (removed 73) transitions.
[2024-05-25 08:28:13] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
// Phase 1: matrix 2296 rows 1142 cols
[2024-05-25 08:28:13] [INFO ] Computed 44 invariants in 38 ms
[2024-05-25 08:28:14] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-05-25 08:28:14] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
[2024-05-25 08:28:14] [INFO ] Invariant cache hit.
[2024-05-25 08:28:15] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-25 08:28:23] [INFO ] Implicit Places using invariants and state equation in 9077 ms returned []
Implicit Place search using SMT with State Equation took 10044 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1228 places, 2568/2741 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11476 ms. Remains : 1142/1228 places, 2568/2741 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s659 1) (GEQ s1128 1)), p1:(OR (AND (GEQ s367 1) (GEQ s1113 1)) (GEQ s611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 finished in 11797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 6 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2694
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2694
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 1198 transition count 2647
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 1198 transition count 2647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1196 transition count 2637
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1196 transition count 2637
Applied a total of 64 rules in 185 ms. Remains 1196 /1228 variables (removed 32) and now considering 2637/2741 (removed 104) transitions.
[2024-05-25 08:28:24] [INFO ] Flow matrix only has 2365 transitions (discarded 272 similar events)
// Phase 1: matrix 2365 rows 1196 cols
[2024-05-25 08:28:24] [INFO ] Computed 57 invariants in 36 ms
[2024-05-25 08:28:25] [INFO ] Implicit Places using invariants in 953 ms returned [243, 287, 341, 370, 442, 555, 566, 612, 636, 637, 816, 1013]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 960 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1184/1228 places, 2637/2741 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1174 transition count 2627
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1174 transition count 2627
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1164 transition count 2617
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1164 transition count 2617
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1154 transition count 2607
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1154 transition count 2607
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 1147 transition count 2572
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 1147 transition count 2572
Applied a total of 74 rules in 235 ms. Remains 1147 /1184 variables (removed 37) and now considering 2572/2637 (removed 65) transitions.
[2024-05-25 08:28:25] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2024-05-25 08:28:25] [INFO ] Computed 45 invariants in 26 ms
[2024-05-25 08:28:26] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-25 08:28:26] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-25 08:28:26] [INFO ] Invariant cache hit.
[2024-05-25 08:28:27] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-25 08:28:35] [INFO ] Implicit Places using invariants and state equation in 9329 ms returned []
Implicit Place search using SMT with State Equation took 10235 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1228 places, 2572/2741 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11615 ms. Remains : 1147/1228 places, 2572/2741 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s788 1) (AND (GEQ s555 1) (GEQ s557 1))), p0:(AND (GEQ s421 1) (GEQ s424 1) (GEQ s716 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 finished in 11739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1207 transition count 2692
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1207 transition count 2692
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1194 transition count 2639
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1194 transition count 2639
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1191 transition count 2624
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1191 transition count 2624
Applied a total of 74 rules in 188 ms. Remains 1191 /1228 variables (removed 37) and now considering 2624/2741 (removed 117) transitions.
[2024-05-25 08:28:36] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1191 cols
[2024-05-25 08:28:36] [INFO ] Computed 57 invariants in 31 ms
[2024-05-25 08:28:37] [INFO ] Implicit Places using invariants in 1050 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 813, 814, 1008]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1177/1228 places, 2624/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1165 transition count 2612
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1165 transition count 2612
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1153 transition count 2600
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1153 transition count 2600
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 1142 transition count 2589
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 1142 transition count 2589
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 1134 transition count 2549
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 1134 transition count 2549
Applied a total of 86 rules in 238 ms. Remains 1134 /1177 variables (removed 43) and now considering 2549/2624 (removed 75) transitions.
[2024-05-25 08:28:37] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
// Phase 1: matrix 2277 rows 1134 cols
[2024-05-25 08:28:37] [INFO ] Computed 43 invariants in 25 ms
[2024-05-25 08:28:38] [INFO ] Implicit Places using invariants in 934 ms returned []
[2024-05-25 08:28:38] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
[2024-05-25 08:28:38] [INFO ] Invariant cache hit.
[2024-05-25 08:28:38] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 08:28:47] [INFO ] Implicit Places using invariants and state equation in 9447 ms returned [1121]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10383 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1228 places, 2549/2741 transitions.
Applied a total of 0 rules in 45 ms. Remains 1133 /1133 variables (removed 0) and now considering 2549/2549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11907 ms. Remains : 1133/1228 places, 2549/2741 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s553 1) (LT s1097 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 620 steps with 11 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 finished in 12013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1208 transition count 2693
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1208 transition count 2693
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 1196 transition count 2645
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 1196 transition count 2645
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1193 transition count 2630
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1193 transition count 2630
Applied a total of 70 rules in 190 ms. Remains 1193 /1228 variables (removed 35) and now considering 2630/2741 (removed 111) transitions.
[2024-05-25 08:28:48] [INFO ] Flow matrix only has 2358 transitions (discarded 272 similar events)
// Phase 1: matrix 2358 rows 1193 cols
[2024-05-25 08:28:48] [INFO ] Computed 57 invariants in 29 ms
[2024-05-25 08:28:48] [INFO ] Implicit Places using invariants in 951 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 815, 816, 1010]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 955 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1228 places, 2630/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1167 transition count 2618
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1167 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1155 transition count 2606
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1155 transition count 2606
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1143 transition count 2594
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1143 transition count 2594
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1134 transition count 2549
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1134 transition count 2549
Applied a total of 90 rules in 242 ms. Remains 1134 /1179 variables (removed 45) and now considering 2549/2630 (removed 81) transitions.
[2024-05-25 08:28:49] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
// Phase 1: matrix 2277 rows 1134 cols
[2024-05-25 08:28:49] [INFO ] Computed 43 invariants in 28 ms
[2024-05-25 08:28:50] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-25 08:28:50] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
[2024-05-25 08:28:50] [INFO ] Invariant cache hit.
[2024-05-25 08:28:50] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 08:28:58] [INFO ] Implicit Places using invariants and state equation in 8725 ms returned [1121]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9636 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1228 places, 2549/2741 transitions.
Applied a total of 0 rules in 46 ms. Remains 1133 /1133 variables (removed 0) and now considering 2549/2549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11070 ms. Remains : 1133/1228 places, 2549/2741 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s769 1) (GEQ s1097 1) (OR (LT s378 1) (LT s661 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 finished in 11203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1208 transition count 2697
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1208 transition count 2697
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1195 transition count 2644
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1195 transition count 2644
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1192 transition count 2629
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1192 transition count 2629
Applied a total of 72 rules in 180 ms. Remains 1192 /1228 variables (removed 36) and now considering 2629/2741 (removed 112) transitions.
[2024-05-25 08:28:59] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1192 cols
[2024-05-25 08:28:59] [INFO ] Computed 57 invariants in 32 ms
[2024-05-25 08:29:00] [INFO ] Implicit Places using invariants in 974 ms returned [243, 287, 341, 371, 443, 556, 566, 567, 611, 635, 636, 814, 815, 1009]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 976 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1228 places, 2629/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1166 transition count 2617
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1166 transition count 2617
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1154 transition count 2605
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1154 transition count 2605
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1142 transition count 2593
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1142 transition count 2593
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1133 transition count 2548
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1133 transition count 2548
Applied a total of 90 rules in 237 ms. Remains 1133 /1178 variables (removed 45) and now considering 2548/2629 (removed 81) transitions.
[2024-05-25 08:29:00] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2024-05-25 08:29:00] [INFO ] Computed 43 invariants in 23 ms
[2024-05-25 08:29:01] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-25 08:29:01] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
[2024-05-25 08:29:01] [INFO ] Invariant cache hit.
[2024-05-25 08:29:01] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 08:29:10] [INFO ] Implicit Places using invariants and state equation in 9640 ms returned [1105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10519 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1132/1228 places, 2548/2741 transitions.
Applied a total of 0 rules in 42 ms. Remains 1132 /1132 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11954 ms. Remains : 1132/1228 places, 2548/2741 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s352 1) (GEQ s1115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 finished in 12050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 30 place count 1213 transition count 2707
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 68 place count 1194 transition count 2707
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 85 place count 1177 transition count 2666
Iterating global reduction 2 with 17 rules applied. Total rules applied 102 place count 1177 transition count 2666
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 1177 transition count 2661
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 1172 transition count 2661
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 1162 transition count 2611
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1162 transition count 2611
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 178 place count 1139 transition count 2588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 1136 transition count 2585
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 1136 transition count 2585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 187 place count 1133 transition count 2570
Iterating global reduction 2 with 3 rules applied. Total rules applied 190 place count 1133 transition count 2570
Applied a total of 190 rules in 362 ms. Remains 1133 /1228 variables (removed 95) and now considering 2570/2741 (removed 171) transitions.
[2024-05-25 08:29:11] [INFO ] Flow matrix only has 2298 transitions (discarded 272 similar events)
// Phase 1: matrix 2298 rows 1133 cols
[2024-05-25 08:29:11] [INFO ] Computed 57 invariants in 35 ms
[2024-05-25 08:29:12] [INFO ] Implicit Places using invariants in 949 ms returned [221, 263, 317, 344, 414, 524, 534, 535, 574, 597, 598, 770, 771, 961]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 963 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1119/1228 places, 2570/2741 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1110 transition count 2561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1110 transition count 2561
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1101 transition count 2552
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1101 transition count 2552
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1096 transition count 2527
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1096 transition count 2527
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1093 transition count 2524
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1090 transition count 2521
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1090 transition count 2521
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1086 transition count 2501
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1086 transition count 2501
Applied a total of 66 rules in 397 ms. Remains 1086 /1119 variables (removed 33) and now considering 2501/2570 (removed 69) transitions.
[2024-05-25 08:29:12] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1086 cols
[2024-05-25 08:29:12] [INFO ] Computed 43 invariants in 31 ms
[2024-05-25 08:29:13] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-25 08:29:13] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-25 08:29:13] [INFO ] Invariant cache hit.
[2024-05-25 08:29:14] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 08:29:22] [INFO ] Implicit Places using invariants and state equation in 8654 ms returned [1065]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9530 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1085/1228 places, 2501/2741 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 1085 transition count 2500
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 1084 transition count 2500
Applied a total of 2 rules in 547 ms. Remains 1084 /1085 variables (removed 1) and now considering 2500/2501 (removed 1) transitions.
[2024-05-25 08:29:22] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1084 cols
[2024-05-25 08:29:22] [INFO ] Computed 42 invariants in 28 ms
[2024-05-25 08:29:23] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-25 08:29:23] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:29:23] [INFO ] Invariant cache hit.
[2024-05-25 08:29:24] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 08:29:30] [INFO ] Implicit Places using invariants and state equation in 6486 ms returned []
Implicit Place search using SMT with State Equation took 7375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1084/1228 places, 2500/2741 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 19177 ms. Remains : 1084/1228 places, 2500/2741 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s500 1) (GEQ s1068 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 finished in 19296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))&&G(p2))))'
Support contains 8 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2698
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2698
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1197 transition count 2650
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1197 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1194 transition count 2635
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1194 transition count 2635
Applied a total of 68 rules in 194 ms. Remains 1194 /1228 variables (removed 34) and now considering 2635/2741 (removed 106) transitions.
[2024-05-25 08:29:30] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1194 cols
[2024-05-25 08:29:30] [INFO ] Computed 57 invariants in 26 ms
[2024-05-25 08:29:31] [INFO ] Implicit Places using invariants in 912 ms returned [243, 287, 341, 442, 555, 565, 566, 634, 635, 814, 1011]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 914 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1183/1228 places, 2635/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 2624
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 2624
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1161 transition count 2613
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1161 transition count 2613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1150 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1150 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1142 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1142 transition count 2562
Applied a total of 82 rules in 224 ms. Remains 1142 /1183 variables (removed 41) and now considering 2562/2635 (removed 73) transitions.
[2024-05-25 08:29:31] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1142 cols
[2024-05-25 08:29:31] [INFO ] Computed 46 invariants in 30 ms
[2024-05-25 08:29:32] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-25 08:29:32] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-25 08:29:32] [INFO ] Invariant cache hit.
[2024-05-25 08:29:33] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:29:41] [INFO ] Implicit Places using invariants and state equation in 9327 ms returned []
Implicit Place search using SMT with State Equation took 10161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1228 places, 2562/2741 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11493 ms. Remains : 1142/1228 places, 2562/2741 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (LT s2 1) (LT s358 1) (LT s583 1) (LT s584 1)), p1:(OR (LT s804 1) (LT s859 1)), p0:(OR (LT s649 1) (LT s1131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1002 steps with 19 reset in 12 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 finished in 11730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 1 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1228 transition count 2727
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 1214 transition count 2727
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 28 place count 1214 transition count 2708
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 84 place count 1177 transition count 2662
Iterating global reduction 2 with 18 rules applied. Total rules applied 102 place count 1177 transition count 2662
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 1177 transition count 2657
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 1172 transition count 2657
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 1162 transition count 2607
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1162 transition count 2607
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 178 place count 1139 transition count 2584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 180 place count 1137 transition count 2582
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 1137 transition count 2582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 184 place count 1135 transition count 2572
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 353 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-25 08:29:42] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-25 08:29:42] [INFO ] Computed 57 invariants in 33 ms
[2024-05-25 08:29:43] [INFO ] Implicit Places using invariants in 946 ms returned [221, 263, 317, 344, 526, 536, 537, 576, 599, 600, 772, 773, 963]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 947 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1122/1228 places, 2572/2741 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1113 transition count 2563
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1113 transition count 2563
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1104 transition count 2554
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1104 transition count 2554
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1099 transition count 2529
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1099 transition count 2529
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1097 transition count 2527
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1095 transition count 2525
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1095 transition count 2525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1092 transition count 2510
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1092 transition count 2510
Applied a total of 60 rules in 360 ms. Remains 1092 /1122 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-25 08:29:43] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-25 08:29:43] [INFO ] Computed 44 invariants in 30 ms
[2024-05-25 08:29:44] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-25 08:29:44] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-25 08:29:44] [INFO ] Invariant cache hit.
[2024-05-25 08:29:45] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:29:53] [INFO ] Implicit Places using invariants and state equation in 9035 ms returned [1086]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9903 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1228 places, 2510/2741 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 1091 transition count 2509
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 1090 transition count 2509
Applied a total of 2 rules in 84 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-25 08:29:53] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:29:53] [INFO ] Computed 43 invariants in 26 ms
[2024-05-25 08:29:54] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-25 08:29:54] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:29:54] [INFO ] Invariant cache hit.
[2024-05-25 08:29:55] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:30:03] [INFO ] Implicit Places using invariants and state equation in 8494 ms returned []
Implicit Place search using SMT with State Equation took 9389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1228 places, 2509/2741 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21037 ms. Remains : 1090/1228 places, 2509/2741 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GEQ s412 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 finished in 21129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1207 transition count 2692
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1207 transition count 2692
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1194 transition count 2639
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1194 transition count 2639
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1191 transition count 2624
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1191 transition count 2624
Applied a total of 74 rules in 179 ms. Remains 1191 /1228 variables (removed 37) and now considering 2624/2741 (removed 117) transitions.
[2024-05-25 08:30:03] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1191 cols
[2024-05-25 08:30:03] [INFO ] Computed 57 invariants in 35 ms
[2024-05-25 08:30:04] [INFO ] Implicit Places using invariants in 940 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 813, 814, 1008]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 942 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1177/1228 places, 2624/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1165 transition count 2612
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1165 transition count 2612
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1153 transition count 2600
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1153 transition count 2600
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1141 transition count 2588
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1141 transition count 2588
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1132 transition count 2543
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1132 transition count 2543
Applied a total of 90 rules in 236 ms. Remains 1132 /1177 variables (removed 45) and now considering 2543/2624 (removed 81) transitions.
[2024-05-25 08:30:04] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1132 cols
[2024-05-25 08:30:04] [INFO ] Computed 43 invariants in 27 ms
[2024-05-25 08:30:05] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-25 08:30:05] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-25 08:30:05] [INFO ] Invariant cache hit.
[2024-05-25 08:30:06] [INFO ] State equation strengthened by 826 read => feed constraints.
[2024-05-25 08:30:14] [INFO ] Implicit Places using invariants and state equation in 9271 ms returned [1104, 1119]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10153 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1130/1228 places, 2543/2741 transitions.
Applied a total of 0 rules in 43 ms. Remains 1130 /1130 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11555 ms. Remains : 1130/1228 places, 2543/2741 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s274 1) (LT s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 48588 reset in 911 ms.
Product exploration explored 100000 steps with 48544 reset in 876 ms.
Computed a total of 298 stabilizing places and 910 stable transitions
Computed a total of 298 stabilizing places and 910 stable transitions
Detected a total of 298/1130 stabilizing places and 910/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 finished in 13498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 82 place count 1179 transition count 2668
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 1179 transition count 2668
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 98 place count 1179 transition count 2664
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 1175 transition count 2664
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 1166 transition count 2619
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 1166 transition count 2619
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 172 place count 1142 transition count 2595
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1139 transition count 2592
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1139 transition count 2592
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 1136 transition count 2577
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 1136 transition count 2577
Applied a total of 184 rules in 332 ms. Remains 1136 /1228 variables (removed 92) and now considering 2577/2741 (removed 164) transitions.
[2024-05-25 08:30:17] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1136 cols
[2024-05-25 08:30:17] [INFO ] Computed 57 invariants in 37 ms
[2024-05-25 08:30:18] [INFO ] Implicit Places using invariants in 947 ms returned [222, 264, 318, 345, 415, 525, 535, 578, 601, 602, 774, 775, 965]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 949 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1123/1228 places, 2577/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1115 transition count 2569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1115 transition count 2569
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1107 transition count 2561
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1107 transition count 2561
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1103 transition count 2541
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1103 transition count 2541
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1100 transition count 2538
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1097 transition count 2535
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1097 transition count 2535
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1093 transition count 2515
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1093 transition count 2515
Applied a total of 60 rules in 344 ms. Remains 1093 /1123 variables (removed 30) and now considering 2515/2577 (removed 62) transitions.
[2024-05-25 08:30:18] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2024-05-25 08:30:18] [INFO ] Computed 44 invariants in 22 ms
[2024-05-25 08:30:19] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-25 08:30:19] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:19] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:30:27] [INFO ] Implicit Places using invariants and state equation in 7873 ms returned []
Implicit Place search using SMT with State Equation took 8724 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1093/1228 places, 2515/2741 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10349 ms. Remains : 1093/1228 places, 2515/2741 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s523 1) (LT s531 1)), p0:(OR (LT s465 1) (LT s1083 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2720 reset in 506 ms.
Product exploration explored 100000 steps with 2718 reset in 512 ms.
Computed a total of 278 stabilizing places and 899 stable transitions
Computed a total of 278 stabilizing places and 899 stable transitions
Detected a total of 278/1093 stabilizing places and 899/2515 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3116 steps, including 84 resets, run visited all 2 properties in 23 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 73 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2024-05-25 08:30:29] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:29] [INFO ] Invariant cache hit.
[2024-05-25 08:30:29] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-25 08:30:29] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:29] [INFO ] Invariant cache hit.
[2024-05-25 08:30:30] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:30:37] [INFO ] Implicit Places using invariants and state equation in 7877 ms returned []
Implicit Place search using SMT with State Equation took 8700 ms to find 0 implicit places.
[2024-05-25 08:30:37] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-25 08:30:37] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:37] [INFO ] Invariant cache hit.
[2024-05-25 08:30:38] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9813 ms. Remains : 1093/1093 places, 2515/2515 transitions.
Computed a total of 278 stabilizing places and 899 stable transitions
Computed a total of 278 stabilizing places and 899 stable transitions
Detected a total of 278/1093 stabilizing places and 899/2515 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 8698 steps, including 236 resets, run visited all 2 properties in 54 ms. (steps per millisecond=161 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 2723 reset in 465 ms.
Product exploration explored 100000 steps with 2721 reset in 482 ms.
Built C files in :
/tmp/ltsmin13140908060246368072
[2024-05-25 08:30:40] [INFO ] Too many transitions (2515) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:30:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13140908060246368072
Running compilation step : cd /tmp/ltsmin13140908060246368072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13140908060246368072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13140908060246368072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 88 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2024-05-25 08:30:43] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:43] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-25 08:30:44] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:45] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:30:52] [INFO ] Implicit Places using invariants and state equation in 7969 ms returned []
Implicit Place search using SMT with State Equation took 8832 ms to find 0 implicit places.
[2024-05-25 08:30:52] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-25 08:30:52] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-25 08:30:52] [INFO ] Invariant cache hit.
[2024-05-25 08:30:53] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9975 ms. Remains : 1093/1093 places, 2515/2515 transitions.
Built C files in :
/tmp/ltsmin4436818695790549865
[2024-05-25 08:30:53] [INFO ] Too many transitions (2515) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:30:53] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4436818695790549865
Running compilation step : cd /tmp/ltsmin4436818695790549865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4436818695790549865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4436818695790549865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:30:56] [INFO ] Flatten gal took : 48 ms
[2024-05-25 08:30:56] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:30:56] [INFO ] Time to serialize gal into /tmp/LTL9501356436623775996.gal : 13 ms
[2024-05-25 08:30:56] [INFO ] Time to serialize properties into /tmp/LTL12643604843173151503.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9501356436623775996.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13178419845995531333.hoa' '-atoms' '/tmp/LTL12643604843173151503.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12643604843173151503.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13178419845995531333.hoa
Detected timeout of ITS tools.
[2024-05-25 08:31:11] [INFO ] Flatten gal took : 49 ms
[2024-05-25 08:31:11] [INFO ] Flatten gal took : 50 ms
[2024-05-25 08:31:11] [INFO ] Time to serialize gal into /tmp/LTL6455642970115407526.gal : 9 ms
[2024-05-25 08:31:11] [INFO ] Time to serialize properties into /tmp/LTL5552500518156938220.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6455642970115407526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5552500518156938220.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))")))||(G("((Node7HasAskedItsLeafSetToRx2ToReplace...202
Formula 0 simplified : X(GF!"((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))" & F!"((Node7HasAskedItsLeafSetToRx2ToReplaceNode10...192
Detected timeout of ITS tools.
[2024-05-25 08:31:27] [INFO ] Flatten gal took : 49 ms
[2024-05-25 08:31:27] [INFO ] Applying decomposition
[2024-05-25 08:31:27] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18080330363575991857.txt' '-o' '/tmp/graph18080330363575991857.bin' '-w' '/tmp/graph18080330363575991857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18080330363575991857.bin' '-l' '-1' '-v' '-w' '/tmp/graph18080330363575991857.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:31:27] [INFO ] Decomposing Gal with order
[2024-05-25 08:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:31:27] [INFO ] Removed a total of 2253 redundant transitions.
[2024-05-25 08:31:27] [INFO ] Flatten gal took : 203 ms
[2024-05-25 08:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1283 labels/synchronizations in 46 ms.
[2024-05-25 08:31:27] [INFO ] Time to serialize gal into /tmp/LTL9638597285017265225.gal : 16 ms
[2024-05-25 08:31:27] [INFO ] Time to serialize properties into /tmp/LTL3118603776585683823.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9638597285017265225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3118603776585683823.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i15.i2.u155.Node5ManageTheCrashOfNode9<1)||(i15.i1.u19.Rx2IsAtTheRightExtremityOfTheLeafSet<1))")))||(G("((i15.i1.u78.Nod...247
Formula 0 simplified : X(GF!"((i15.i2.u155.Node5ManageTheCrashOfNode9<1)||(i15.i1.u19.Rx2IsAtTheRightExtremityOfTheLeafSet<1))" & F!"((i15.i1.u78.Node7HasA...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7818246131530702630
[2024-05-25 08:31:42] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7818246131530702630
Running compilation step : cd /tmp/ltsmin7818246131530702630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7818246131530702630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7818246131530702630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 88810 ms.
[2024-05-25 08:31:45] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15973552526141976521
[2024-05-25 08:31:45] [INFO ] Too many transitions (2741) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:31:45] [INFO ] Applying decomposition
[2024-05-25 08:31:45] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15973552526141976521
Running compilation step : cd /tmp/ltsmin15973552526141976521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 08:31:45] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14306177876580688534.txt' '-o' '/tmp/graph14306177876580688534.bin' '-w' '/tmp/graph14306177876580688534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14306177876580688534.bin' '-l' '-1' '-v' '-w' '/tmp/graph14306177876580688534.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:31:46] [INFO ] Decomposing Gal with order
[2024-05-25 08:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:31:46] [INFO ] Removed a total of 2172 redundant transitions.
[2024-05-25 08:31:46] [INFO ] Flatten gal took : 158 ms
[2024-05-25 08:31:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1425 labels/synchronizations in 87 ms.
[2024-05-25 08:31:46] [INFO ] Time to serialize gal into /tmp/LTLFireability4402945901791355380.gal : 17 ms
[2024-05-25 08:31:46] [INFO ] Time to serialize properties into /tmp/LTLFireability8364996301304927778.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4402945901791355380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8364996301304927778.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((i2.u17.Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(i2.u195.LeafSetOfRx4IsSentToNode2<1))"))))
Formula 0 simplified : GF!"((i2.u17.Node2HasAskedItsLeafSetToRx4ToReplaceNode14<1)||(i2.u195.LeafSetOfRx4IsSentToNode2<1))"
Compilation finished in 5759 ms.
Running link step : cd /tmp/ltsmin15973552526141976521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15973552526141976521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 1297148 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15973552526141976521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 08:55:13] [INFO ] Flatten gal took : 651 ms
[2024-05-25 08:55:13] [INFO ] Time to serialize gal into /tmp/LTLFireability6364543186134101961.gal : 86 ms
[2024-05-25 08:55:13] [INFO ] Time to serialize properties into /tmp/LTLFireability1406753313745177019.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6364543186134101961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1406753313745177019.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))")))||(G("((Node7HasAskedItsLeafSetToRx2ToReplace...202
Formula 0 simplified : X(GF!"((Node5ManageTheCrashOfNode9<1)||(Rx2IsAtTheRightExtremityOfTheLeafSet<1))" & F!"((Node7HasAskedItsLeafSetToRx2ToReplaceNode10...192
LTSmin run took 325551 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2243758 ms.
BK_STOP 1716627536689
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-S16C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654371900018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;